Searched refs:items (Results 1 - 25 of 117) sorted by relevance

12345

/haiku-fatelf/src/apps/mediaplayer/playlist/
H A DPLItemsCommand.cpp32 PLItemsCommand::_CleanUp(PlaylistItem**& items, int32 count, bool deleteItems) argument
34 if (items == NULL)
38 items[i]->ReleaseReference();
40 delete[] items;
41 items = NULL;
H A DPLItemsCommand.h20 void _CleanUp(PlaylistItem**& items, int32 count,
/haiku-fatelf/headers/private/media/
H A DTList.h13 items((value **)malloc(sizeof(value *) * INIT_COUNT))
15 ASSERT(items);
21 free(items);
32 free(items);
35 items = (value **)malloc(sizeof(value *) * item_max);
36 ASSERT(items);
38 items[i] = new value;
39 *items[i] = *other.items[i];
48 items
126 value **items; member in class:List
[all...]
H A DTMap.h14 items((ent **)malloc(sizeof(ent *) * INIT_COUNT))
16 ASSERT(items);
22 free(items);
33 free(items);
36 items = (ent **)malloc(sizeof(ent *) * item_max);
37 ASSERT(items);
39 items[i] = new ent;
40 items[i]->k = other.items[i]->k;
41 items[
168 ent **items; member in class:Map
[all...]
/haiku-fatelf/src/libs/ncurses/menu/
H A Dm_items.c35 * Connect and disconnect items to and from menus *
44 | Function : int set_menu_items(MENU *menu, ITEM **items)
50 | E_CONNECTED - one or more items are already connected
56 set_menu_items(MENU * menu, ITEM ** items) argument
58 T((T_CALLED("set_menu_items(%p,%p)"), menu, items));
60 if (!menu || (items && !(*items)))
66 if (menu->items)
69 if (items)
71 if (!_nc_Connect_Items(menu, items))
[all...]
H A Dm_new.c44 | Function : MENU *new_menu(ITEM **items)
47 | array items and returns a pointer to the new menu.
54 new_menu(ITEM ** items) argument
58 T((T_CALLED("new_menu(%p)"), items));
65 if (items && *items)
67 if (!_nc_Connect_Items(menu, items))
102 if (menu->items)
H A Dm_scale.c51 | E_NOT_CONNECTED - no items are connected to menu
61 if (menu->items && *(menu->items))
H A Dm_global.c47 16, /* Nr. of items high */
48 1, /* Nr. of items wide */
49 16, /* Nr. of formatted items high */
50 1, /* Nr. of formatted items wide */
51 16, /* Nr. of items high (actual) */
65 (ITEM **)0, /* List of items */
66 0, /* Total Nr. of items in menu */
105 | of the items connected to the menu
114 ITEM **items; local
116 assert(menu && menu->items);
141 ResetConnectionInfo(MENU * menu, ITEM ** items) argument
[all...]
H A Dm_item_top.c50 | E_NOT_CONNECTED - there are no items for the menu
63 if (menu->items == (ITEM **) 0)
77 item = menu->items[(menu->opt & O_ROWMAJOR) ? (row * menu->cols) : row];
98 if (menu && menu->items && *(menu->items))
H A Dm_opts.c73 if (menu->items && menu->items[0])
76 menu->curitem = menu->items[0];
88 if (((item = menu->items) != (ITEM **) 0))
H A Dm_driver.c162 menu->items[idx]->name.str)
174 *item = menu->items[idx];
284 /* only if the menu has less items than rows, we can deny the
326 item = menu->items[0];
331 item = menu->items[menu->nitems - 1];
341 item = menu->items[0];
344 item = menu->items[item->index + 1];
354 item = menu->items[menu->nitems - 1];
357 item = menu->items[item->index - 1];
404 item = menu->items[ite
[all...]
/haiku-fatelf/src/add-ons/media/media-add-ons/mixer/
H A DRtList.h27 items((value*)rtm_alloc(NULL, sizeof(value) * INIT_COUNT))
33 rtm_free(items);
40 rtm_realloc((void**)&items, sizeof(value) * item_max);
42 return &items[item_count++];
47 return &items[index];
69 value* items; member in class:RtList
/haiku-fatelf/src/kits/support/
H A DPointerList.cpp55 Sorts the items in list.
60 the list and sorts all items but the last item.
77 inline void Swap(void **items, int32 i, int32 j);
79 void* BinarySearch(const void *key, const void **items, int32 numItems,
81 void QuickSort(void **items, int32 low, int32 high);
105 AbstractPointerListHelper::Swap(void **items, int32 i, int32 j) argument
107 void *swap = items[i];
108 items[i] = items[j];
109 items[
117 const void **items = static_cast<const void**>(list->Items()); local
127 const void **items = static_cast<const void**>(list->Items()); local
135 void **items = static_cast<void**>(list->Items()); local
143 void **items = static_cast<void**>(list->Items()); local
155 BinarySearch(const void *key, const void **items, int32 numItems, int32 &index) argument
171 QuickSort(void **items, int32 low, int32 high) argument
369 void **items = static_cast<void **>(Items()); local
387 void** items = static_cast<void**>(Items()); local
[all...]
/haiku-fatelf/src/apps/text_search/
H A DModel.cpp184 BList items; local
185 _LoadHistory(items);
188 if (string == NULL || !items.AddItem(string)) {
190 _FreeHistory(items);
194 int32 count = items.CountItems() - 1;
199 BString* string = static_cast<BString*>(items.ItemAt(t));
201 delete static_cast<BString*>(items.RemoveItem(t));
206 while (items.CountItems() >= HISTORY_LIMIT)
207 delete static_cast<BString*>(items.RemoveItem(0L));
209 _SaveHistory(items);
217 BList items; local
[all...]
H A DModel.h133 bool _LoadHistory(BList& items) const;
134 status_t _SaveHistory(const BList& items) const;
135 void _FreeHistory(const BList& items) const;
/haiku-fatelf/src/libs/pdflib/libs/flate/
H A Dzutil.c129 voidpf zcalloc (voidpf opaque, unsigned items, unsigned size) argument
132 ulg bsize = (ulg)items*size;
188 voidpf zcalloc (voidpf opaque, unsigned items, unsigned size) argument
191 return _halloc((long)items, size);
206 extern voidp calloc OF((uInt items, uInt size));
212 unsigned items,
215 if (opaque) items += size - size; /* make compiler happy */
216 return (voidpf)calloc(items, size);
210 zcalloc( voidpf opaque, unsigned items, unsigned size) argument
/haiku-fatelf/src/system/libroot/posix/glibc/locale/
H A Dxlocale.c24 #define DEFINE_CATEGORY(category, category_name, items, a) \
/haiku-fatelf/src/apps/icon-o-matic/gui/
H A DTransformerListView.h44 virtual void MoveItems(BList& items, int32 toIndex);
45 virtual void CopyItems(BList& items, int32 toIndex);
46 virtual void RemoveItemList(BList& items);
/haiku-fatelf/src/libs/ncurses/test/
H A Ddemo_menus.c174 /* FIXME: MENU.itemlen seems the only way to get actual width of items */
181 menu_create(ITEM ** items, int count, int ncols, MenuNo number) argument
195 result = new_menu(items);
270 static ITEM *items[SIZEOF(labels)]; local
272 ITEM **ip = items;
279 mpFile = menu_create(items, SIZEOF(labels) - 1, 1, number);
310 static ITEM **items; local
326 items = (ITEM **) calloc(sizeof(ITEM *), size + 1);
343 blob[j] = ' '; /* menu items are printable */
357 items
408 static ITEM *items[SIZEOF(t_tbl)]; local
453 ITEM **items; local
552 static ITEM *items[SIZEOF(labels)]; local
[all...]
/haiku-fatelf/src/libs/pdflib/bind/pdflib/perl/
H A Dpdflib_pl.c419 if (items != 6)
449 if (items != 7)
484 if (items != 9)
518 if (items != 8)
549 if (items != 6)
584 if (items != 10)
615 if (items != 4)
639 if (items != 3)
662 if (items != 3)
686 if (items !
[all...]
/haiku-fatelf/src/tests/system/kernel/util/
H A DDoublyLinkedListTest.cpp93 Item items[valueCount]; local
98 items[i].value = i;
99 list.Add(&items[i]);
106 // count items in list
123 CHK(item == &items[i]);
131 CHK(first == &items[0]);
/haiku-fatelf/src/libs/zlib/
H A Dzutil.c216 voidpf ZLIB_INTERNAL zcalloc (voidpf opaque, unsigned items, unsigned size) argument
219 ulg bsize = (ulg)items*size;
275 voidpf ZLIB_INTERNAL zcalloc (voidpf opaque, uInt items, uInt size) argument
278 return _halloc((long)items, size);
296 extern voidp calloc OF((uInt items, uInt size));
300 voidpf ZLIB_INTERNAL zcalloc (opaque, items, size)
302 unsigned items;
305 if (opaque) items += size - size; /* make compiler happy */
306 return sizeof(uInt) > 2 ? (voidpf)malloc(items * size) :
307 (voidpf)calloc(items, siz
[all...]
/haiku-fatelf/src/apps/installer/
H A DProgressReporter.h24 void ItemsWritten(uint64 items, off_t bytes,
/haiku-fatelf/src/servers/mail/
H A DNotifier.h31 void SetTotalItems(int32 items);
/haiku-fatelf/src/apps/glteapot/
H A Dutil.h407 T * items; member in struct:BufferArray
414 items = (T*)realloc(items,sizeof(T)*i);
422 return items[index];
429 return items[index];
438 memcpy(items+num_items,&item,sizeof(item));
449 items = (T*)malloc(sizeof(T)*num_slots);
455 free(items);

Completed in 114 milliseconds

12345