Searched refs:list (Results 176 - 200 of 4308) sorted by relevance

1234567891011>>

/external/chromium_org/remoting/host/
H A Ddesktop_resizer.h8 #include <list>
25 // Get the list of supported resolutions, which should ideally include
27 // 1. Return the list of resolutions supported by the underlying video
29 // 2. Return a list containing just |preferred|, perhaps after imposing
32 // 3. Return an empty list if resize is not supported.
33 virtual std::list<ScreenResolution> GetSupportedResolutions(
/external/chromium_org/remoting/webapp/
H A Dmessage_window.css16 list-style-position: inside;
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/
H A Dvp9_frame_buffers.h32 // Initializes |list|. Returns 0 on success.
33 int vp9_alloc_internal_frame_buffers(InternalFrameBufferList *list);
36 void vp9_free_internal_frame_buffers(InternalFrameBufferList *list);
/external/chromium_org/ui/webui/resources/css/
H A Dlist.css5 list,
11 list. */
14 list > *,
30 list > * {
38 list > [lead],
43 list:focus > [lead],
49 list > [anchor],
54 list:not([disabled]) > :hover,
61 list > [selected],
70 list
[all...]
/external/chromium_org/v8/test/webkit/fast/js/kde/
H A Dmath.js8 // notice, this list of conditions and the following disclaimer.
10 // notice, this list of conditions and the following disclaimer in the
93 list=""
94 for ( var i in Math ) { list += i + ','; }
95 shouldBe("list","''");
119 list=""
120 for ( var i in obj ) { list += i + ','; }
121 shouldBe("list","'a,b,'");
124 list=""
125 for ( var i in Math ) { list
[all...]
/external/fio/t/
H A Dstest.c19 struct flist_head list; member in struct:elem
23 FLIST_HEAD(list); variable
46 flist_add_tail(&e->list, &list);
52 while (!flist_empty(&list)) {
53 e = flist_entry(list.next, struct elem, list);
56 flist_del(&e->list);
/external/libcxx/test/containers/sequences/list/list.cons/
H A Ddefault.pass.cpp10 // <list>
12 // explicit list(const Alloc& = Alloc());
14 #include <list>
22 std::list<int> l;
27 std::list<DefaultOnly> l;
32 std::list<int> l((std::allocator<int>()));
38 std::list<int, min_allocator<int>> l;
43 std::list<DefaultOnly, min_allocator<DefaultOnly>> l;
48 std::list<int, min_allocator<int>> l((min_allocator<int>()));
53 std::list<in
[all...]
H A Ddtor_noexcept.pass.cpp10 // <list>
12 // ~list() // implied noexcept;
14 #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;
H A Dinitializer_list_alloc.pass.cpp10 // <list>
12 // list(initializer_list<value_type> il, const Allocator& a = allocator_type());
14 #include <list>
24 std::list<int, test_allocator<int>> d({3, 4, 5, 6}, test_allocator<int>(3));
27 std::list<int>::iterator i = d.begin();
35 std::list<int, min_allocator<int>> d({3, 4, 5, 6}, min_allocator<int>());
38 std::list<int, min_allocator<int>>::iterator i = d.begin();
/external/libcxx/test/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.op++/
H A Dpost.pass.cpp17 #include <list>
34 test(std::list<int>());
H A Dpre.pass.cpp17 #include <list>
32 test(std::list<int>());
/external/libcxx/test/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.op=/
H A Drv_value.pass.cpp21 #include <list>
39 test(std::list<std::unique_ptr<int> >());
/external/libcxx/test/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.op_astrk/
H A Dtest.pass.cpp17 #include <list>
32 test(std::list<int>());
/external/libcxx/test/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.inserter/
H A Dtest.pass.cpp17 #include <list>
33 test(std::list<int>());
/external/libvpx/libvpx/vp9/common/
H A Dvp9_frame_buffers.h32 // Initializes |list|. Returns 0 on success.
33 int vp9_alloc_internal_frame_buffers(InternalFrameBufferList *list);
36 void vp9_free_internal_frame_buffers(InternalFrameBufferList *list);
/external/srec/seti/sltsEngine/include/
H A Dlinklist.h46 For now, dynamically allocate a new list node with the data
48 LListResult Insert(LList *list, void *data);
55 For now, dynamically free a new list node
58 LListResult Delete(LList *list);
/external/guava/guava-tests/test/com/google/common/collect/
H A DSortedListsTest.java41 void assertModelAgrees(List<Integer> list, Integer key, int answer, argument
45 if (list.contains(key)) {
46 assertEquals(list.indexOf(key), answer);
51 if (list.contains(key)) {
52 assertEquals(list.lastIndexOf(key), answer);
57 if (list.contains(key)) {
58 assertEquals(key, list.get(answer));
63 if (list.contains(key)) {
64 assertEquals(list.lastIndexOf(key) + 1, answer);
69 if (list
[all...]
/external/chromium_org/components/precache/core/
H A Dprecache_fetcher.h8 #include <list>
27 // This class takes as input a prioritized list of page URLs that the user
29 // server, sending it the list of starting URLs sequentially. For each starting
47 // const std::list<GURL>& top_urls) {
70 // prioritized list of page URLs that the user commonly visits. These URLs are
71 // used by a server side component to construct a list of resource URLs that
73 PrecacheFetcher(const std::list<GURL>& starting_urls,
90 // the |resource_urls_to_fetch_| list, reducing the memory usage.
94 // Determines the list of manifest URLs to fetch according to the list o
[all...]
/external/chromium_org/third_party/libjingle/source/talk/app/webrtc/
H A Dnotifier.h9 * this list of conditions and the following disclaimer.
11 * this list of conditions and the following disclaimer in the documentation
31 #include <list>
51 for (std::list<ObserverInterface*>::iterator it = observers_.begin();
61 // Copy the list of observers to avoid a crash if the observer object
62 // unregisters as a result of the OnChanged() call. If the same list is used
63 // UnregisterObserver will affect the list make the iterator invalid.
64 std::list<ObserverInterface*> observers = observers_;
65 for (std::list<ObserverInterface*>::iterator it = observers.begin();
72 std::list<ObserverInterfac
[all...]
/external/libcxx/test/containers/sequences/list/list.special/
H A Dswap_noexcept.pass.cpp10 // <list>
12 // void swap(list& c)
18 #include <list>
40 typedef std::list<MoveOnly> C;
45 typedef std::list<MoveOnly, test_allocator<MoveOnly>> C;
50 typedef std::list<MoveOnly, other_allocator<MoveOnly>> C;
55 typedef std::list<MoveOnly, some_alloc<MoveOnly>> C;
/external/qemu/android/
H A Dhw-events.c88 eventList_getCount( EventList list )
92 if (list == NULL)
95 for (nn = 0; list[nn].name != NULL; nn++) {
102 eventList_findCodeByName( EventList list, argument
109 for ( ; list->name != NULL; list += 1 ) {
110 if ( !memcmp(name, list->name, namelen) &&
111 list->name[namelen] == 0 )
113 return list->value;
120 eventList_bufprintCode( EventList list, argument
141 EventList list; local
212 EventList list = eventList_findByType(type); local
220 EventList list = eventList_findByType(type); local
[all...]
/external/chromium_org/tools/grit/grit/format/policy_templates/writers/
H A Dreg_writer.py32 def _StartBlock(self, key, suffix, list):
36 if key != self._last_key.get(id(list), None):
37 list.append('')
38 list.append('[%s]' % key)
39 self._last_key[id(list)] = key
47 list.sort() methods to sort policies.
50 is_list = policy['type'] in ('list', 'string-enum-list')
54 def _WritePolicy(self, policy, key, list):
60 elif policy['type'] in ('list', 'strin
[all...]
/external/guava/guava-tests/test/com/google/common/util/concurrent/
H A DExecutionListTest.java39 protected ExecutionList list = new ExecutionList(); field in class:ExecutionListTest
44 list.add(new MockRunnable(countDownLatch), exec);
45 list.add(new MockRunnable(countDownLatch), exec);
46 list.add(new MockRunnable(countDownLatch), exec);
49 list.execute();
61 list.add(new MockRunnable(countDownLatch), exec);
79 ExecutionList list = new ExecutionList();
80 list.add(THROWING_RUNNABLE, sameThreadExecutor());
81 list.execute();
82 list
[all...]
/external/chromium_org/third_party/cython/src/Cython/Compiler/
H A DParseTreeTransforms.pxd9 cdef list name_nodes
23 cdef _visit_assignment_node(self, node, list expr_list)
26 #def eliminate_rhs_duplicates(list expr_list_list, list ref_node_sequence)
27 #def sort_common_subsequences(list items)
29 cdef flatten_parallel_assignments(list input, list output)
30 cdef map_starred_assignment(list lhs_targets, list starred_assignments, list lhs_arg
[all...]
/external/e2fsprogs/lib/ext2fs/
H A Dfinddev.c44 * This function adds an entry to the directory list
46 static void add_to_dirlist(const char *name, struct dir_list **list) argument
59 dp->next = *list;
60 *list = dp;
64 * This function frees a directory list
66 static void free_dirlist(struct dir_list **list) argument
70 for (dp = *list; dp; dp = next) {
75 *list = 0;
78 static int scan_dir(char *dirname, dev_t device, struct dir_list **list, argument
102 add_to_dirlist(path, list);
128 struct dir_list *list = 0, *new_list = 0; local
[all...]

Completed in 505 milliseconds

1234567891011>>