| /packages/apps/Contacts/src/com/android/contacts/list/ |
| OnContactsUnavailableActionListener.java | 16 package com.android.contacts.list;
|
| /external/chromium/chrome/browser/sync/ |
| js_arg_list_unittest.cc | 21 scoped_ptr<ListValue> list(new ListValue());
22 list->Append(Value::CreateBooleanValue(false));
23 list->Append(Value::CreateIntegerValue(5));
25 list->Append(dict);
29 JsArgList arg_list(*list);
32 scoped_ptr<ListValue> list_copy(list->DeepCopy());
33 list.reset();
51 ListValue list; local
52 list.Append(bool_value.DeepCopy());
53 list.Append(int_value.DeepCopy())
[all...] |
| /external/chromium_org/chrome/browser/resources/memory_internals/ |
| list.css | 5 table.list {
10 table.list tr:nth-child(odd) td {
14 table.list td {
19 table.list .header th {
24 table.list .bottom th,
25 table.list th.bottom {
|
| /external/mockito/src/org/mockito/internal/util/collections/ |
| IdentitySet.java | 12 LinkedList list = new LinkedList();
field in class:IdentitySet
15 for(Object existing:list) {
24 list.add(o);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| clear.pass.cpp | 10 // <list>
14 #include <list>
23 std::list<int> c(a, a+3);
30 std::list<int, min_allocator<int>> c(a, a+3);
|
| erase_iter_db1.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int>::const_iterator i = l1.end();
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>>::const_iterator i = l1.end();
|
| erase_iter_iter_db4.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
36 std::list<int, min_allocator<int>> l1(a1, a1+3);
37 std::list<int, min_allocator<int>>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| AbstractSequentialListTest.java | 73 AbstractSequentialList list = new MyAbstractSequentialList(); local
74 list.add(1);
75 list.add("value");
76 assertEquals(1, list.get(0));
77 assertEquals("value", list.get(1));
81 list.get(list.size());
87 list.get(-1);
99 AbstractSequentialList list = new MyAbstractSequentialList(); local
100 list.add(1)
133 MyAbstractSequentialList list = new MyAbstractSequentialList(); local
144 private LinkedList list = new LinkedList(); field in class:AbstractSequentialListTest.MyAbstractSequentialList
[all...] |
| /external/e2fsprogs/e2fsck/ |
| profile_helpers.c | 8 * list of sections or relations, or accessing multiple values from a
31 * internal functions used to build up a null-terminated char ** list
35 * purposes to build up the list, which is returned in *ret_list by
38 * The publicly exported interface for freeing char** list is
43 char **list; member in struct:profile_string_list
49 * Initialize the string list abstraction.
51 static errcode_t init_list(struct profile_string_list *list)
53 list->num = 0;
54 list->max = 10;
55 list->list = malloc(list->max * sizeof(char *))
[all...] |
| /external/chromium_org/chrome/browser/resources/options/ |
| password_manager_list.css | 5 #saved-passwords-list .list-inline-button {
15 html[dir='ltr'] #saved-passwords-list .list-inline-button {
19 html[dir='rtl'] #saved-passwords-list .list-inline-button {
28 #saved-passwords-list .url {
33 #saved-passwords-list .name {
38 #saved-passwords-list .password {
43 #saved-passwords-list .password input[type='password']
[all...] |
| /external/chromium_org/net/base/ |
| address_list.cc | 20 base::ListValue* list = new base::ListValue(); local
24 list->Append(new base::StringValue(it->ToString()));
27 dict->Set("address_list", list);
51 AddressList list; local
52 list.set_canonical_name(canonical_name);
55 list.push_back(IPEndPoint(*iter, 0));
57 return list;
63 AddressList list; local
65 list.set_canonical_name(std::string(head->ai_canonname));
70 list.push_back(ipe)
[all...] |
| /external/chromium_org/chrome/browser/resources/file_manager/foreground/css/ |
| list.css | 5 /* Derived from /ui/webui/resources/css/list.css. */
7 list,
13 list. */
16 list > *,
24 list > * {
32 list:focus > [lead],
37 list:not([disabled]) > :hover,
42 list > [selected],
47 list > .spacer,
55 list :-webkit-any
[all...] |
| /external/chromium_org/sync/notifier/ |
| single_object_invalidation_set_unittest.cc | 62 SingleObjectInvalidationSet list; local
63 EXPECT_FALSE(list.StartsWithUnknownVersion());
65 list.Insert(Invalidation::Init(kId, 1, "one"));
66 EXPECT_FALSE(list.StartsWithUnknownVersion());
68 list.Insert(Invalidation::InitUnknownVersion(kId));
69 EXPECT_TRUE(list.StartsWithUnknownVersion());
71 list.Clear();
72 EXPECT_FALSE(list.StartsWithUnknownVersion());
76 SingleObjectInvalidationSet list; local
78 scoped_ptr<base::ListValue> value = list.ToValue()
86 SingleObjectInvalidationSet list; local
97 SingleObjectInvalidationSet list; local
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| ulist.c | 33 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) {
64 list->head = newItem;
65 list->tail = newItem;
66 list->currentIndex = 0;
69 U_CAPI void U_EXPORT2 ulist_addItemEndList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) {
72 if (U_FAILURE(*status) || list == NULL || data == NULL) {
84 if (list->size == 0) {
85 ulist_addFirstItem(list, newItem)
[all...] |
| /external/icu4c/common/ |
| ulist.c | 33 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) {
64 list->head = newItem;
65 list->tail = newItem;
66 list->currentIndex = 0;
69 U_CAPI void U_EXPORT2 ulist_addItemEndList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) {
72 if (U_FAILURE(*status) || list == NULL || data == NULL) {
84 if (list->size == 0) {
85 ulist_addFirstItem(list, newItem)
[all...] |
| /external/ipsec-tools/src/racoon/ |
| rsalist.h | 13 * notice, this list of conditions and the following disclaimer.
15 * notice, this list of conditions and the following disclaimer in the
55 int rsa_key_insert(struct genlist *list, struct netaddr *src, struct netaddr *dst, RSA *rsa);
56 void rsa_key_dump(struct genlist *list);
59 RSA *rsa_try_check_rsasign(vchar_t *source, vchar_t *sig, struct genlist *list);
61 unsigned long rsa_list_count(struct genlist *list);
63 int rsa_parse_file(struct genlist *list, const char *fname, enum rsa_key_type type);
|
| /libcore/luni/src/main/java/libcore/io/ |
| EventLogger.java | 47 public void report (int code, Object... list);
55 public void report (int code, Object... list) {
58 for (Object o : list) {
66 public static void writeEvent(int code, Object... list) {
67 getReporter().report(code, list);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/ |
| assign_initializer_list.pass.cpp | 10 // <list>
14 #include <list>
23 std::list<int> d;
26 std::list<int>::iterator i = d.begin();
34 std::list<int, min_allocator<int>> d;
37 std::list<int, min_allocator<int>>::iterator i = d.begin();
|
| default_noexcept.pass.cpp | 10 // <list>
12 // list()
17 #include <list>
34 typedef std::list<MoveOnly> C;
38 typedef std::list<MoveOnly, test_allocator<MoveOnly>> C;
42 typedef std::list<MoveOnly, other_allocator<MoveOnly>> C;
46 typedef std::list<MoveOnly, some_alloc<MoveOnly>> C;
|
| initializer_list.pass.cpp | 10 // <list>
12 // list(initializer_list<value_type> il);
14 #include <list>
23 std::list<int> d = {3, 4, 5, 6};
25 std::list<int>::iterator i = d.begin();
33 std::list<int, min_allocator<int>> d = {3, 4, 5, 6};
35 std::list<int, min_allocator<int>>::iterator i = d.begin();
|
| move_assign_noexcept.pass.cpp | 10 // <list>
12 // list& operator=(list&& c)
19 #include <list>
36 typedef std::list<MoveOnly> C;
40 typedef std::list<MoveOnly, test_allocator<MoveOnly>> C;
44 typedef std::list<MoveOnly, other_allocator<MoveOnly>> C;
48 typedef std::list<MoveOnly, some_alloc<MoveOnly>> C;
|
| move_noexcept.pass.cpp | 10 // <list>
12 // list(list&&)
17 #include <list>
34 typedef std::list<MoveOnly> C;
38 typedef std::list<MoveOnly, test_allocator<MoveOnly>> C;
42 typedef std::list<MoveOnly, other_allocator<MoveOnly>> C;
46 typedef std::list<MoveOnly, some_alloc<MoveOnly>> C;
|
| op_equal_initializer_list.pass.cpp | 10 // <list>
12 // list& operator=(initializer_list<value_type> il);
14 #include <list>
22 std::list<int> d;
25 std::list<int>::iterator i = d.begin();
33 std::list<int, min_allocator<int>> d;
36 std::list<int, min_allocator<int>>::iterator i = d.begin();
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| remove_if.pass.cpp | 10 // <list>
14 #include <list>
30 std::list<int> c(a1, a1+4);
32 assert(c == std::list<int>(a2, a2+2));
38 std::list<int, min_allocator<int>> c(a1, a1+4);
40 assert((c == std::list<int, min_allocator<int>>(a2, a2+2)));
|
| reverse.pass.cpp | 10 // <list>
14 #include <list>
24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
