Searched refs:list (Results 1 - 25 of 437) sorted by path

1234567891011>>

/haiku/3rdparty/kallisti5/
H A DvalidateRepoFile30 if remote_file_exists "$REPO_URL/$SHA256/package.list" ; then
36 for i in $(curl -s -L $REPO_URL/$SHA256/package.list | tr '\n' ' '); do
/haiku/3rdparty/mmu_man/scripts/
H A DHardwareChecker.sh275 echo "<i>(list of loaded kernel drivers)</i><br />"
281 echo "<i>(list of network interfaces)</i><br />"
286 echo "<h3><tt>pkgman list-repos</tt></h3>"
287 echo "<i>(list of configured package repositories)</i><br />"
289 pkgman list-repos
293 echo "<i>(list of installed packaged)</i><br />"
/haiku/docs/develop/kits/storage/resources/
H A DResourcesFormat.tex562 incomplete, list:
595 It follows a list of items with a low degree of reliance:
/haiku/docs/interface_guidelines/docbook-css/
H A Dstyles.css175 display:list-item;
386 list-style-type: disc;
395 list-style-type: circle;
400 list-style-type: square;
405 display:list-item;
410 list-style-type: decimal;
414 display:list-item;
419 * present as a list of bullet points.
423 list-style-type: disc;
426 display:list
[all...]
/haiku/headers/build/gcc-2.95.3/
H A Dproto.h4 #define _PROTO(list) ()
/haiku/headers/build/os/app/
H A DMessage.h109 status_t AddStrings(const char *name, const BStringList &list);
145 status_t FindStrings(const char *name, BStringList *list) const;
306 // fQueueLink is used by BMessageQueue to build a linked list
/haiku/headers/compatibility/bsd/
H A Dlibutil.h16 * notice, this list of conditions and the following disclaimer.
18 * notice, this list of conditions and the following disclaimer in the
95 void properties_free(properties list);
96 char *property_find(properties list, const char *name);
/haiku/headers/cpp/
H A Dlist.h35 using __STD::list;
H A Dstl.h8 #include <list>
H A Dstl_list.h247 class list : protected _List_base<_Tp, _Alloc> { class in inherits:_List_base
310 explicit list(const allocator_type& __a = allocator_type()) : _Base(__a) {} function in class:list
341 void swap(list<_Tp, _Alloc>& __x) { __STD::swap(_M_node, __x._M_node); }
404 list(size_type __n, const _Tp& __value, function in class:list
408 explicit list(size_type __n) function in class:list
417 list(_InputIterator __first, _InputIterator __last, function in class:list
424 list(const _Tp* __first, const _Tp* __last, function in class:list
428 list(const_iterator __first, const_iterator __last, function in class:list
434 list(const list<_T argument
516 operator ==(const list<_Tp,_Alloc>& __x, const list<_Tp,_Alloc>& __y) argument
532 operator <(const list<_Tp,_Alloc>& __x, const list<_Tp,_Alloc>& __y) argument
615 operator =(const list<_Tp, _Alloc>& __x) argument
[all...]
/haiku/headers/libs/linprog/
H A DLinearSpec.h168 /*! Check if all entries != NULL otherwise delete the list and its
170 bool _CheckSummandList(SummandList* list);
/haiku/headers/libs/print/libprint/
H A DPrintProcess.h10 #include <list>
48 typedef list<PageData *> PageDataList;
/haiku/headers/os/add-ons/graphics/
H A DAccelerant.h331 typedef void (*screen_to_screen_blit)(engine_token* et, blit_params* list,
334 fill_rect_params* list, uint32 count);
335 typedef void (*invert_rectangle)(engine_token* et, fill_rect_params* list,
338 uint32 transparent_color, blit_params* list, uint32 count);
340 scaled_blit_params* list, uint32 count);
342 typedef void (*fill_span)(engine_token* et, uint32 color, uint16* list,
345 The uint16* list points to a list of tripples:
346 list[N+0] Y co-ordinate of span
347 list[
[all...]
/haiku/headers/os/app/
H A DLooper.h155 BHandler* _ApplyFilters(BList* list, BMessage* msg,
/haiku/headers/os/interface/
H A DInput.h40 status_t get_input_devices(BList* list);
63 friend status_t get_input_devices(BList* list);
/haiku/headers/os/support/
H A DList.h25 bool AddList(const BList* list, int32 index);
26 bool AddList(const BList* list);
H A DObjectList.h78 _PointerList_(const _PointerList_ &list);
125 BObjectList(const BObjectList& list);
126 // clones list; if list is owning, makes
131 BObjectList& operator=(const BObjectList& list);
132 // clones list; if list is owning, makes
152 // if list is owning, deletes the item
184 // list must be sorted with CompareFunction for
209 // Binary insertion - list mus
258 WhileEachListItem(BObjectList<Item>* list, Result (Item::*func)(Param1), Param1 p1) argument
275 WhileEachListItem(BObjectList<Item>* list, Result (*func)(Item*, Param1), Param1 p1) argument
292 WhileEachListItem(BObjectList<Item>* list, Result (Item::*func)(Param1, Param2), Param1 p1, Param2 p2) argument
309 WhileEachListItem(BObjectList<Item>* list, Result (*func)(Item*, Param1, Param2), Param1 p1, Param2 p2) argument
327 WhileEachListItem(BObjectList<Item>* list, Result (*func)(Item*, Param1, Param2, Param3, Param4), Param1 p1, Param2 p2, Param3 p3, Param4 p4) argument
345 EachListItemIgnoreResult(BObjectList<Item>* list, Result (Item::*func)()) argument
355 EachListItem(BObjectList<Item>* list, void (*func)(Item*, Param1), Param1 p1) argument
365 EachListItem(BObjectList<Item>* list, void (Item::*func)(Param1, Param2), Param1 p1, Param2 p2) argument
376 EachListItem(BObjectList<Item>* list, void (*func)(Item*,Param1, Param2), Param1 p1, Param2 p2) argument
387 EachListItem(BObjectList<Item>* list, void (*func)(Item*,Param1, Param2, Param3), Param1 p1, Param2 p2, Param3 p3) argument
398 EachListItem(BObjectList<Item>* list, void (*func)(Item*,Param1, Param2, Param3, Param4), Param1 p1, Param2 p2, Param3 p3, Param4 p4) argument
427 BObjectList(const BObjectList<T>& list) argument
457 operator =(const BObjectList<T>& list) argument
494 AddList(BObjectList<T>* list) argument
502 AddList(BObjectList<T>* list, int32 index) argument
[all...]
H A DStringList.h24 bool Add(const BStringList& list, int32 index);
25 bool Add(const BStringList& list);
29 bool Remove(const BStringList& list,
/haiku/headers/private/app/
H A DLooperList.h37 void GetLooperList(BList* list);
/haiku/headers/private/device/
H A DJoystickTweaker.h53 BList *list, BEntry *rootEntry = NULL);
55 void _EmpyList(BList *list);
/haiku/headers/private/fs_shell/
H A DSinglyLinkedList.h102 Iterator(const List* list) argument
104 fList(list)
/haiku/headers/private/kernel/boot/
H A Ddriver_settings.h10 #include <util/list.h>
H A Dpartitions.h33 static Partition *Lookup(partition_id id, NodeList *list = NULL);
/haiku/headers/private/kernel/util/
H A DSinglyLinkedList.h99 Iterator(const List* list) argument
101 fList(list)
152 // O(1) if either list is empty, otherwise O(n).
190 /*! Removes \a element from the list.
191 It is safe to call the list with a \c NULL element or an element that isn't
192 in the list.
194 \return \c true, if the element was in the list and has been removed,
249 // This list is empty -- just transfer the head.
255 // Neither list is empty -- find the tail of this list
[all...]
H A Dlist.h12 /* This header defines a doubly-linked list. It differentiates between a link
14 * A link is what is put into and removed from a list, an item is the whole
34 /* The object that is put into the list must begin with these
43 struct list { struct
53 extern void list_init(struct list *list);
54 extern void list_init_etc(struct list *list, int32 offset);
55 extern void list_add_link_to_head(struct list *list, voi
69 list_is_empty(struct list *list) argument
75 list_get_first_item(struct list *list) argument
[all...]

Completed in 118 milliseconds

1234567891011>>