HomeSort by relevance Sort by last modified time
    Searched refs:list (Results 126 - 150 of 13720) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/strace/
xlate.el 8 ;; notice, this list of conditions and the following disclaimer.
10 ;; notice, this list of conditions and the following disclaimer in the
35 (defvar xlate-list nil
39 "Grab all of the defined names in the region and save them in xlate-list."
42 (setq xlate-list nil)
47 (setq xlate-list (cons (buffer-substring (match-beginning 1)
49 xlate-list)))
53 (setq xlate-list (nreverse xlate-list)))
55 (defun build-xlate (&optional list)
    [all...]
  /frameworks/compile/slang/
slang_pragma_list.h 20 #include <list>
26 typedef std::list< std::pair<std::string, std::string> > PragmaList;
  /hardware/intel/common/wrs_omxil_core/utils/inc/
queue.h 22 #include "list.h"
29 struct list *head;
30 struct list *tail;
41 void __queue_push_head(struct queue *queue, struct list *entry);
43 void __queue_push_tail(struct queue *queue, struct list *entry);
46 struct list *__queue_pop_head(struct queue *queue);
48 struct list *__queue_pop_tail(struct queue *queue);
51 inline struct list *__queue_peek_head(struct queue *queue);
52 inline struct list *__queue_peek_tail(struct queue *queue);
  /hardware/qcom/gps/msm8909w_3100/core/observer/
IDataItemObserver.h 7 * notice, this list of conditions and the following disclaimer.
9 * copyright notice, this list of conditions and the following
33 #include <list>
63 * @param dlist List of updated data items
65 virtual void notify (const std :: list <IDataItemCore *> & dlist) = 0;
  /packages/providers/ContactsProvider/tests/src/com/android/providers/contacts/sqlite/
DatabaseAnalyzerTest.java 24 import java.util.List;
32 final List<String> list = DatabaseAnalyzer.findTableViewsAllowingColumns( local
35 assertTrue(list.contains("contacts"));
36 assertTrue(list.contains("raw_contacts"));
37 assertTrue(list.contains("view_contacts"));
38 assertTrue(list.contains("view_raw_contacts"));
39 assertTrue(list.contains("view_data"));
41 assertFalse(list.contains("data"));
42 assertFalse(list.contains("_id"))
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.cons/
container.pass.cpp 17 #include <list>
29 test(std::list<int>());
  /toolchain/binutils/binutils-2.27/gas/testsuite/gas/mmix/
list-pseudoints.l 1 GAS for MMIX .*/list-pseudoints.s page 1
13 GAS for MMIX .*/list-pseudoints.s page 2
17 .*/list-pseudoints.s:1 .text:0000000000000000 start
18 .*/list-pseudoints.s:3 .text:0000000000000004 start2
list-textfirst.l 1 GAS for MMIX .*/list-textfirst\.s page 1
11 GAS for MMIX .*/list-textfirst\.s page 2
15 .*/list-textfirst\.s:2 \.data:0000000000000000 here
16 .*/list-textfirst\.s:5 \.text:0000000000000000 there
  /external/tensorflow/tensorflow/tools/ci_build/install/
install_pi_python3_toolchain.sh 18 echo 'deb [arch=armhf] http://ports.ubuntu.com/ trusty main restricted universe multiverse' >> /etc/apt/sources.list.d/armhf.list
19 echo 'deb [arch=armhf] http://ports.ubuntu.com/ trusty-updates main restricted universe multiverse' >> /etc/apt/sources.list.d/armhf.list
20 echo 'deb [arch=armhf] http://ports.ubuntu.com/ trusty-security main restricted universe multiverse' >> /etc/apt/sources.list.d/armhf.list
21 echo 'deb [arch=armhf] http://ports.ubuntu.com/ trusty-backports main restricted universe multiverse' >> /etc/apt/sources.list.d/armhf.list
22 sed -i 's#deb http://archive.ubuntu.com/ubuntu/#deb [arch=amd64] http://archive.ubuntu.com/ubuntu/#g' /etc/apt/sources.list
25 echo "deb [arch=amd64] http://storage.googleapis.com/bazel-apt stable jdk1.8" | sudo tee /etc/apt/sources.list.d/bazel.lis
    [all...]
install_pi_toolchain.sh 18 echo 'deb [arch=armhf] http://ports.ubuntu.com/ trusty main restricted universe multiverse' >> /etc/apt/sources.list.d/armhf.list
19 echo 'deb [arch=armhf] http://ports.ubuntu.com/ trusty-updates main restricted universe multiverse' >> /etc/apt/sources.list.d/armhf.list
20 echo 'deb [arch=armhf] http://ports.ubuntu.com/ trusty-security main restricted universe multiverse' >> /etc/apt/sources.list.d/armhf.list
21 echo 'deb [arch=armhf] http://ports.ubuntu.com/ trusty-backports main restricted universe multiverse' >> /etc/apt/sources.list.d/armhf.list
22 sed -i 's#deb http://archive.ubuntu.com/ubuntu/#deb [arch=amd64] http://archive.ubuntu.com/ubuntu/#g' /etc/apt/sources.list
25 echo "deb [arch=amd64] http://storage.googleapis.com/bazel-apt stable jdk1.8" | sudo tee /etc/apt/sources.list.d/bazel.lis
    [all...]
  /dalvik/dx/tests/126-main-dex-list-one-dex/
run 18 dx -JXmx1024m --dex --no-optimize --multi-dex --main-dex-list=main.list --output=out classes
  /external/google-breakpad/src/client/mac/handler/
breakpad_nlist_64.h 8 // notice, this list of conditions and the following disclaimer.
10 // copyright notice, this list of conditions and the following disclaimer
39 struct nlist *list,
43 struct nlist_64 *list,
  /external/libcxx/test/libcxx/containers/sequences/list/list.cons/
db_copy.pass.cpp 10 // <list>
14 // list(list&& c);
19 #include <list>
25 std::list<int> l1;
27 std::list<int>::iterator i = l1.begin();
28 std::list<int> l2 = l1;
  /external/libcxx/test/libcxx/containers/sequences/list/list.modifiers/
erase_iter_iter_db1.pass.cpp 13 // <list>
20 #include <list>
27 std::list<int> l1(a1, a1+3);
28 std::list<int> l2(a1, a1+3);
29 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
erase_iter_iter_db2.pass.cpp 13 // <list>
20 #include <list>
27 std::list<int> l1(a1, a1+3);
28 std::list<int> l2(a1, a1+3);
29 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
erase_iter_iter_db3.pass.cpp 13 // <list>
20 #include <list>
27 std::list<int> l1(a1, a1+3);
28 std::list<int> l2(a1, a1+3);
29 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
insert_iter_iter_iter_db1.pass.cpp 13 // <list>
22 #include <list>
30 std::list<int> v(100);
31 std::list<int> v2(100);
34 std::list<int>::iterator i = v.insert(next(v2.cbegin(), 10),
pop_back_db1.pass.cpp 13 // <list>
20 #include <list>
27 std::list<int> c(a, a+3);
29 assert(c == std::list<int>(a, a+2));
31 assert(c == std::list<int>(a, a+1));
  /external/libcxx/test/libcxx/experimental/memory/memory.resource.aliases/
header_list_libcpp_version.pass.cpp 12 // <experimental/list>
14 #include <experimental/list>
  /external/selinux/libsepol/cil/src/
cil_list.c 8 * 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)
53 *list = new_list;
56 void cil_list_destroy(struct cil_list **list, unsigned destroy_data)
58 if (*list == NULL) {
62 struct cil_list_item *item = (*list)->head;
75 free(*list);
76 *list = NULL;
98 void cil_list_append(struct cil_list *list, enum cil_flavor flavor, void *data
    [all...]
  /external/syslinux/core/thread/
exit_thread.c 13 /* Remove from the linked list */
14 curr->list.prev->next = curr->list.next;
15 curr->list.next->prev = curr->list.prev;
23 * curr isn't part of the linked list anymore, as long as
24 * curr->list.next is still valid.
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/libcxx/containers/sequences/list/list.cons/
db_copy.pass.cpp 10 // <list>
14 // list(list&& c);
19 #include <list>
25 std::list<int> l1;
27 std::list<int>::iterator i = l1.begin();
28 std::list<int> l2 = l1;
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/libcxx/containers/sequences/list/list.modifiers/
erase_iter_iter_db1.pass.cpp 13 // <list>
20 #include <list>
27 std::list<int> l1(a1, a1+3);
28 std::list<int> l2(a1, a1+3);
29 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
erase_iter_iter_db2.pass.cpp 13 // <list>
20 #include <list>
27 std::list<int> l1(a1, a1+3);
28 std::list<int> l2(a1, a1+3);
29 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
erase_iter_iter_db3.pass.cpp 13 // <list>
20 #include <list>
27 std::list<int> l1(a1, a1+3);
28 std::list<int> l2(a1, a1+3);
29 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));

Completed in 684 milliseconds

1 2 3 4 56 7 8 91011>>