/external/libcxx/test/std/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.op++/ |
H A D | pre.pass.cpp | 17 #include <list> 32 test(std::list<int>());
|
/external/libcxx/test/std/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.op=/ |
H A D | rv_value.pass.cpp | 20 #include <list> 35 test(std::list<std::unique_ptr<int> >());
|
/external/libcxx/test/std/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.op_astrk/ |
H A D | test.pass.cpp | 17 #include <list> 32 test(std::list<int>());
|
/external/libcxx/test/std/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.inserter/ |
H A D | test.pass.cpp | 17 #include <list> 33 test(std::list<int>());
|
/external/libvpx/libvpx/vp9/common/ |
H A D | vp9_frame_buffers.h | 32 // Initializes |list|. Returns 0 on success. 33 int vp9_alloc_internal_frame_buffers(InternalFrameBufferList *list); 36 void vp9_free_internal_frame_buffers(InternalFrameBufferList *list);
|
/external/ltp/tools/pounder21/ |
H A D | proclist.h | 1 /* Declarations to manage a list of processes. */ 37 void add_to_proclist(struct proclist_t *list, struct proclist_item_t *item); 38 void remove_from_proclist(struct proclist_t *list, struct proclist_item_t *item);
|
/external/pdfium/xfa/fde/css/ |
H A D | cfde_cssvaluelist.cpp | 14 std::vector<CFX_RetainPtr<CFDE_CSSValue>>& list) 15 : CFDE_CSSValue(FDE_CSSPrimitiveType::List), m_ppList(std::move(list)) {} 13 CFDE_CSSValueList( std::vector<CFX_RetainPtr<CFDE_CSSValue>>& list) argument
|
/external/slf4j/slf4j-migrator/src/main/java/org/slf4j/migrator/line/ |
H A D | EmptyRuleSet.java | 33 List<ConversionRule> list = new ArrayList<ConversionRule>(); field in class:EmptyRuleSet 36 return list.iterator();
|
/external/syslinux/core/include/ |
H A D | thread.h | 34 struct thread_list list; member in struct:thread_block 48 struct thread_list list; member in struct:thread 70 struct thread_list list; member in struct:semaphore 76 .list = { \ 77 .next = &sem.list, \ 78 .prev = &sem.list \ 89 * list of blocked processes on this semaphore! 97 sem->list.next = NULL; 105 return ((!!sem) && (!!sem->list.next));
|
/external/webrtc/webrtc/common_video/include/ |
H A D | i420_buffer_pool.h | 14 #include <list> 38 std::list<rtc::scoped_refptr<I420Buffer>> buffers_;
|
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | SortedListsTest.java | 37 void assertModelAgrees(List<Integer> list, Integer key, int answer, argument 41 if (list.contains(key)) { 42 assertEquals(list.indexOf(key), answer); 47 if (list.contains(key)) { 48 assertEquals(list.lastIndexOf(key), answer); 53 if (list.contains(key)) { 54 assertEquals(key, list.get(answer)); 59 if (list.contains(key)) { 60 assertEquals(list.lastIndexOf(key) + 1, answer); 65 if (list [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | SortedListsTest.java | 39 void assertModelAgrees(List<Integer> list, Integer key, int answer, argument 43 if (list.contains(key)) { 44 assertEquals(list.indexOf(key), answer); 49 if (list.contains(key)) { 50 assertEquals(list.lastIndexOf(key), answer); 55 if (list.contains(key)) { 56 assertEquals(key, list.get(answer)); 61 if (list.contains(key)) { 62 assertEquals(list.lastIndexOf(key) + 1, answer); 67 if (list [all...] |
/external/protobuf/java/core/src/main/java/com/google/protobuf/ |
H A D | UnmodifiableLazyStringList.java | 10 // notice, this list of conditions and the following disclaimer. 12 // copyright notice, this list of conditions and the following disclaimer 50 private final LazyStringList list; field in class:UnmodifiableLazyStringList 52 public UnmodifiableLazyStringList(LazyStringList list) { argument 53 this.list = list; 58 return list.get(index); 63 return list.getRaw(index); 68 return list.size(); 73 return list [all...] |
/external/selinux/restorecond/ |
H A D | stringslist.c | 33 void strings_list_add(struct stringsList **list, const char *string) argument 35 struct stringsList *ptr = *list; 41 break; /* Not on list break out to add */ 43 return; /* Already on list */ 55 *list = newptr; 111 struct stringsList *list = NULL; local 113 strings_list_add(&list, "/etc/resolv.conf"); 114 strings_list_add(&list, "/etc/walsh"); 115 strings_list_add(&list, "/etc/mtab"); 116 strings_list_add(&list, "/et [all...] |
/external/libcxx/test/std/containers/sequences/list/list.cons/ |
H A D | initializer_list_alloc.pass.cpp | 10 // <list> 12 // list(initializer_list<value_type> il, const Allocator& a = allocator_type()); 14 #include <list> 24 std::list<int, test_allocator<int>> d({3, 4, 5, 6}, test_allocator<int>(3)); 27 std::list<int, test_allocator<int>>::iterator i = d.begin(); 35 std::list<int, min_allocator<int>> d({3, 4, 5, 6}, min_allocator<int>()); 38 std::list<int, min_allocator<int>>::iterator i = d.begin();
|
H A D | default.pass.cpp | 10 // <list> 12 // explicit list(const Alloc& = Alloc()); 14 #include <list> 22 std::list<int> l; 27 std::list<DefaultOnly> l; 32 std::list<int> l((std::allocator<int>())); 38 std::list<int, min_allocator<int>> l; 43 std::list<DefaultOnly, min_allocator<DefaultOnly>> l; 48 std::list<int, min_allocator<int>> l((min_allocator<int>())); 53 std::list<in [all...] |
H A D | move.pass.cpp | 12 // <list> 14 // list(list&& c); 16 #include <list> 25 std::list<MoveOnly, test_allocator<MoveOnly> > l(test_allocator<MoveOnly>(5)); 26 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 32 std::list<MoveOnly, test_allocator<MoveOnly> > l2 = std::move(l); 38 std::list<MoveOnly, other_allocator<MoveOnly> > l(other_allocator<MoveOnly>(5)); 39 std::list<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5)); 45 std::list<MoveOnl [all...] |
/external/selinux/libsemanage/src/ |
H A D | utilities.h | 37 typedef struct list { struct 39 struct list *next; 87 /* linked list string functions 89 * either semanage_list_pop until list == NULL or semanage_list_destroy() 91 int semanage_list_push(semanage_list_t ** list, const char *data) WARN_UNUSED; 92 char *semanage_list_pop(semanage_list_t ** list); 93 void semanage_list_destroy(semanage_list_t ** list); 140 * @return a list of lines from the file (empty lines become
|
/external/snakeyaml/src/test/java/examples/ |
H A D | SafeConstructorExampleTest.java | 30 List<Object> list = (List<Object>) yaml.load(doc); 31 assertEquals(3, list.size()); 32 assertEquals(new Integer(5), list.get(0)); 33 assertEquals("Person", list.get(1)); 34 assertEquals(Boolean.TRUE, list.get(2));
|
/external/webrtc/talk/app/webrtc/ |
H A D | notifier.h | 9 * this list of conditions and the following disclaimer. 11 * this list of conditions and the following disclaimer in the documentation 31 #include <list> 51 for (std::list<ObserverInterface*>::iterator it = observers_.begin(); 61 // Copy the list of observers to avoid a crash if the observer object 62 // unregisters as a result of the OnChanged() call. If the same list is used 63 // UnregisterObserver will affect the list make the iterator invalid. 64 std::list<ObserverInterface*> observers = observers_; 65 for (std::list<ObserverInterface*>::iterator it = observers.begin(); 72 std::list<ObserverInterfac [all...] |
/external/freetype/src/base/ |
H A D | ftutil.c | 5 /* FreeType utility file for memory and list management (body). */ 242 FT_List_Find( FT_List list, 248 if ( !list ) 251 cur = list->head; 267 FT_List_Add( FT_List list, argument 273 if ( !list || !node ) 276 before = list->tail; 284 list->head = node; 286 list->tail = node; 293 FT_List_Insert( FT_List list, argument 319 FT_List_Remove( FT_List list, FT_ListNode node ) argument 346 FT_List_Up( FT_List list, FT_ListNode node ) argument 411 FT_List_Finalize( FT_List list, FT_List_Destructor destroy, FT_Memory memory, void* user ) argument [all...] |
/external/pdfium/third_party/freetype/src/base/ |
H A D | ftutil.c | 5 /* FreeType utility file for memory and list management (body). */ 242 FT_List_Find( FT_List list, 248 if ( !list ) 251 cur = list->head; 267 FT_List_Add( FT_List list, argument 273 if ( !list || !node ) 276 before = list->tail; 284 list->head = node; 286 list->tail = node; 293 FT_List_Insert( FT_List list, argument 319 FT_List_Remove( FT_List list, FT_ListNode node ) argument 346 FT_List_Up( FT_List list, FT_ListNode node ) argument 411 FT_List_Finalize( FT_List list, FT_List_Destructor destroy, FT_Memory memory, void* user ) argument [all...] |
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/representer/ |
H A D | SafeRepresenterTest.java | 46 List<Number> list = new ArrayList<Number>(); 47 list.add(new Byte((byte) 3)); 48 list.add(new Short((short) 4)); 49 list.add(new Integer(5)); 50 list.add(new BigInteger("6")); 51 list.add(new Long(7L)); 52 list.add(Double.POSITIVE_INFINITY); 53 list.add(Double.NEGATIVE_INFINITY); 54 list.add(Double.NaN); 56 String output = yaml.dump(list); [all...] |
/external/libcxx/test/std/containers/sequences/list/list.ops/ |
H A D | remove.pass.cpp | 10 // <list> 14 #include <list> 40 std::list<int> c(a1, a1 + 4); 42 assert(c == std::list<int>(a2, a2 + 3)); 47 std::list<int> c(a1, a1 + 7); 49 assert(c == std::list<int>(a2, a2 + 5)); 54 std::list<S> c; 58 std::list<S>::const_iterator it = c.begin(); 67 typedef std::list<int, Alloc> List; 78 std::list<in [all...] |
/external/e2fsprogs/lib/ext2fs/ |
H A D | finddev.c | 45 * This function adds an entry to the directory list 47 static void add_to_dirlist(const char *name, struct dir_list **list) argument 60 dp->next = *list; 61 *list = dp; 65 * This function frees a directory list 67 static void free_dirlist(struct dir_list **list) argument 71 for (dp = *list; dp; dp = next) { 76 *list = 0; 79 static int scan_dir(char *dirname, dev_t device, struct dir_list **list, argument 103 add_to_dirlist(path, list); 129 struct dir_list *list = 0, *new_list = 0; local [all...] |