| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/list/aux_/ |
| begin_end.hpp | 18 #include <boost/mpl/list/aux_/iterator.hpp>
19 #include <boost/mpl/list/aux_/tag.hpp>
20 #include <boost/mpl/list/aux_/item.hpp>
27 template< typename List > struct apply
29 typedef l_iter<typename List::type> type;
|
| /packages/providers/CalendarProvider/tests/src/com/android/providers/calendar/ |
| RecurrenceSetTest.java | 27 import java.util.List;
113 List<ICalendar.Property> list = component.getProperties("DTSTART"); local
114 assertTrue(list.size() == 1);
115 assertEquals("19700101T000000Z", list.get(0).getValue());
117 list = component.getProperties("RRULE");
118 assertTrue(list.size() == 1);
119 assertEquals(RRULE_LESS_THAN_75_CHARS,list.get(0).getValue());
130 list = component.getProperties("RRULE");
131 assertTrue(list.size() == 1)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| splice_pos_list_iter_iter.pass.cpp | 10 // <list>
12 // void splice(const_iterator position, list& x, iterator first, iterator last);
18 #include <list>
28 std::list<int> l1(a1, a1+3);
32 std::list<int>::const_iterator i = l1.begin();
40 std::list<int> l1(a1, a1+3);
44 std::list<int>::const_iterator i = l1.begin();
52 std::list<int> l1(a1, a1+3);
56 std::list<int>::const_iterator i = l1.begin();
64 std::list<int> l1(a1, a1+3)
[all...] |
| /external/chromium_org/net/disk_cache/ |
| rankings.h | 10 #include <list>
56 enum List {
57 NO_USE = 0, // List of entries that have not been reused.
58 LOW_USE, // List of entries with low reuse.
59 HIGH_USE, // List of entries with high reuse.
61 DELETED, // List of recently deleted or doomed entries.
100 List list; // Which entry was returned to the user. member in struct:disk_cache::Rankings::Iterator
114 void Insert(CacheRankingsBlock* node, bool modified, List list);
[all...] |
| /hardware/libhardware/tests/nusensors/ |
| nusensors.cpp | 78 struct sensor_t const* list; local
79 int count = module->get_sensors_list(module, &list);
90 list[i].name,
91 list[i].vendor,
92 list[i].version,
93 list[i].handle,
94 list[i].type,
95 list[i].maxRange,
96 list[i].resolution,
97 list[i].power)
[all...] |
| /external/chromium_org/tools/json_schema_compiler/test/ |
| idl_schemas_unittest.cc | 39 ListValue list; local
40 list.Append(Value::CreateIntegerValue(5));
41 scoped_ptr<Function2::Params> f2_params = Function2::Params::Create(list);
45 list.Clear();
53 list.Append(tmp);
54 scoped_ptr<Function3::Params> f3_params = Function3::Params::Create(list);
81 ListValue list; local
82 scoped_ptr<Function7::Params> f7_params = Function7::Params::Create(list);
84 list.Append(Value::CreateIntegerValue(7));
85 f7_params = Function7::Params::Create(list);
123 ListValue list; local
191 ListValue list; local
[all...] |
| /external/e2fsprogs/e2fsck/ |
| ea_refcount.c | 35 struct ea_refcount_el *list; member in struct:ea_refcount
43 if (refcount->list)
44 ext2fs_free_mem(&refcount->list);
67 retval = ext2fs_get_mem(bytes, &refcount->list);
70 memset(refcount->list, 0, bytes);
90 struct ea_refcount_el *list; local
92 list = refcount->list;
94 if (list[i].ea_count) {
96 list[j] = list[i]
308 struct ea_refcount_el *list; local
[all...] |
| /external/chromium_org/third_party/libxml/src/ |
| triodef.h | 139 # define TRIO_ARGS1(list,a1) list a1;
140 # define TRIO_ARGS2(list,a1,a2) list a1; a2;
141 # define TRIO_ARGS3(list,a1,a2,a3) list a1; a2; a3;
142 # define TRIO_ARGS4(list,a1,a2,a3,a4) list a1; a2; a3; a4;
143 # define TRIO_ARGS5(list,a1,a2,a3,a4,a5) list a1; a2; a3; a4; a5
[all...] |
| /external/chromium_org/third_party/libxslt/libxslt/ |
| triodef.h | 137 # define TRIO_ARGS1(list,a1) list a1;
138 # define TRIO_ARGS2(list,a1,a2) list a1; a2;
139 # define TRIO_ARGS3(list,a1,a2,a3) list a1; a2; a3;
140 # define TRIO_ARGS4(list,a1,a2,a3,a4) list a1; a2; a3; a4;
141 # define TRIO_ARGS5(list,a1,a2,a3,a4,a5) list a1; a2; a3; a4; a5
[all...] |
| /external/libxml2/ |
| triodef.h | 139 # define TRIO_ARGS1(list,a1) list a1;
140 # define TRIO_ARGS2(list,a1,a2) list a1; a2;
141 # define TRIO_ARGS3(list,a1,a2,a3) list a1; a2; a3;
142 # define TRIO_ARGS4(list,a1,a2,a3,a4) list a1; a2; a3; a4;
143 # define TRIO_ARGS5(list,a1,a2,a3,a4,a5) list a1; a2; a3; a4; a5
[all...] |
| /external/libxslt/libxslt/ |
| triodef.h | 137 # define TRIO_ARGS1(list,a1) list a1;
138 # define TRIO_ARGS2(list,a1,a2) list a1; a2;
139 # define TRIO_ARGS3(list,a1,a2,a3) list a1; a2; a3;
140 # define TRIO_ARGS4(list,a1,a2,a3,a4) list a1; a2; a3; a4;
141 # define TRIO_ARGS5(list,a1,a2,a3,a4,a5) list a1; a2; a3; a4; a5
[all...] |
| /external/chromium_org/net/base/ |
| priority_queue.h | 8 #include <list>
36 typedef std::list<std::pair<unsigned, T> > List;
38 typedef std::list<T> List;
101 // List::erase. When C++11 is turned on for Chromium, this could
104 typedef typename PriorityQueue::List::iterator ListIterator;
121 // initialize a NULL iterator to the end of a valid list.
122 List dummy_empty_list_;
144 List& list = lists_[priority] local
162 List& list = lists_[priority]; local
195 List* list = const_cast<List*>(&lists_[i]); local
207 List* list = const_cast<List*>(&lists_[i]); local
220 List* list = const_cast<List*>(&lists_[index]); local
233 List* list = const_cast<List*>(&lists_[index]); local
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| badblocks.c | 30 * Helper function for making a badblocks list
32 static errcode_t make_u32_list(int size, int num, __u32 *list,
45 retval = ext2fs_get_array(bb->size, sizeof(blk_t), &bb->list);
50 if (list)
51 memcpy(bb->list, list, bb->size * sizeof(blk_t));
53 memset(bb->list, 0, bb->size * sizeof(blk_t));
60 * This procedure creates an empty u32 list.
68 * This procedure creates an empty badblocks list.
77 * This procedure copies a badblocks list
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| SortedLists.java | 25 import java.util.List;
31 * Static methods pertaining to sorted {@link List} instances.
36 * list.
45 * A specification for which index to return if the list contains at least one element that
50 * Return the index of any list element that compares as equal to the key. No guarantees are
56 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) {
61 * Return the index of the last list element that compares as equal to the key.
66 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex)
[all...] |
| /bionic/libc/kernel/common/linux/ |
| key.h | 22 #include <linux/list.h>
|
| /bionic/libc/kernel/common/linux/sunrpc/ |
| types.h | 25 #include <linux/list.h>
|
| /development/ndk/platforms/android-3/include/linux/ |
| key.h | 16 #include <linux/list.h>
|
| /development/ndk/platforms/android-3/include/linux/sunrpc/ |
| types.h | 18 #include <linux/list.h>
|
| /external/chromium/chrome/browser/resources/bookmark_manager/css/ |
| bmm.css | 14 list {
20 list > * {
28 list > * > * {
37 list > * > .label {
43 list > * > .url {
47 list > :hover > .url,
48 list > [selected] > .url {
52 html[dir=rtl] list .label {
56 list > .folder > .label {
61 list > * > .label:empty:after
[all...] |
| /external/chromium/net/disk_cache/ |
| rankings.h | 11 #include <list>
54 enum List {
55 NO_USE = 0, // List of entries that have not been reused.
56 LOW_USE, // List of entries with low reuse.
57 HIGH_USE, // List of entries with high reuse.
59 DELETED, // List of recently deleted or doomed entries.
99 List list; // Which entry was returned to the user. member in struct:disk_cache::Rankings::Iterator
113 void Insert(CacheRankingsBlock* node, bool modified, List list);
[all...] |
| /external/chromium_org/chrome/browser/component_updater/test/ |
| update_response_unittest.cc | 219 EXPECT_TRUE(parser.results().list.empty());
223 EXPECT_TRUE(parser.results().list.empty());
227 EXPECT_TRUE(parser.results().list.empty());
231 EXPECT_TRUE(parser.results().list.empty());
235 EXPECT_TRUE(parser.results().list.empty());
241 EXPECT_EQ(1u, parser.results().list.size());
242 const UpdateResponse::Result* firstResult = &parser.results().list[0];
261 EXPECT_FALSE(parser.results().list.empty());
262 firstResult = &parser.results().list[0];
269 EXPECT_FALSE(parser.results().list.empty())
[all...] |
| /external/chromium_org/chrome/browser/resources/ntp_android/ |
| opentabs_tablet.css | 9 body[device='tablet'] #open_tabs_container .page-list>div {
17 body[device='tablet'] #open_tabs_container .page-list>div {
26 body[device='tablet'] #open_tabs_container .session-header .list-item {
34 body[device='tablet'] #open_tabs_container .list-item {
40 body[device='tablet'] #open_tabs_container .list-item-active,
42 .list-item.list-item-active {
59 .list-item:first-child {
|
| /external/chromium_org/content/renderer/p2p/ |
| network_list_observer.h | 22 const net::NetworkInterfaceList& list) = 0;
|
| /external/chromium_org/ppapi/thunk/ |
| ppb_input_event_api.h | 46 virtual void AddTouchPoint(PP_TouchListType list,
48 virtual uint32_t GetTouchCount(PP_TouchListType list) = 0;
49 virtual PP_TouchPoint GetTouchByIndex(PP_TouchListType list,
51 virtual PP_TouchPoint GetTouchById(PP_TouchListType list,
|
| /external/clang/include/clang/Rewrite/Core/ |
| TokenRewriter.h | 21 #include <list>
29 /// TokenList - This is the list of raw tokens that make up this file. Each
31 std::list<Token> TokenList;
34 typedef std::list<Token>::iterator TokenRefTy;
54 typedef std::list<Token>::const_iterator token_iterator;
|
