| /frameworks/base/media/java/android/media/ |
| MediaInserter.java | 26 import java.util.List;
35 private final HashMap<Uri, List<ContentValues>> mRowMap =
36 new HashMap<Uri, List<ContentValues>>();
37 private final HashMap<Uri, List<ContentValues>> mPriorityRowMap =
38 new HashMap<Uri, List<ContentValues>>();
59 HashMap<Uri, List<ContentValues>> rowmap = priority ? mPriorityRowMap : mRowMap;
60 List<ContentValues> list = rowmap.get(tableUri); local
61 if (list == null) {
62 list = new ArrayList<ContentValues>()
75 List<ContentValues> list = mRowMap.get(tableUri); local
83 List<ContentValues> list = mPriorityRowMap.get(tableUri); local
[all...] |
| /frameworks/base/tools/layoutlib/bridge/src/android/os/ |
| HandlerThread_Delegate.java | 25 import java.util.List;
38 private static Map<BridgeContext, List<HandlerThread>> sThreads =
39 new HashMap<BridgeContext, List<HandlerThread>>();
42 List<HandlerThread> list = sThreads.get(context); local
43 if (list != null) {
44 for (HandlerThread thread : list) {
48 list.clear();
59 List<HandlerThread> list = sThreads.get(context) local
[all...] |
| /libcore/luni/src/main/java/java/util/prefs/ |
| NodeSet.java | 10 ArrayList<Node> list = new ArrayList<Node>(); field in class:NodeSet
14 list.add(nodes.next());
19 return list.size();
25 result = list.get(index);
|
| /libcore/luni/src/test/java/libcore/util/ |
| CollectionUtilsTest.java | 25 import java.util.List;
31 List<Reference<String>> refs = new ArrayList<Reference<String>>();
67 private <T> List<T> toList(Iterable<T> iterable) {
68 List<T> result = new ArrayList<T>();
76 List<String> list = new ArrayList<String>(); local
77 CollectionUtils.removeDuplicates(list, String.CASE_INSENSITIVE_ORDER);
78 assertTrue(list.isEmpty());
82 List<String> list = Arrays.asList("A") local
88 List<String> list = new ArrayList<String>(); local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/ |
| size_type.pass.cpp | 10 // <list>
12 // explicit list(size_type n);
14 #include <list>
23 std::list<int> l(3);
26 std::list<int>::const_iterator i = l.begin();
34 std::list<int, stack_allocator<int, 3> > l(3);
37 std::list<int>::const_iterator i = l.begin();
46 std::list<DefaultOnly> l(3);
53 std::list<int, min_allocator<int>> l(3);
56 std::list<int, min_allocator<int>>::const_iterator i = l.begin()
[all...] |
| size_value_alloc.pass.cpp | 10 // <list>
12 // list(size_type n, const T& value, const Allocator& = Allocator());
14 #include <list>
23 std::list<int> l(3, 2);
26 std::list<int>::const_iterator i = l.begin();
34 std::list<int> l(3, 2, std::allocator<int>());
37 std::list<int>::const_iterator i = l.begin();
45 std::list<int, stack_allocator<int, 3> > l(3, 2);
48 std::list<int>::const_iterator i = l.begin();
57 std::list<int, min_allocator<int>> l(3, 2)
[all...] |
| /packages/apps/Contacts/src/com/android/contacts/list/ |
| OnEmailAddressPickerActionListener.java | 16 package com.android.contacts.list;
|
| OnMultiplePhoneNumberPickerActionListener.java | 16 package com.android.contacts.list;
|
| OnPostalAddressPickerActionListener.java | 16 package com.android.contacts.list;
|
| /external/chromium_org/v8/src/ |
| small-pointer-list.h | 7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
38 // SmallPointerList is a list optimized for storing no or just a
41 // The interface tries to be as close to List from list.h as possible.
54 if (list()->capacity() >= capacity) return;
55 int old_length = list()->length();
56 list()->AddBlock(NULL, capacity - list()->capacity(), zone);
57 list()->Rewind(old_length)
60 PointerList* list = new(zone) PointerList(capacity, zone); local
93 PointerList* list = new(zone) PointerList(2, zone); local
186 PointerList* list() const { function in class:v8::internal::SmallPointerList
[all...] |
| /external/dropbear/libtomcrypt/src/pk/asn1/der/choice/ |
| der_decode_choice.c | 24 @param list The list of items to decode
25 @param outlen The number of items in the list
29 ltc_asn1_list *list, unsigned long outlen)
36 LTC_ARGCHK(list != NULL);
45 list[x].used = 0;
50 size = list[x].size;
51 data = list[x].data;
53 switch (list[x].type) {
57 list[x].used = 1
[all...] |
| /external/eigen/Eigen/src/StlSupport/ |
| StdList.h | 17 #define EIGEN_EXPLICIT_STL_LIST_INSTANTIATION(...) template class std::list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> >;
24 * std::list such that for data types with alignment issues the correct allocator
32 class list<__VA_ARGS__, _Ay> \
33 : public list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > \
35 typedef list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > list_base; \
41 explicit list(const allocator_type& a = allocator_type()) : list_base(a) {} \
43 list(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : list_base(first, last, a) {} \
44 list(const list& c) : list_base(c) {} \
45 explicit list(size_type num, const value_type& val = value_type()) : list_base(num, val) {}
80 class list<T,EIGEN_ALIGNED_ALLOCATOR<T> > class in namespace:std
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/light/ |
| LightList.java | 10 * notice, this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
49 private Light[] list, tlist; field in class:LightList
83 list = new Light[DEFAULT_SIZE];
98 Light[] temp = new Light[list.length * 2];
99 float[] temp2 = new float[list.length * 2];
100 System.arraycopy(list, 0, temp, 0, list.length);
101 System.arraycopy(distToOwner, 0, temp2, 0, list.length);
102 list = temp
[all...] |
| /external/chromium_org/net/dns/ |
| address_sorter_win.cc | 33 virtual void Sort(const AddressList& list,
35 DCHECK(!list.empty());
36 scoped_refptr<Job> job = new Job(list, callback);
44 Job(const AddressList& list, const CallbackType& callback)
47 list.size() * (sizeof(SOCKET_ADDRESS) +
54 input_buffer_->iAddressCount = list.size();
58 for (size_t i = 0; i < list.size(); ++i) {
59 IPEndPoint ipe = list[i];
107 AddressList list; local
109 list.reserve(output_buffer_->iAddressCount)
147 AddressList list; local
[all...] |
| /external/v8/src/ |
| small-pointer-list.h | 7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
38 // SmallPointerList is a list optimized for storing no or just a
41 // The interface tries to be as close to List from list.h as possible.
54 if (list()->capacity() >= capacity) return;
55 int old_length = list()->length();
56 list()->AddBlock(NULL, capacity - list()->capacity());
57 list()->Rewind(old_length)
60 PointerList* list = new PointerList(capacity); local
87 PointerList* list = new PointerList(2); local
176 PointerList* list() const { function in class:v8::internal::SmallPointerList
[all...] |
| /sdk/emulator/opengl/host/libs/Translator/GLcommon/ |
| RangeManip.cpp | 44 list.push_back(r);
49 addRange(rl.list[i]);
55 delRange(rl.list[i],deleted);
60 return list.empty();
64 return list.size();
67 return list.clear();
71 if(i > list.size()) return;
72 list.erase(list.begin() +i);
80 // compare new rect to each and any of the rects on the list
[all...] |
| /external/chromium_org/chrome/browser/resources/options/ |
| search_engine_manager.css | 9 .search-engine-list input {
14 .search-engine-list > div {
18 .search-engine-list .favicon {
28 .search-engine-list .name-column {
36 .search-engine-list .name-column :last-child {
40 .search-engine-list .keyword-column {
46 .search-engine-list .url-column {
51 .search-engine-list .keyword-column,
52 .search-engine-list .url-column {
56 .search-engine-list .default .name-column
[all...] |
| /external/proguard/src/proguard/util/ |
| ListUtil.java | 28 * <code>java.util.List</code> objects.
35 * Creates a comma-separated String from the given List of String objects.
37 public static String commaSeparatedString(List list)
39 if (list == null)
46 for (int index = 0; index < list.size(); index++)
53 buffer.append(quotedString((String)list.get(index)));
61 * Creates a List of String objects from the given comma-separated String.
63 public static List commaSeparatedList(String string)
70 List list = new ArrayList() local
150 List list = commaSeparatedList(args[0]); local
160 List list = Arrays.asList(args); local
[all...] |
| /external/qemu/ |
| qemu-option.h | 62 * The following functions take a parameter list as input. This is a pointer to
67 QEMUOptionParameter *get_option_parameter(QEMUOptionParameter *list,
69 int set_option_parameter(QEMUOptionParameter *list, const char *name,
71 int set_option_parameter_int(QEMUOptionParameter *list, const char *name,
74 QEMUOptionParameter *list);
76 QEMUOptionParameter *list, QEMUOptionParameter *dest);
77 void free_option_parameters(QEMUOptionParameter *list);
78 void print_option_parameters(QEMUOptionParameter *list);
79 void print_option_help(QEMUOptionParameter *list);
116 QemuOpts *qemu_opts_find(QemuOptsList *list, const char *id)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| insert_iter_size_value.pass.cpp | 10 // <list>
18 #include <list>
47 std::list<int> l1(a1, a1+3);
48 std::list<int>::iterator i = l1.insert(next(l1.cbegin()), 5, 4);
50 assert(l1 == std::list<int>(a2, a2+8));
63 assert(l1 == std::list<int>(a2, a2+8));
67 std::list<int> c1(100);
68 std::list<int> c2;
69 std::list<int>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1);
77 std::list<int, min_allocator<int>> l1(a1, a1+3)
[all...] |
| /external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cms/ |
| SignerInformationStore.java | 7 import java.util.List;
12 private List all = new ArrayList();
25 List list = (ArrayList)table.get(sid); local
26 if (list == null)
28 list = new ArrayList(1);
29 table.put(sid, list);
32 list.add(signer);
48 Collection list = getSigners(selector); local
50 return list.size() == 0 ? null : (SignerInformation) list.iterator().next()
104 List list = (ArrayList)table.get(selector); local
[all...] |
| /external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/ |
| pthread_mutex_consistent.c | 15 * The current list of contributors is contained
17 * code distribution. The list can also be seen at the
106 * Any mutex currently in the thread's robust mutex list is held
118 ptw32_robust_node_t** list; local
123 list = &tp->robustMxList;
125 if (NULL == *list)
129 *list = robust;
134 robust->next = *list;
135 (*list)->prev = robust;
136 *list = robust
144 ptw32_robust_node_t** list; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.capacity/ |
| resize_size.pass.cpp | 10 // <list>
14 #include <list>
22 std::list<int> l(5, 2);
26 assert(l == std::list<int>(2, 2));
29 std::list<int> l(5, 2);
38 std::list<DefaultOnly> l(10);
44 std::list<DefaultOnly> l(10);
52 std::list<int, min_allocator<int>> l(5, 2);
56 assert((l == std::list<int, min_allocator<int>>(2, 2)));
59 std::list<int, min_allocator<int>> l(5, 2)
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| ipa-ref-inline.h | 57 /* Return reference list REF is in. */
68 /* Return reference list REF is in. */
79 /* Return first reference in LIST or NULL if empty. */
82 ipa_ref_list_first_reference (struct ipa_ref_list *list)
84 if (!VEC_length (ipa_ref_t, list->references))
86 return VEC_index (ipa_ref_t, list->references, 0);
89 /* Return first refering ref in LIST or NULL if empty. */
92 ipa_ref_list_first_refering (struct ipa_ref_list *list)
94 if (!VEC_length (ipa_ref_ptr, list->refering))
96 return VEC_index (ipa_ref_ptr, list->refering, 0)
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| ipa-ref-inline.h | 57 /* Return reference list REF is in. */
68 /* Return reference list REF is in. */
79 /* Return first reference in LIST or NULL if empty. */
82 ipa_ref_list_first_reference (struct ipa_ref_list *list)
84 if (!VEC_length (ipa_ref_t, list->references))
86 return VEC_index (ipa_ref_t, list->references, 0);
89 /* Return first refering ref in LIST or NULL if empty. */
92 ipa_ref_list_first_refering (struct ipa_ref_list *list)
94 if (!VEC_length (ipa_ref_ptr, list->refering))
96 return VEC_index (ipa_ref_ptr, list->refering, 0)
[all...] |
