/external/chromium/chrome/browser/bookmarks/ |
H A D | bookmark_node_data.h | 39 // // data is valid, contents are in elements. 92 // Writes elements to the clipboard. 106 // Writes elements to data. If there is only one element and it is a URL 134 bool is_valid() const { return !elements.empty(); } 137 bool has_single_url() const { return is_valid() && elements[0].is_url; } 139 // Number of elements. 140 size_t size() const { return elements.size(); } 153 // The actual elements written to the clipboard. 154 std::vector<Element> elements; member in struct:BookmarkNodeData
|
/external/chromium_org/chrome/browser/bookmarks/ |
H A D | bookmark_node_data.h | 39 // // data is valid, contents are in elements. 96 // Writes elements to the clipboard. 111 // Writes elements to data. If there is only one element and it is a URL 139 bool is_valid() const { return !elements.empty(); } 142 bool has_single_url() const { return is_valid() && elements[0].is_url; } 144 // Number of elements. 145 size_t size() const { return elements.size(); } 158 // The actual elements written to the clipboard. 159 std::vector<Element> elements; member in struct:BookmarkNodeData
|
/external/chromium_org/chrome/test/webdriver/commands/ |
H A D | find_element_commands.cc | 66 std::vector<ElementId> elements; local 68 session_->current_target(), root_element, locator, query, &elements); 74 for (size_t i = 0; i < elements.size(); ++i) 75 element_list->Append(elements[i].ToValue());
|
/external/chromium_org/ppapi/shared_impl/ |
H A D | ppb_resource_array_shared.cc | 17 const PP_Resource elements[], 24 PP_Resource element = elements[index]; 15 PPB_ResourceArray_Shared(ResourceObjectType type, PP_Instance instance, const PP_Resource elements[], uint32_t size) argument
|
/external/chromium_org/ppapi/thunk/ |
H A D | ppb_resource_array_dev_thunk.cc | 22 const PP_Resource elements[], 28 return enter.functions()->CreateResourceArray(instance, elements, size); 21 Create(PP_Instance instance, const PP_Resource elements[], uint32_t size) argument
|
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | ucol_cnt.h | 47 ContractionTable **elements; member in struct:CntTable
|
/external/chromium_org/third_party/mesa/src/src/mesa/main/ |
H A D | uniforms.h | 244 struct gl_builtin_uniform_element *elements; member in struct:gl_builtin_uniform_desc 255 * access other elements of the array by adding an offset to the 260 * HOWEVER, some other OpenGL drivers allow accessing array elements
|
/external/chromium_org/ui/base/animation/ |
H A D | animation_container.cc | 58 // We notify the observer after updating all the elements. If all the elements 61 // ourself here to make sure we're still valid after running all the elements. 68 // Make a copy of the elements to iterate over so that if any elements are 70 Elements elements = elements_; local 72 for (Elements::const_iterator i = elements.begin(); 73 i != elements.end(); ++i) {
|
/external/chromium_org/webkit/common/ |
H A D | resource_request_body.h | 41 const std::vector<Element>* elements() const { return &elements_; } function in class:webkit_glue::ResourceRequestBody 43 void swap_elements(std::vector<Element>* elements) { argument 44 elements_.swap(*elements);
|
/external/dexmaker/src/dx/java/com/android/dx/util/ |
H A D | IntSet.java | 55 * Returns the count of unique elements in this set. 57 * @return {@code > = 0;} count of unique elements 59 int elements(); method in interface:IntSet
|
H A D | ListIntSet.java | 103 public int elements() { method in class:ListIntSet
|
/external/flac/libFLAC/ |
H A D | memory.c | 74 FLAC__bool FLAC__memory_alloc_aligned_int32_array(unsigned elements, FLAC__int32 **unaligned_pointer, FLAC__int32 **aligned_pointer) argument 82 FLAC__ASSERT(elements > 0); 87 if((size_t)elements > SIZE_MAX / sizeof(*pu)) /* overflow check */ 90 pu = (FLAC__int32*)FLAC__memory_alloc_aligned(sizeof(*pu) * (size_t)elements, &u.pv); 103 FLAC__bool FLAC__memory_alloc_aligned_uint32_array(unsigned elements, FLAC__uint32 **unaligned_pointer, FLAC__uint32 **aligned_pointer) argument 111 FLAC__ASSERT(elements > 0); 116 if((size_t)elements > SIZE_MAX / sizeof(*pu)) /* overflow check */ 119 pu = (FLAC__uint32*)FLAC__memory_alloc_aligned(sizeof(*pu) * elements, &u.pv); 132 FLAC__bool FLAC__memory_alloc_aligned_uint64_array(unsigned elements, FLAC__uint64 **unaligned_pointer, FLAC__uint64 **aligned_pointer) argument 140 FLAC__ASSERT(elements > 161 FLAC__memory_alloc_aligned_unsigned_array(unsigned elements, unsigned **unaligned_pointer, unsigned **aligned_pointer) argument 192 FLAC__memory_alloc_aligned_real_array(unsigned elements, FLAC__real **unaligned_pointer, FLAC__real **aligned_pointer) argument [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | EnumMultiset.java | 42 * Creates a new {@code EnumMultiset} containing the specified elements. 44 * <p>This implementation is highly efficient when {@code elements} is itself a {@link 47 * @param elements the elements that the multiset should contain 48 * @throws IllegalArgumentException if {@code elements} is empty 50 public static <E extends Enum<E>> EnumMultiset<E> create(Iterable<E> elements) { argument 51 Iterator<E> iterator = elements.iterator(); 54 Iterables.addAll(multiset, elements); 75 * elements, the first element, its count, the second element, its
|
H A D | HashMultiset.java | 47 * number of distinct elements. 49 * @param distinctElements the expected number of distinct elements 57 * Creates a new {@code HashMultiset} containing the specified elements. 59 * <p>This implementation is highly efficient when {@code elements} is itself 62 * @param elements the elements that the multiset should contain 64 public static <E> HashMultiset<E> create(Iterable<? extends E> elements) { argument 66 create(Multisets.inferDistinctElements(elements)); 67 Iterables.addAll(multiset, elements); 80 * @serialData the number of distinct elements, th [all...] |
H A D | LinkedHashMultiset.java | 29 * iterator orders elements according to when the first occurrence of the 53 * number of distinct elements. 55 * @param distinctElements the expected number of distinct elements 63 * Creates a new {@code LinkedHashMultiset} containing the specified elements. 65 * <p>This implementation is highly efficient when {@code elements} is itself 68 * @param elements the elements that the multiset should contain 71 Iterable<? extends E> elements) { 73 create(Multisets.inferDistinctElements(elements)); 74 Iterables.addAll(multiset, elements); 70 create( Iterable<? extends E> elements) argument [all...] |
H A D | RegularImmutableSet.java | 24 * Implementation of {@link ImmutableSet} with two or more elements. 31 // the same elements in hashed positions (plus nulls) 38 Object[] elements, int hashCode, Object[] table, int mask) { 39 super(elements); 37 RegularImmutableSet( Object[] elements, int hashCode, Object[] table, int mask) argument
|
H A D | SortedIterables.java | 42 * Returns {@code true} if {@code elements} is a sorted collection using an ordering equivalent 45 public static boolean hasSameComparator(Comparator<?> comparator, Iterable<?> elements) { argument 47 checkNotNull(elements); 49 if (elements instanceof SortedSet) { 50 SortedSet<?> sortedSet = (SortedSet<?>) elements; 55 } else if (elements instanceof SortedIterable) { 56 comparator2 = ((SortedIterable<?>) elements).comparator(); 64 * Returns a sorted collection of the unique elements according to the specified comparator. Does 69 Comparator<? super E> comparator, Iterator<E> elements) { 71 Iterators.addAll(sortedSet, elements); 68 sortedUnique( Comparator<? super E> comparator, Iterator<E> elements) argument 80 sortedUnique( Comparator<? super E> comparator, Iterable<E> elements) argument 122 sortedCounts( Comparator<? super E> comparator, Iterator<E> elements) argument 133 sortedCounts( Comparator<? super E> comparator, Iterable<E> elements) argument [all...] |
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | TestContainerGenerator.java | 25 * elements. Such things include both {@link Collection} and {@link Map}; since 35 * Returns the sample elements that this generate populates its container 41 * Creates a new container containing the given elements. TODO: would be nice 45 T create(Object ... elements); argument 54 * Returns the iteration ordering of elements, given the order in
|
H A D | TestEnumSetGenerator.java | 39 public Set<AnEnum> create(Object... elements) { argument 40 AnEnum[] array = new AnEnum[elements.length]; 42 for (Object e : elements) { 48 protected abstract Set<AnEnum> create(AnEnum[] elements); argument
|
H A D | TestStringCollectionGenerator.java | 39 public Collection<String> create(Object... elements) { argument 40 String[] array = new String[elements.length]; 42 for (Object e : elements) { 48 protected abstract Collection<String> create(String[] elements); argument
|
H A D | TestStringListGenerator.java | 38 public List<String> create(Object... elements) { argument 39 String[] array = new String[elements.length]; 41 for (Object e : elements) { 48 * Creates a new collection containing the given elements; implement this 51 protected abstract List<String> create(String[] elements); argument
|
H A D | TestStringQueueGenerator.java | 40 public Queue<String> create(Object... elements) { argument 41 String[] array = new String[elements.length]; 43 for (Object e : elements) { 49 protected abstract Queue<String> create(String[] elements); argument
|
H A D | TestStringSetGenerator.java | 39 public Set<String> create(Object... elements) { argument 40 String[] array = new String[elements.length]; 42 for (Object e : elements) { 48 protected abstract Set<String> create(String[] elements); argument 58 * <p>By default, returns the supplied elements in their given order; however,
|
H A D | TestUnhashableCollectionGenerator.java | 25 * Creates collections containing unhashable sample elements, to be tested. 40 public T create(Object... elements) { argument 41 UnhashableObject[] array = createArray(elements.length); 43 for (Object e : elements) { 50 * Creates a new collection containing the given elements; implement this 53 protected abstract T create(UnhashableObject[] elements); argument
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
H A D | TestEnumMultisetGenerator.java | 43 public Multiset<AnEnum> create(Object... elements) { argument 44 AnEnum[] array = new AnEnum[elements.length]; 46 for (Object e : elements) { 52 protected abstract Multiset<AnEnum> create(AnEnum[] elements); argument
|