Home
last modified time | relevance | path

Searched refs:list (Results 1 - 25 of 3344) sorted by relevance

12345678910>>...134

/third_party/protobuf/java/core/src/test/java/com/google/protobuf/
H A DProtobufArrayListTest.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
48 private ProtobufArrayList<Integer> list; field in ProtobufArrayListTest
52 list = new ProtobufArrayList<Integer>(); in setUp()
64 list.addAll(asList(1, 2, 3, 4)); in testModificationWithIteration()
65 Iterator<Integer> iterator = list.iterator(); in testModificationWithIteration()
66 assertEquals(4, list.size()); in testModificationWithIteration()
67 assertEquals(1, (int) list.get(0)); in testModificationWithIteration()
70 list.remove(0); in testModificationWithIteration()
78 iterator = list in testModificationWithIteration()
245 assertImmutable(List<Integer> list) assertImmutable() argument
[all...]
H A DIntArrayListTest.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
51 private IntArrayList list; field in IntArrayListTest
55 list = new IntArrayList(); in setUp()
67 list.addInt(3); in testMakeImmutable()
68 list.addInt(4); in testMakeImmutable()
69 list.addInt(5); in testMakeImmutable()
70 list.addInt(7); in testMakeImmutable()
71 list.makeImmutable(); in testMakeImmutable()
72 assertImmutable(list); in testMakeImmutable()
389 assertImmutable(IntList list) assertImmutable() argument
[all...]
H A DBooleanArrayListTest.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
52 private BooleanArrayList list; field in BooleanArrayListTest
56 list = new BooleanArrayList(); in setUp()
68 list.addBoolean(true); in testMakeImmutable()
69 list.addBoolean(false); in testMakeImmutable()
70 list.addBoolean(true); in testMakeImmutable()
71 list.addBoolean(true); in testMakeImmutable()
72 list.makeImmutable(); in testMakeImmutable()
73 assertImmutable(list); in testMakeImmutable()
391 assertImmutable(BooleanList list) assertImmutable() argument
[all...]
H A DLazyStringArrayListTest.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
58 LazyStringArrayList list = new LazyStringArrayList(); in testJustStrings()
59 list.add(STRING_A); in testJustStrings()
60 list.add(STRING_B); in testJustStrings()
61 list.add(STRING_C); in testJustStrings()
63 assertEquals(3, list.size()); in testJustStrings()
64 assertSame(STRING_A, list.get(0)); in testJustStrings()
65 assertSame(STRING_B, list.get(1)); in testJustStrings()
66 assertSame(STRING_C, list in testJustStrings()
285 assertGenericListImmutable(List<T> list, T value) assertGenericListImmutable() argument
[all...]
H A DFloatArrayListTest.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
51 private FloatArrayList list; field in FloatArrayListTest
55 list = new FloatArrayList(); in setUp()
67 list.addFloat(3); in testMakeImmutable()
68 list.addFloat(4); in testMakeImmutable()
69 list.addFloat(5); in testMakeImmutable()
70 list.addFloat(7); in testMakeImmutable()
71 list.makeImmutable(); in testMakeImmutable()
72 assertImmutable(list); in testMakeImmutable()
391 assertImmutable(FloatList list) assertImmutable() argument
[all...]
H A DDoubleArrayListTest.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
51 private DoubleArrayList list; field in DoubleArrayListTest
55 list = new DoubleArrayList(); in setUp()
67 list.addDouble(3); in testMakeImmutable()
68 list.addDouble(4); in testMakeImmutable()
69 list.addDouble(5); in testMakeImmutable()
70 list.addDouble(7); in testMakeImmutable()
71 list.makeImmutable(); in testMakeImmutable()
72 assertImmutable(list); in testMakeImmutable()
391 assertImmutable(DoubleList list) assertImmutable() argument
[all...]
H A DLongArrayListTest.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
51 private LongArrayList list; field in LongArrayListTest
55 list = new LongArrayList(); in setUp()
67 list.addLong(3); in testMakeImmutable()
68 list.addLong(4); in testMakeImmutable()
69 list.addLong(5); in testMakeImmutable()
70 list.addLong(7); in testMakeImmutable()
71 list.makeImmutable(); in testMakeImmutable()
72 assertImmutable(list); in testMakeImmutable()
389 assertImmutable(LongList list) assertImmutable() argument
[all...]
/third_party/node/deps/cares/src/lib/
H A Dares__slist.c61 ares__slist_t *list; in ares__slist_create() local
67 list = ares_malloc_zero(sizeof(*list)); in ares__slist_create()
69 if (list == NULL) { in ares__slist_create()
73 list->rand_state = rand_state; in ares__slist_create()
74 list->cmp = cmp; in ares__slist_create()
75 list->destruct = destruct; in ares__slist_create()
77 list->levels = ARES__SLIST_START_LEVELS; in ares__slist_create()
78 list->head = ares_malloc_zero(sizeof(*list in ares__slist_create()
87 ares__slist_coin_flip(ares__slist_t *list) ares__slist_coin_flip() argument
108 ares__slist_replace_destructor(ares__slist_t *list, ares__slist_destructor_t destruct) ares__slist_replace_destructor() argument
118 ares__slist_max_level(const ares__slist_t *list) ares__slist_max_level() argument
135 ares__slist_calc_level(ares__slist_t *list) ares__slist_calc_level() argument
146 ares__slist_node_push(ares__slist_t *list, ares__slist_node_t *node) ares__slist_node_push() argument
198 ares__slist_insert(ares__slist_t *list, void *val) ares__slist_insert() argument
260 ares__slist_t *list = node->parent; ares__slist_node_pop() local
286 ares__slist_t *list; ares__slist_node_claim() local
309 ares__slist_t *list; ares__slist_node_reinsert() local
321 ares__slist_node_find(ares__slist_t *list, const void *val) ares__slist_node_find() argument
380 ares__slist_node_first(ares__slist_t *list) ares__slist_node_first() argument
389 ares__slist_node_last(ares__slist_t *list) ares__slist_node_last() argument
422 ares__slist_len(const ares__slist_t *list) ares__slist_len() argument
438 ares__slist_first_val(ares__slist_t *list) ares__slist_first_val() argument
443 ares__slist_last_val(ares__slist_t *list) ares__slist_last_val() argument
465 ares__slist_destroy(ares__slist_t *list) ares__slist_destroy() argument
[all...]
H A Dares__llist.c47 ares__llist_t *list = ares_malloc_zero(sizeof(*list)); in ares__llist_create() local
49 if (list == NULL) { in ares__llist_create()
53 list->destruct = destruct; in ares__llist_create()
55 return list; in ares__llist_create()
58 void ares__llist_replace_destructor(ares__llist_t *list, in ares__llist_replace_destructor() argument
61 if (list == NULL) { in ares__llist_replace_destructor()
65 list->destruct = destruct; in ares__llist_replace_destructor()
74 static void ares__llist_attach_at(ares__llist_t *list, in ares__llist_attach_at() argument
79 if (list in ares__llist_attach_at()
122 ares__llist_insert_at(ares__llist_t *list, ares__llist_insert_type_t type, ares__llist_node_t *at, void *val) ares__llist_insert_at() argument
145 ares__llist_insert_first(ares__llist_t *list, void *val) ares__llist_insert_first() argument
150 ares__llist_insert_last(ares__llist_t *list, void *val) ares__llist_insert_last() argument
181 ares__llist_node_first(ares__llist_t *list) ares__llist_node_first() argument
189 ares__llist_node_last(ares__llist_t *list) ares__llist_node_last() argument
222 ares__llist_len(const ares__llist_t *list) ares__llist_len() argument
238 ares__llist_first_val(ares__llist_t *list) ares__llist_first_val() argument
243 ares__llist_last_val(ares__llist_t *list) ares__llist_last_val() argument
250 ares__llist_t *list; ares__llist_node_detach() local
326 ares__llist_destroy(ares__llist_t *list) ares__llist_destroy() argument
[all...]
/third_party/mesa3d/src/gallium/frontends/nine/
H A Dnine_shader.h134 nine_shader_variant_get(struct nine_shader_variant *list, in nine_shader_variant_get() argument
139 while (list->key != key && list->next) in nine_shader_variant_get()
140 list = list->next; in nine_shader_variant_get()
141 if (list->key == key) { in nine_shader_variant_get()
142 *const_ranges = list->const_ranges; in nine_shader_variant_get()
143 *const_used_size = list->const_used_size; in nine_shader_variant_get()
144 return list->cso; in nine_shader_variant_get()
150 nine_shader_variant_add(struct nine_shader_variant *list, in nine_shader_variant_add() argument
171 nine_shader_variants_free(struct nine_shader_variant *list) nine_shader_variants_free() argument
189 nine_shader_variant_so_get(struct nine_shader_variant_so *list, struct NineVertexDeclaration9 *vdecl, struct pipe_stream_output_info *so) nine_shader_variant_so_get() argument
203 nine_shader_variant_so_add(struct nine_shader_variant_so *list, struct NineVertexDeclaration9 *vdecl, struct pipe_stream_output_info *so, void *cso) nine_shader_variant_so_add() argument
229 nine_shader_variants_so_free(struct nine_shader_variant_so *list) nine_shader_variants_so_free() argument
251 nine_shader_constant_combination_key(struct nine_shader_constant_combination **list, boolean *int_slots_used, boolean *bool_slots_used, int *const_i, BOOL *const_b) nine_shader_constant_combination_key() argument
298 nine_shader_constant_combination_get(struct nine_shader_constant_combination *list, uint8_t index) nine_shader_constant_combination_get() argument
314 nine_shader_constant_combination_free(struct nine_shader_constant_combination *list) nine_shader_constant_combination_free() argument
[all...]
/third_party/protobuf/csharp/src/Google.Protobuf.Test/Collections/
H A DRepeatedFieldTest.cs11 // notice, this list of conditions and the following disclaimer.
13 // copyright notice, this list of conditions and the following disclaimer
51 var list = new RepeatedField<string>(); in NullValuesRejected()
52 Assert.Throws<ArgumentNullException>(() => list.Add((string)null)); in NullValuesRejected()
53 Assert.Throws<ArgumentNullException>(() => list.Add((IEnumerable<string>)null)); in NullValuesRejected()
54 Assert.Throws<ArgumentNullException>(() => list.Add((RepeatedField<string>)null)); in NullValuesRejected()
55 Assert.Throws<ArgumentNullException>(() => list.Contains(null)); in NullValuesRejected()
56 Assert.Throws<ArgumentNullException>(() => list.IndexOf(null)); in NullValuesRejected()
62 var list = new RepeatedField<string>(); in Add_SingleItem()
63 list in Add_SingleItem()
[all...]
/third_party/skia/third_party/externals/dawn/src/tests/unittests/
H A DLinkedListTests.cpp11 #include <list>
58 // Checks that when iterating |list| (either from head to tail, or from
61 void ExpectListContentsForDirection(const LinkedList<Node>& list, in ExpectListContentsForDirection() argument
66 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); node != list.end(); in ExpectListContentsForDirection()
76 void ExpectListContents(const LinkedList<Node>& list, int num_nodes, const int* node_ids) { in ExpectListContents() argument
79 ExpectListContentsForDirection(list, num_nodes, node_ids, true); in ExpectListContents()
83 ExpectListContentsForDirection(list, num_nodes, node_ids, false); in ExpectListContents()
88 LinkedList<Node> list; in TEST() local
95 LinkedList<Node> list; TEST() local
130 LinkedList<Node> list; TEST() local
205 LinkedList<Node> list; TEST() local
242 LinkedList<Node> list; TEST() local
284 LinkedList<Node> list; TEST() local
289 LinkedList<Node> list; TEST() local
298 LinkedList<Node> list; TEST() local
320 LinkedList<Node> list; TEST() local
331 LinkedList<MovableNode> list; TEST() local
360 LinkedList<Node> list; TEST() local
418 LinkedList<Node> list; TEST() local
433 LinkedList<Node> list; TEST() local
[all...]
/third_party/alsa-lib/src/control/
H A Dnamehint.c34 char **list; member
51 static int hint_list_add(struct hint_list *list, in hint_list_add() argument
57 if (list->count + 1 >= list->allocated) { in hint_list_add()
58 char **n = realloc(list->list, (list->allocated + 10) * sizeof(char *)); in hint_list_add()
61 memset(n + list->allocated, 0, 10 * sizeof(*n)); in hint_list_add()
62 list->allocated += 10; in hint_list_add()
63 list in hint_list_add()
85 hint_list_add_custom(struct hint_list *list, const char *entry) hint_list_add_custom() argument
116 get_dev_name1(struct hint_list *list, char **res, int device, int stream) get_dev_name1() argument
170 get_dev_name(struct hint_list *list) get_dev_name() argument
237 try_config(snd_config_t *config, struct hint_list *list, const char *base, const char *name) try_config() argument
447 add_card(snd_config_t *config, snd_config_t *rw_config, struct hint_list *list, int card) add_card() argument
515 get_card_name(struct hint_list *list, int card) get_card_name() argument
533 add_software_devices(snd_config_t *config, snd_config_t *rw_config, struct hint_list *list) add_software_devices() argument
585 struct hint_list list; snd_device_name_hint() local
[all...]
/third_party/ltp/tools/sparse/sparse-src/
H A Dptrlist.c8 // Pointer list manipulation
13 // * NULL is used by {PREPARE,NEXT}_PTR_LIST() to indicate the end-of-list.
17 // (OP_PHI) use a list to store their operands, a VOID in a phi-node
18 // list must be ignored since it represents a removed operand. As
32 __ALLOCATOR(struct ptr_list, "ptr list", ptrlist);
36 // @head: the head of the list
37 // @return: the size of the list given by @head.
43 struct ptr_list *list = head; in ptr_list_size() local
45 nr += list->nr - list in ptr_list_size()
57 const struct ptr_list *list = head; ptr_list_empty() local
76 const struct ptr_list *list = head; ptr_list_multiple() local
97 struct ptr_list *list = head; first_ptr_list() local
116 struct ptr_list *list; last_ptr_list() local
133 ptr_list_nth_entry(struct ptr_list *list, unsigned int idx) ptr_list_nth_entry() argument
169 struct ptr_list *list = head; linearize_ptr_list() local
262 struct ptr_list *list = *listp; __add_ptr_list() local
316 const struct ptr_list *list = head; lookup_ptr_list_entry() local
335 delete_ptr_list_entry(struct ptr_list **list, void *entry, int count) delete_ptr_list_entry() argument
358 replace_ptr_list_entry(struct ptr_list **list, void *old_ptr, void *new_ptr, int count) replace_ptr_list_entry() argument
497 struct ptr_list *tmp, *list = *listp; __free_ptr_list() local
[all...]
/third_party/protobuf/csharp/compatibility_tests/v3.0.0/src/Google.Protobuf.Test/Collections/
H A DRepeatedFieldTest.cs11 // notice, this list of conditions and the following disclaimer.
13 // copyright notice, this list of conditions and the following disclaimer
50 var list = new RepeatedField<string>(); in NullValuesRejected()
51 Assert.Throws<ArgumentNullException>(() => list.Add((string)null)); in NullValuesRejected()
52 Assert.Throws<ArgumentNullException>(() => list.Add((IEnumerable<string>)null)); in NullValuesRejected()
53 Assert.Throws<ArgumentNullException>(() => list.Add((RepeatedField<string>)null)); in NullValuesRejected()
54 Assert.Throws<ArgumentNullException>(() => list.Contains(null)); in NullValuesRejected()
55 Assert.Throws<ArgumentNullException>(() => list.IndexOf(null)); in NullValuesRejected()
61 var list = new RepeatedField<string>(); in Add_SingleItem()
62 list in Add_SingleItem()
[all...]
/third_party/skia/src/core/
H A DSkTMultiMap.h49 ValueList* list = fHash.find(key); in insert() local
50 if (list) { in insert()
52 // linked list, and it will contain the value of the first element. in insert()
53 ValueList* newEntry = new ValueList(list->fValue); in insert()
54 newEntry->fNext = list->fNext; in insert()
57 list->fNext = newEntry; in insert()
58 list->fValue = value; in insert()
67 ValueList* list = fHash.find(key); in remove() local
73 SkASSERT(list); in remove()
75 while (list in remove()
95 ValueList* list = fHash.find(key); find() local
104 ValueList* list = fHash.find(key); find() local
116 ValueList* list = fHash.find(key); findAndRemove() local
155 ValueList* list = fHash.find(key); countForKey() local
[all...]
/third_party/eudev/src/libudev/
H A Dlibudev-list.c31 * SECTION:libudev-list
32 * @short_description: list operation
34 * Libudev list operations.
40 * Opaque object representing one entry in a list. An entry contains
45 struct udev_list *list; member
51 /* the list's head points to itself if empty */
52 void udev_list_node_init(struct udev_list_node *list) in udev_list_node_init() argument
54 list->next = list; in udev_list_node_init()
55 list in udev_list_node_init()
58 udev_list_node_is_empty(struct udev_list_node *list) udev_list_node_is_empty() argument
73 udev_list_node_append(struct udev_list_node *new, struct udev_list_node *list) udev_list_node_append() argument
96 udev_list_init(struct udev *udev, struct udev_list *list, bool unique) udev_list_init() argument
105 udev_list_entry_append(struct udev_list_entry *new, struct udev_list *list) udev_list_entry_append() argument
120 list_search(struct udev_list *list, const char *name) list_search() argument
144 udev_list_entry_add(struct udev_list *list, const char *name, const char *value) udev_list_entry_add() argument
230 struct udev_list *list = entry->list; udev_list_entry_delete() local
247 udev_list_cleanup(struct udev_list *list) udev_list_cleanup() argument
260 udev_list_get_entry(struct udev_list *list) udev_list_get_entry() argument
[all...]
/third_party/node/test/parallel/
H A Dtest-stream-buffer-list.js7 // Test empty buffer list.
19 function testIterator(list, count) {
23 for (const x of list) {
29 // Test buffer list with one element.
30 const list = new BufferList();
31 testIterator(list, 0);
33 list.push(buf);
34 testIterator(list, 1);
35 for (const x of list) {
39 const copy = list
[all...]
/third_party/icu/icu4c/source/common/
H A Dulist.cpp34 static void ulist_addFirstItem(UList *list, UListNode *newItem);
58 * Function called by addItemEndList or addItemBeginList when the first item is added to the list.
61 static void ulist_addFirstItem(UList *list, UListNode *newItem) { in ulist_addFirstItem() argument
64 list->head = newItem; in ulist_addFirstItem()
65 list->tail = newItem; in ulist_addFirstItem()
68 static void ulist_removeItem(UList *list, UListNode *p) { in ulist_removeItem() argument
70 // p is the list head. in ulist_removeItem()
71 list->head = p->next; in ulist_removeItem()
76 // p is the list tail. in ulist_removeItem()
77 list in ulist_removeItem()
91 ulist_addItemEndList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) ulist_addItemEndList() argument
124 ulist_addItemBeginList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) ulist_addItemBeginList() argument
157 ulist_containsString(const UList *list, const char *data, int32_t length) ulist_containsString() argument
171 ulist_removeString(UList *list, const char *data) ulist_removeString() argument
185 ulist_getNext(UList *list) ulist_getNext() argument
198 ulist_getListSize(const UList *list) ulist_getListSize() argument
206 ulist_resetList(UList *list) ulist_resetList() argument
212 ulist_deleteList(UList *list) ulist_deleteList() argument
[all...]
/third_party/node/deps/icu-small/source/common/
H A Dulist.cpp34 static void ulist_addFirstItem(UList *list, UListNode *newItem);
58 * Function called by addItemEndList or addItemBeginList when the first item is added to the list.
61 static void ulist_addFirstItem(UList *list, UListNode *newItem) { in ulist_addFirstItem() argument
64 list->head = newItem; in ulist_addFirstItem()
65 list->tail = newItem; in ulist_addFirstItem()
68 static void ulist_removeItem(UList *list, UListNode *p) { in ulist_removeItem() argument
70 // p is the list head. in ulist_removeItem()
71 list->head = p->next; in ulist_removeItem()
76 // p is the list tail. in ulist_removeItem()
77 list in ulist_removeItem()
91 ulist_addItemEndList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) ulist_addItemEndList() argument
124 ulist_addItemBeginList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) ulist_addItemBeginList() argument
157 ulist_containsString(const UList *list, const char *data, int32_t length) ulist_containsString() argument
171 ulist_removeString(UList *list, const char *data) ulist_removeString() argument
185 ulist_getNext(UList *list) ulist_getNext() argument
198 ulist_getListSize(const UList *list) ulist_getListSize() argument
206 ulist_resetList(UList *list) ulist_resetList() argument
212 ulist_deleteList(UList *list) ulist_deleteList() argument
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Dulist.cpp34 static void ulist_addFirstItem(UList *list, UListNode *newItem);
58 * Function called by addItemEndList or addItemBeginList when the first item is added to the list.
61 static void ulist_addFirstItem(UList *list, UListNode *newItem) { in ulist_addFirstItem() argument
64 list->head = newItem; in ulist_addFirstItem()
65 list->tail = newItem; in ulist_addFirstItem()
68 static void ulist_removeItem(UList *list, UListNode *p) { in ulist_removeItem() argument
70 // p is the list head. in ulist_removeItem()
71 list->head = p->next; in ulist_removeItem()
76 // p is the list tail. in ulist_removeItem()
77 list in ulist_removeItem()
91 ulist_addItemEndList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) ulist_addItemEndList() argument
124 ulist_addItemBeginList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) ulist_addItemBeginList() argument
157 ulist_containsString(const UList *list, const char *data, int32_t length) ulist_containsString() argument
171 ulist_removeString(UList *list, const char *data) ulist_removeString() argument
185 ulist_getNext(UList *list) ulist_getNext() argument
198 ulist_getListSize(const UList *list) ulist_getListSize() argument
206 ulist_resetList(UList *list) ulist_resetList() argument
212 ulist_deleteList(UList *list) ulist_deleteList() argument
[all...]
/third_party/selinux/libsepol/cil/src/
H A Dcil_list.c8 * this list of conditions and the following disclaimer.
11 * this list of conditions and the following disclaimer in the documentation
47 void cil_list_init(struct cil_list **list, enum cil_flavor flavor) in cil_list_init() argument
53 *list = new_list; in cil_list_init()
56 void cil_list_destroy(struct cil_list **list, unsigned destroy_data) in cil_list_destroy() argument
60 if (*list == NULL) { in cil_list_destroy()
64 item = (*list)->head; in cil_list_destroy()
76 free(*list); in cil_list_destroy()
77 *list = NULL; in cil_list_destroy()
99 void cil_list_append(struct cil_list *list, enu argument
121 cil_list_prepend(struct cil_list *list, enum cil_flavor flavor, void *data) cil_list_prepend() argument
143 cil_list_insert(struct cil_list *list, struct cil_list_item *curr, enum cil_flavor flavor, void *data) cil_list_insert() argument
172 cil_list_append_item(struct cil_list *list, struct cil_list_item *item) cil_list_append_item() argument
199 cil_list_prepend_item(struct cil_list *list, struct cil_list_item *item) cil_list_prepend_item() argument
225 cil_list_remove(struct cil_list *list, enum cil_flavor flavor, void *data, unsigned destroy_data) cil_list_remove() argument
251 cil_list_contains(struct cil_list *list, void *data) cil_list_contains() argument
[all...]
/third_party/libinput/src/
H A Dutil-list.c32 #include "util-list.h"
35 list_init(struct list *list) in list_init() argument
37 list->prev = list; in list_init()
38 list->next = list; in list_init()
42 list_insert(struct list *list, struct list *el argument
56 list_append(struct list *list, struct list *elm) list_append() argument
82 list_empty(const struct list *list) list_empty() argument
[all...]
/third_party/skia/tests/
H A DLListTest.cpp25 static void check_list(const SkTInternalLList<ListElement>& list, in check_list() argument
32 REPORTER_ASSERT(reporter, empty == list.isEmpty()); in check_list()
34 list.validate(); in check_list()
35 REPORTER_ASSERT(reporter, numElements == list.countEntries()); in check_list()
36 REPORTER_ASSERT(reporter, in0 == list.isInList(&elements[0])); in check_list()
37 REPORTER_ASSERT(reporter, in1 == list.isInList(&elements[1])); in check_list()
38 REPORTER_ASSERT(reporter, in2 == list.isInList(&elements[2])); in check_list()
39 REPORTER_ASSERT(reporter, in3 == list.isInList(&elements[3])); in check_list()
44 SkTInternalLList<ListElement> list; in DEF_TEST() local
52 // list shoul in DEF_TEST()
[all...]
/third_party/protobuf/java/core/src/main/java/com/google/protobuf/
H A DListFieldSchema.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
39 * Utility class that aids in properly manipulating list fields for either the lite or full runtime.
75 List<?> list = (List<?>) UnsafeUtil.getObject(message, offset); in makeImmutableListAt()
77 if (list instanceof LazyStringList) { in makeImmutableListAt()
78 immutable = ((LazyStringList) list).getUnmodifiableView(); in makeImmutableListAt()
79 } else if (UNMODIFIABLE_LIST_CLASS.isAssignableFrom(list.getClass())) { in makeImmutableListAt()
82 } else if (list instanceof PrimitiveNonBoxingCollection && list instanceof ProtobufList) { in makeImmutableListAt()
83 if (((ProtobufList<?>) list) in makeImmutableListAt()
[all...]

Completed in 11 milliseconds

12345678910>>...134