HomeSort by relevance Sort by last modified time
    Searched refs:list (Results 201 - 225 of 3653) sorted by null

1 2 3 4 5 6 7 891011>>

  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/
stl_list.h 0 // List implementation -*- C++ -*-
70 /// Common part of a node in the %list.
93 /// An actual node in the %list.
108 * @brief A list::iterator.
178 // The only member points to the %list element.
183 * @brief A list::const_iterator.
258 // The only member points to the %list element.
358 // This is what actually destroys the list.
385 * This is a @e doubly @e linked %list. Traversal up and down the
386 * %list requires linear time, but adding and removing elements (o
417 class list : protected _List_base<_Tp, _Alloc> class in inherits:_List_base
499 list() function in class:list
507 list(const allocator_type& __a) function in class:list
519 list(size_type __n, const value_type& __value = value_type(), function in class:list
531 list(const list& __x) function in class:list
543 list(list&& __x) function in class:list
554 list(initializer_list<value_type> __l, function in class:list
571 list(_InputIterator __first, _InputIterator __last, function in class:list
    [all...]
  /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_list.h 0 // List implementation -*- C++ -*-
70 /// Common part of a node in the %list.
93 /// An actual node in the %list.
108 * @brief A list::iterator.
178 // The only member points to the %list element.
183 * @brief A list::const_iterator.
258 // The only member points to the %list element.
358 // This is what actually destroys the list.
385 * This is a @e doubly @e linked %list. Traversal up and down the
386 * %list requires linear time, but adding and removing elements (o
417 class list : protected _List_base<_Tp, _Alloc> class in inherits:_List_base
499 list() function in class:list
507 list(const allocator_type& __a) function in class:list
519 list(size_type __n, const value_type& __value = value_type(), function in class:list
531 list(const list& __x) function in class:list
543 list(list&& __x) function in class:list
554 list(initializer_list<value_type> __l, function in class:list
571 list(_InputIterator __first, _InputIterator __last, function in class:list
    [all...]
  /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_list.h 0 // List implementation -*- C++ -*-
70 /// Common part of a node in the %list.
93 /// An actual node in the %list.
108 * @brief A list::iterator.
178 // The only member points to the %list element.
183 * @brief A list::const_iterator.
258 // The only member points to the %list element.
358 // This is what actually destroys the list.
385 * This is a @e doubly @e linked %list. Traversal up and down the
386 * %list requires linear time, but adding and removing elements (o
417 class list : protected _List_base<_Tp, _Alloc> class in inherits:_List_base
499 list() function in class:list
507 list(const allocator_type& __a) function in class:list
519 list(size_type __n, const value_type& __value = value_type(), function in class:list
531 list(const list& __x) function in class:list
543 list(list&& __x) function in class:list
554 list(initializer_list<value_type> __l, function in class:list
571 list(_InputIterator __first, _InputIterator __last, function in class:list
    [all...]
  /external/stlport/test/unit/
list_test.cpp 5 #include <list>
60 list<int> l1(array1, array1 + 3);
61 list<int> l2(array2, array2 + 2);
62 list<int>::iterator i1 = l1.begin();
63 list<int>::iterator i2 = l2.begin();
64 list<int>::const_iterator ci(i1);
65 list<int>::const_iterator ci1(ci);
80 list<int> l(2);
88 list<char>::iterator l_char_ite;
89 list<int>::iterator l_int_ite
    [all...]
  /ndk/tests/device/test-gnustl-full/unit/
list_test.cpp 5 #include <list>
60 list<int> l1(array1, array1 + 3);
61 list<int> l2(array2, array2 + 2);
62 list<int>::iterator i1 = l1.begin();
63 list<int>::iterator i2 = l2.begin();
64 list<int>::const_iterator ci(i1);
65 list<int>::const_iterator ci1(ci);
80 list<int> l(2);
88 list<char>::iterator l_char_ite;
89 list<int>::iterator l_int_ite
    [all...]
  /ndk/tests/device/test-stlport/unit/
list_test.cpp 5 #include <list>
60 list<int> l1(array1, array1 + 3);
61 list<int> l2(array2, array2 + 2);
62 list<int>::iterator i1 = l1.begin();
63 list<int>::iterator i2 = l2.begin();
64 list<int>::const_iterator ci(i1);
65 list<int>::const_iterator ci1(ci);
80 list<int> l(2);
88 list<char>::iterator l_char_ite;
89 list<int>::iterator l_int_ite
    [all...]
  /external/e2fsprogs/resize/
extent.c 27 struct ext2_extent_entry *list; member in struct:_ext2_extent
53 extent->size, &extent->list);
58 memset(extent->list, 0,
69 if (extent->list)
70 ext2fs_free_mem(&extent->list);
71 extent->list = 0;
92 newsize, &extent->list);
98 ent = extent->list + curr;
149 qsort(extent->list, extent->num,
163 lowval = extent->list[low].old_loc
    [all...]
  /external/proguard/src/proguard/gui/
ListPanel.java 25 import java.util.List;
33 * list and between lists. Extensions of this class should add buttons to add
34 * and possibly edit entries, and to set and get the resulting list.
41 protected final JList list = new JList(listModel); field in class:ListPanel
61 list.addListSelectionListener(new ListSelectionListener()
69 add(new JScrollPane(list), listConstraints);
90 removeElementsAt(list.getSelectedIndices());
105 int[] selectedIndices = list.getSelectedIndices();
126 int[] selectedIndices = list.getSelectedIndices();
156 int[] selectedIndices = list.getSelectedIndices()
188 List list = new ArrayList(getComponentCount()-1); local
    [all...]
  /external/bluetooth/bluez/audio/
gstavdtpsink.c 501 GValue *list; local
511 list = g_value_init(g_new0(GValue, 1), GST_TYPE_LIST);
514 gst_value_list_prepend_value(list, value);
518 gst_value_list_prepend_value(list, value);
522 gst_value_list_prepend_value(list, value);
526 gst_value_list_prepend_value(list, value);
529 if (list) {
530 gst_structure_set_value(structure, "mode", list);
531 g_free(list);
532 list = NULL
670 GValue *list; local
794 GValue *list; local
960 GValue *list; local
    [all...]
  /bionic/libc/bionic/
libc_init_static.c 9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in
52 static void call_array(void(**list)())
54 // First element is -1, list is null-terminated
55 while (*++list) {
56 (*list)();
  /cts/tests/src/android/widget/cts/
AdapterViewStubActivity.java 20 import java.util.List;
53 final List<String> list = new ArrayList<String>(); local
55 list.add("test:" + i);
57 return new ArrayAdapter<String>(this, R.layout.adapterview_layout, list);
  /external/bluetooth/bluez/src/
plugin.c 125 GSList *list; local
212 for (list = plugins; list; list = list->next) {
213 struct bluetooth_plugin *plugin = list->data;
232 GSList *list; local
236 for (list = plugins; list; list = list->next)
    [all...]
  /external/chromium/chrome/browser/extensions/
user_script_listener.h 9 #include <list>
50 typedef std::list<URLPattern> URLPatterns;
57 // Appends new url patterns to our list, also setting user_scripts_ready_
61 // Replaces our url pattern list. This is only used when patterns have been
70 // A list of every request that we delayed. Will be flushed when user scripts
72 typedef std::list<GlobalRequestID> DelayedRequests;
82 // A list of URL patterns that have will have user scripts applied to them.
87 // Helper to collect the extension's user script URL patterns in a list and
  /external/e2fsprogs/lib/et/
com_err.h 52 extern const char *com_right(struct et_list *list, long code);
53 extern const char *com_right_r(struct et_list *list, long code, char *str, size_t len);
54 extern void initialize_error_table_r(struct et_list **list,
  /external/nist-sip/java/gov/nist/javax/sip/parser/
ErrorInfoParser.java 69 ErrorInfoList list = new ErrorInfoList(); local
88 list.add(errorInfo);
96 return list;
  /external/skia/src/animator/
SkDisplayList.cpp 61 int SkDisplayList::findGroup(SkDrawable* match, SkTDDrawableArray** list,
64 *list = &fDrawList;
66 return SearchForMatch(match, list, parent, found, grandList);
79 int SkDisplayList::SearchForMatch(SkDrawable* match, SkTDDrawableArray** list,
82 for (int index = 0; index < (*list)->count(); index++) {
83 SkDrawable* draw = (**list)[index];
90 if (apply->scope->isGroup() && SearchGroupForMatch(apply->scope, match, list, parent, found, grandList, index))
101 if (draw->isGroup() && SearchGroupForMatch(draw, match, list, parent, found, grandList, index))
108 bool SkDisplayList::SearchGroupForMatch(SkDrawable* draw, SkDrawable* match, SkTDDrawableArray** list,
113 SkTDDrawableArray* saveList = *list;
    [all...]
  /external/v8/tools/
utils.py 7 # notice, this list of conditions and the following disclaimer.
9 # copyright notice, this list of conditions and the following
33 # Reads a .list file into an array of strings
35 list = []
42 list.append(line)
43 return list
  /external/webkit/Source/WebCore/bindings/js/
JSScriptProfileNodeCustom.cpp 9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in the
54 MarkedArgumentBuffer list; local
58 list.append(toJS(exec, iter->get()));
60 return constructArray(exec, list);
JSStyleSheetListCustom.cpp 8 * notice, this list of conditions and the following disclaimer.
10 * notice, this list of conditions and the following disclaimer in the
42 StyleSheetList* list = impl(); local
45 unsigned length = list->length();
47 markDOMObjectWrapper(markStack, globalData, list->item(i));
  /external/webrtc/src/system_wrappers/source/
list_stl.h 14 #include <list>
31 mutable std::list<ListItem*>::iterator this_iter_;
61 mutable std::list<ListItem*> list_;
  /external/bluetooth/glib/gio/
gfileattribute.c 40 * File attributes in GIO consist of a list of key-value pairs.
48 * Values are stored within the list in #GFileAttributeValue structures.
53 * The list of possible attributes for a filesystem (pointed to by a #GFile) is
54 * availible as a #GFileAttributeInfoList. This list is queryable by key names
76 * namespace is used by file managers and applications that list directories
827 * Creates a new file attribute info list.
848 * @list: a #GFileAttributeInfoList to duplicate.
850 * Makes a duplicate of a file attribute info list.
852 * Returns: a copy of the given @list.
855 g_file_attribute_info_list_dup (GFileAttributeInfoList *list)
    [all...]
  /external/apache-harmony/security/src/test/support/common/java/org/apache/harmony/security/tests/support/cert/
MyCertificateFactorySpi.java 35 import java.util.List;
46 // mode: false - list of encodings is empty
47 // mode: true - list of encodings consists of 2 elements
51 private Set list; field in class:MyCertificateFactorySpi
56 list = new HashSet();
57 list.add("aa");
58 list.add("bb");
121 public CertPath engineGenerateCertPath(List certificates)
133 list.clear();
135 return list.iterator()
    [all...]
  /external/e2fsprogs/lib/ext2fs/
freefs.c 77 * This procedure frees a badblocks list.
84 if (bb->list)
85 ext2fs_free_mem(&bb->list);
86 bb->list = 0;
97 * Free a directory block list
104 if (dblist->list)
105 ext2fs_free_mem(&dblist->list);
106 dblist->list = 0;
  /external/freetype/src/base/
ftutil.c 5 /* FreeType utility file for memory and list management (body). */
241 FT_List_Find( FT_List list,
247 cur = list->head;
263 FT_List_Add( FT_List list,
266 FT_ListNode before = list->tail;
275 list->head = node;
277 list->tail = node;
284 FT_List_Insert( FT_List list,
287 FT_ListNode after = list->head;
294 list->tail = node
    [all...]
  /external/guava/src/com/google/common/collect/
Lists.java 32 import java.util.List;
43 * Static utility methods pertaining to {@link List} instances. Also see this
76 * @param elements the elements that the list should contain, in order
84 ArrayList<E> list = new ArrayList<E>(capacity); local
85 Collections.addAll(list, elements);
86 return list;
103 * @param elements the elements that the list should contain, in order
126 * @param elements the elements that the list should contain, in order
132 ArrayList<E> list = newArrayList(); local
134 list.add(elements.next())
210 LinkedList<E> list = newLinkedList(); local
    [all...]

Completed in 650 milliseconds

1 2 3 4 5 6 7 891011>>