/external/chromium_org/chrome/browser/resources/options/ |
H A D | autofill_options.css | 14 #autofill-options list { 18 .autofill-list-item { 25 .autofill-list-item + img { 34 #autofill-options > div.settings-list > div:last-child { 44 #autofill-options .list-inline-button { 50 .list-inline-button {
|
/external/chromium_org/chrome/browser/ui/webui/sync_file_system_internals/ |
H A D | dump_database_handler.cc | 29 scoped_ptr<base::ListValue> list; local 39 void DumpDatabaseHandler::DidGetDatabaseDump(const base::ListValue& list) { argument 40 web_ui()->CallJavascriptFunction("DumpDatabase.onGetDatabaseDump", list);
|
/external/chromium_org/content/browser/media/ |
H A D | webrtc_internals_message_handler.h | 35 void OnGetAllStats(const base::ListValue* list); 36 void OnSetAecRecordingEnabled(bool enable, const base::ListValue* list); 37 void OnDOMLoadDone(const base::ListValue* list);
|
/external/chromium_org/native_client_sdk/src/build_tools/ |
H A D | parse_dsc.py | 31 'TOOLS' : (list, VALID_TOOLCHAINS, True), 32 'CONFIGS' : (list, ['Debug', 'Release'], False), 33 'PREREQ' : (list, '', False), 34 'TARGETS' : (list, { 42 'SOURCES': (list, '', True), 43 'CFLAGS': (list, '', False), 44 'CFLAGS_GCC': (list, '', False), 45 'CXXFLAGS': (list, '', False), 46 'DEFINES': (list, '', False), 47 'LDFLAGS': (list, '', Fals [all...] |
/external/chromium_org/third_party/webrtc/base/ |
H A D | network_unittest.cc | 38 const NetworkManager::NetworkList& list, 40 network_manager.MergeNetworkList(list, changed); 50 NetworkManager::NetworkList list; local 51 network_manager.CreateNetworks(include_ignored, &list); 52 return list; 181 // Add ipv4_network1 to the list of networks. 182 NetworkManager::NetworkList list; local 183 list.push_back(new Network(ipv4_network1)); 185 MergeNetworkList(manager, list, &changed); 187 list 37 MergeNetworkList(BasicNetworkManager& network_manager, const NetworkManager::NetworkList& list, bool* changed ) argument 239 SetupNetworks(NetworkManager::NetworkList* list) argument 279 NetworkManager::NetworkList list; local 354 NetworkManager::NetworkList list; local 390 NetworkManager::NetworkList list; local 445 NetworkManager::NetworkList list; local 476 NetworkManager::NetworkList list; local 527 NetworkManager::NetworkList list; local 561 ifaddrs list; local 584 NetworkManager::NetworkList list; local 621 NetworkManager::NetworkList list; local [all...] |
/external/dexmaker/src/dx/java/com/android/dx/dex/file/ |
H A D | HeaderSection.java | 29 /** {@code non-null;} the list of the one item in the section */ 30 private final List<HeaderItem> list; field in class:HeaderSection 43 this.list = Collections.singletonList(item); 55 return list;
|
/external/libcxx/test/containers/sequences/list/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/containers/sequences/list/Android.mk 19 test_name := containers/sequences/list/db_iterators_7 23 test_name := containers/sequences/list/db_front 27 test_name := containers/sequences/list/db_cback 31 test_name := containers/sequences/list/version 35 test_name := containers/sequences/list/iterators 39 test_name := containers/sequences/list/types 43 test_name := containers/sequences/list/db_iterators_9 47 test_name := containers/sequences/list/db_iterators_8 51 test_name := containers/sequences/list/db_bac [all...] |
H A D | db_back.pass.cpp | 10 // <list> 18 #include <list> 30 typedef std::list<T> C; 40 typedef std::list<T, min_allocator<T>> C;
|
H A D | db_front.pass.cpp | 10 // <list> 18 #include <list> 30 typedef std::list<T> C; 40 typedef std::list<T, min_allocator<T>> C;
|
H A D | db_iterators_6.pass.cpp | 10 // <list> 18 #include <list> 30 typedef std::list<T> C; 41 typedef std::list<T, min_allocator<T>> C;
|
H A D | db_iterators_7.pass.cpp | 10 // <list> 18 #include <list> 30 typedef std::list<T> C; 41 typedef std::list<T, min_allocator<T>> C;
|
H A D | db_iterators_8.pass.cpp | 10 // <list> 18 #include <list> 30 typedef std::list<T> C; 39 typedef std::list<T, min_allocator<T>> C;
|
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
H A D | parse-events.h | 7 #include <linux/list.h> 62 struct list_head list; member in struct:parse_events_term 66 struct list_head list; member in struct:parse_events_evlist 85 int parse_events__modifier_event(struct list_head *list, char *str, bool add); 86 int parse_events__modifier_group(struct list_head *list, char *event_mod); 87 int parse_events_name(struct list_head *list, char *name); 88 int parse_events_add_tracepoint(struct list_head *list, int *idx, 90 int parse_events_add_numeric(struct list_head *list, int *idx, 93 int parse_events_add_cache(struct list_head *list, int *idx, 95 int parse_events_add_breakpoint(struct list_head *list, in [all...] |
/external/libcxx/test/containers/sequences/list/list.ops/ |
H A D | 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<in [all...] |
/external/chromium_org/net/disk_cache/blockfile/ |
H A D | rankings.h | 10 #include <list> 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); 116 // Removes a given entry from the LRU list. If |strict| is true, this method 119 // to be removed from the list (basically without control of the code that is 121 void Remove(CacheRankingsBlock* node, List list, bool strict); 124 void UpdateRank(CacheRankingsBlock* node, bool modified, List list); 126 // Iterates through the list. 127 CacheRankingsBlock* GetNext(CacheRankingsBlock* node, List list); 128 CacheRankingsBlock* GetPrev(CacheRankingsBlock* node, List list); [all...] |
/external/chromium_org/tools/json_schema_compiler/test/ |
H A D | idl_schemas_unittest.cc | 39 base::ListValue list; local 40 list.Append(new base::FundamentalValue(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 base::ListValue list; local 82 scoped_ptr<Function7::Params> f7_params = Function7::Params::Create(list); 84 list.Append(new base::FundamentalValue(7)); 85 f7_params = Function7::Params::Create(list); 123 base::ListValue list; local 191 base::ListValue list; local [all...] |
/external/chromium_org/third_party/libxml/src/ |
H A D | 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 a [all...] |
/external/chromium_org/third_party/libxslt/libxslt/ |
H A D | 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 a [all...] |
/external/libxml2/ |
H A D | 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 a [all...] |
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | DocumentMarkerController.cpp | 214 OwnPtrWillBeMember<MarkerList>& list = markers->at(markerListIndex); local 215 if (list->isEmpty() || list->last()->endOffset() < newMarker.startOffset()) { 216 list->append(RenderedDocumentMarker::create(newMarker)); 220 mergeOverlapping(list.get(), toInsert); 222 MarkerList::iterator pos = std::lower_bound(list->begin(), list->end(), &toInsert, startsFurther); 223 list->insert(pos - list->begin(), RenderedDocumentMarker::create(toInsert)); 232 void DocumentMarkerController::mergeOverlapping(MarkerList* list, DocumentMarke argument 263 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex]; local 309 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex]; local 385 OwnPtrWillBeMember<MarkerList>& list = (*markers)[MarkerTypeToMarkerIndex(markerType)]; local 406 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex]; local 424 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex]; local 477 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex]; local 515 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex]; local 560 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex]; local 604 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex]; local 626 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex]; local 645 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex]; local 692 OwnPtrWillBeMember<MarkerList>& list = (*markers)[MarkerTypeToMarkerIndex(DocumentMarker::TextMatch)]; local 750 OwnPtrWillBeMember<MarkerList>& list = (*markers)[markerListIndex]; local [all...] |
/external/chromium_org/net/base/ |
H A D | priority_queue.h | 8 #include <list> 36 typedef std::list<std::pair<unsigned, T> > List; 38 typedef std::list<T> List; 121 // initialize a NULL iterator to the end of a valid list. 144 List& list = lists_[priority]; local 149 return Pointer(priority, list.insert(list.end(), 152 return Pointer(priority, list.insert(list.end(), value)); 162 List& list 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/ |
H A D | badblocks.c | 30 * Helper function for making a badblocks list 32 static errcode_t make_u32_list(int size, int num, __u32 *list, argument 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/ |
H A D | SortedLists.java | 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) { 70 int upper = list.size() - 1; 74 int c = comparator.compare(list.get(middle), key); 85 * Return the index of the first list element that compares as equal to the key. 90 Comparator<? super E> comparator, E key, List<? extends E> list, in 131 resultIndex( Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) argument 189 binarySearch(List<? extends E> list, E e, KeyPresentBehavior presentBehavior, KeyAbsentBehavior absentBehavior) argument 202 binarySearch(List<E> list, Function<? super E, K> keyFunction, K key, KeyPresentBehavior presentBehavior, KeyAbsentBehavior absentBehavior) argument 221 binarySearch( List<E> list, Function<? super E, K> keyFunction, K key, Comparator<? super K> keyComparator, KeyPresentBehavior presentBehavior, KeyAbsentBehavior absentBehavior) argument 255 binarySearch(List<? extends E> list, @Nullable E key, Comparator<? super E> comparator, KeyPresentBehavior presentBehavior, KeyAbsentBehavior absentBehavior) argument [all...] |
/external/chromium_org/chrome/browser/browsing_data/ |
H A D | mock_browsing_data_database_helper.h | 8 #include <list> 16 // Use AddDatabaseSamples() or add directly to response_ list, then call 23 const base::Callback<void(const std::list<DatabaseInfo>&)>& callback) 49 base::Callback<void(const std::list<DatabaseInfo>&)> callback_; 54 std::list<DatabaseInfo> response_;
|
H A D | mock_browsing_data_file_system_helper.h | 8 #include <list> 17 // Use AddFileSystemSamples() or add directly to response_ list, then call 25 void(const std::list<FileSystemInfo>&)>& callback) OVERRIDE; 52 base::Callback<void(const std::list<FileSystemInfo>&)> callback_; 57 std::list<FileSystemInfo> response_;
|