| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_node_data.cc | 101 elements.push_back(Element(node));
120 elements.push_back(Element(nodes[i]));
136 elements.push_back(element);
147 if (elements.size() == 1 && elements[0].is_url) {
148 const string16& title = elements[0].title;
149 const std::string url = elements[0].url.spec();
187 elements.clear();
188 elements.push_back(element);
201 bookmark_pasteboard_helper_mac::WriteToClipboard(elements, profile_path_)
[all...] |
| bookmark_node_data_unittest.cc | 65 ASSERT_EQ(1, drag_data.elements.size());
66 EXPECT_TRUE(drag_data.elements[0].is_url);
67 EXPECT_EQ(url, drag_data.elements[0].url);
68 EXPECT_EQ(title, drag_data.elements[0].title);
69 EXPECT_EQ(0, drag_data.elements[0].children.size());
85 ASSERT_EQ(1, drag_data.elements.size());
86 EXPECT_TRUE(drag_data.elements[0].is_url);
87 EXPECT_EQ(url, drag_data.elements[0].url);
88 EXPECT_EQ(title, WideToUTF16Hack(drag_data.elements[0].title));
97 ASSERT_EQ(1, read_data.elements.size())
[all...] |
| /external/chromium_org/chrome/browser/bookmarks/ |
| bookmark_node_data_unittest.cc | 63 ASSERT_EQ(1, drag_data.elements.size());
64 EXPECT_TRUE(drag_data.elements[0].is_url);
65 EXPECT_EQ(url, drag_data.elements[0].url);
66 EXPECT_EQ(title, drag_data.elements[0].title);
67 EXPECT_EQ(0, drag_data.elements[0].children.size());
83 ASSERT_EQ(1, drag_data.elements.size());
84 EXPECT_TRUE(drag_data.elements[0].is_url);
85 EXPECT_EQ(url, drag_data.elements[0].url);
86 EXPECT_EQ(title, drag_data.elements[0].title);
95 ASSERT_EQ(1, read_data.elements.size())
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| TestsForSetsInJavaUtil.java | 107 @Override public Set<String> create(String[] elements) {
122 @Override public Set<String> create(String[] elements) {
123 return Collections.singleton(elements[0]);
138 @Override public Set<String> create(String[] elements) {
139 return new HashSet<String>(MinimalCollection.of(elements));
154 @Override public Set<String> create(String[] elements) {
155 return new LinkedHashSet<String>(MinimalCollection.of(elements));
171 @Override public Set<AnEnum> create(AnEnum[] elements) {
172 return (elements.length == 0)
174 : EnumSet.copyOf(MinimalCollection.of(elements));
[all...] |
| TestsForQueuesInJavaUtil.java | 81 @Override public Queue<String> create(String[] elements) {
82 return new LinkedList<String>(MinimalCollection.of(elements));
99 @Override public Queue<String> create(String[] elements) {
101 100, false, MinimalCollection.of(elements));
116 @Override public Queue<String> create(String[] elements) {
118 MinimalCollection.of(elements));
133 @Override public Queue<String> create(String[] elements) {
135 MinimalCollection.of(elements));
155 @Override public Queue<String> create(String[] elements) {
157 MinimalCollection.of(elements));
[all...] |
| /libcore/luni/src/main/java/libcore/reflect/ |
| AnnotationFactory.java | 89 * @param elements name-value pairs representing elements of the annotation
93 AnnotationMember[] elements) {
94 AnnotationFactory factory = new AnnotationFactory(annotationType, elements);
100 private AnnotationMember[] elements; field in class:AnnotationFactory
114 elements = defs;
117 elements = new AnnotationMember[defs.length];
118 next: for (int i = elements.length - 1; i >= 0; i--) {
121 elements[i] = val.setDefinition(defs[i]);
125 elements[i] = defs[i]
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/annotation/ |
| Annotation.java | 51 private final TreeMap<CstUtf8, NameValuePair> elements; field in class:Annotation
54 * Construct an instance. It initially contains no elements.
70 this.elements = new TreeMap<CstUtf8, NameValuePair>();
87 return elements.equals(otherAnnotation.elements);
93 hash = (hash * 31) + elements.hashCode();
112 Iterator<NameValuePair> thisIter = elements.values().iterator();
113 Iterator<NameValuePair> otherIter = other.elements.values().iterator();
150 for (NameValuePair pair : elements.values()) {
197 elements.put(pair.getName(), pair)
[all...] |
| /dalvik/dx/src/com/android/dx/rop/annotation/ |
| Annotation.java | 42 private final TreeMap<CstString, NameValuePair> elements; field in class:Annotation
45 * Construct an instance. It initially contains no elements.
61 this.elements = new TreeMap<CstString, NameValuePair>();
78 return elements.equals(otherAnnotation.elements);
84 hash = (hash * 31) + elements.hashCode();
103 Iterator<NameValuePair> thisIter = elements.values().iterator();
104 Iterator<NameValuePair> otherIter = other.elements.values().iterator();
141 for (NameValuePair pair : elements.values()) {
188 elements.put(pair.getName(), pair)
[all...] |
| /external/chromium/net/base/ |
| upload_data_stream.cc | 59 std::vector<UploadData::Element>& elements = *data_->elements(); local
61 while (buf_len_ < kBufSize && next_element_ < elements.size()) {
64 UploadData::Element& element = elements[next_element_];
155 if (next_element_ == elements.size() && !buf_len_) {
157 (!elements.empty() && elements.back().is_last_chunk())) {
166 const std::vector<UploadData::Element>& elements = *data_->elements(); local
169 (!elements.empty() &
[all...] |
| /external/chromium_org/net/base/ |
| upload_data.h | 50 const ScopedVector<UploadElement>& elements() const { function in class:net::UploadData
58 void swap_elements(ScopedVector<UploadElement>* elements) {
59 elements_.swap(*elements);
|
| /external/dexmaker/src/dx/java/com/android/dx/rop/annotation/ |
| Annotation.java | 43 private final TreeMap<CstString, NameValuePair> elements; field in class:Annotation
46 * Construct an instance. It initially contains no elements.
62 this.elements = new TreeMap<CstString, NameValuePair>();
79 return elements.equals(otherAnnotation.elements);
85 hash = (hash * 31) + elements.hashCode();
104 Iterator<NameValuePair> thisIter = elements.values().iterator();
105 Iterator<NameValuePair> otherIter = other.elements.values().iterator();
142 for (NameValuePair pair : elements.values()) {
189 elements.put(pair.getName(), pair)
[all...] |
| /external/guava/guava-gwt/src/com/google/common/collect/ |
| RegularImmutableList_CustomFieldSerializer.java | 41 List<Object> elements = new ArrayList<Object>(); local
42 Collection_CustomFieldSerializerBase.deserialize(reader, elements);
46 * always have one or more elements, ImmutableList.copyOf always return
49 return (RegularImmutableList<Object>) ImmutableList.copyOf(elements);
|
| RegularImmutableMultiset_CustomFieldSerializer.java | 38 List<Object> elements = Lists.newArrayList(); local
39 Collection_CustomFieldSerializerBase.deserialize(reader, elements);
43 * RegularImmutableMultiset always have one or more elements,
47 .copyOf(elements);
|
| RegularImmutableSet_CustomFieldSerializer.java | 39 List<Object> elements = Lists.newArrayList(); local
40 Collection_CustomFieldSerializerBase.deserialize(reader, elements);
44 * always have two or more elements, ImmutableSet.copyOf always return
47 return (RegularImmutableSet<Object>) ImmutableSet.copyOf(elements);
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| HashMultiset.java | 43 * number of distinct elements.
45 * @param distinctElements the expected number of distinct elements
53 * Creates a new {@code HashMultiset} containing the specified elements.
55 * <p>This implementation is highly efficient when {@code elements} is itself
58 * @param elements the elements that the multiset should contain
60 public static <E> HashMultiset<E> create(Iterable<? extends E> elements) {
62 create(Multisets.inferDistinctElements(elements));
63 Iterables.addAll(multiset, elements);
|
| ImmutableAsList_CustomFieldSerializer.java | 41 List<Object> elements = new ArrayList<Object>(); local
42 Collection_CustomFieldSerializerBase.deserialize(reader, elements);
43 return new ImmutableAsList<Object>(elements);
|
| LinkedHashMultiset.java | 25 * iterator orders elements according to when the first occurrence of the
49 * number of distinct elements.
51 * @param distinctElements the expected number of distinct elements
59 * Creates a new {@code LinkedHashMultiset} containing the specified elements.
61 * <p>This implementation is highly efficient when {@code elements} is itself
64 * @param elements the elements that the multiset should contain
67 Iterable<? extends E> elements) {
69 create(Multisets.inferDistinctElements(elements));
70 Iterables.addAll(multiset, elements);
[all...] |
| ImmutableList.java | 54 // Casting to any type is safe because the list will never hold any elements.
129 public static <E> ImmutableList<E> of(E[] elements) {
130 checkNotNull(elements); // for GWT
131 switch (elements.length) {
135 return new SingletonImmutableList<E>(elements[0]);
138 ImmutableList.<E>nullCheckedList(elements));
146 public static <E> ImmutableList<E> copyOf(Iterable<? extends E> elements) {
147 checkNotNull(elements); // for GWT
148 return (elements instanceof Collection)
149 ? copyOf((Collection<? extends E>) elements)
177 Object[] elements = collection.toArray(); local
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| BiMapGenerators.java | 44 @Override protected Set<String> create(String[] elements) {
46 for (int i = 0; i < elements.length; i++) {
47 map.put(elements[i], i);
55 @Override protected Set<String> create(String[] elements) {
57 for (int i = 0; i < elements.length; i++) {
58 map.put(i, elements[i]);
83 @Override protected Set<String> create(String[] elements) {
85 for (int i = 0; i < elements.length; i++) {
86 map.put(i, elements[i]);
94 @Override protected Set<String> create(String[] elements) {
[all...] |
| /external/skia/tests/ |
| LListTest.cpp | 38 ListElement elements[4]) {
44 REPORTER_ASSERT(reporter, in0 == list.isInList(&elements[0]));
45 REPORTER_ASSERT(reporter, in1 == list.isInList(&elements[1]));
46 REPORTER_ASSERT(reporter, in2 == list.isInList(&elements[2]));
47 REPORTER_ASSERT(reporter, in3 == list.isInList(&elements[3]));
53 ListElement elements[4] = { local
61 check_list(list, reporter, true, 0, false, false, false, false, elements);
63 list.addToHead(&elements[0]);
65 check_list(list, reporter, false, 1, true, false, false, false, elements);
67 list.addToHead(&elements[1])
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| BiMapCollectionTest.java | 42 @Override protected Set<String> create(String[] elements) {
44 for (int i = 0; i < elements.length; i++) {
45 bimap.put(elements[i], i);
57 @Override protected Set<String> create(String[] elements) {
59 for (int i = 0; i < elements.length; i++) {
60 bimap.put(i, elements[i]);
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| RewriteRuleNodeStream.java | 52 List elements)
54 super(adaptor, elementDescription, elements);
|
| /external/chromium_org/ppapi/shared_impl/ |
| array_var.h | 40 const ElementVector& elements() const { function in class:ppapi::ArrayVar
44 ElementVector& elements() { function in class:ppapi::ArrayVar
|
| /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/d3d1x/d3d1xshader/src/ |
| dxbc_parse.cpp | 77 param.SemanticName = (char*)&sig->count + bswap_le32(sig->elements[i].name_offset);
78 param.SemanticIndex = bswap_le32(sig->elements[i].semantic_index);
79 param.SystemValueType = (D3D_NAME)bswap_le32(sig->elements[i].system_value_type);
80 param.ComponentType = (D3D_REGISTER_COMPONENT_TYPE)bswap_le32(sig->elements[i].component_type);
81 param.Register = bswap_le32(sig->elements[i].register_num);
82 param.Mask = sig->elements[i].mask;
83 param.ReadWriteMask = sig->elements[i].read_write_mask;
84 param.Stream = sig->elements[i].stream;
|
| /external/guava/guava/src/com/google/common/collect/ |
| ImmutableSortedSet.java | 39 * An immutable {@code SortedSet} that stores its elements in a sorted array.
41 * natural sort ordering of their elements. Either way, null elements are not
61 * two elements are equivalent. Instead, with an explicit comparator, the
62 * following relation determines whether elements {@code x} and {@code y} are
67 * With natural ordering of elements, the following relation determines whether
68 * two elements are equivalent: <pre> {@code
129 * Returns an immutable sorted set containing the given elements sorted by
130 * their natural ordering. When multiple elements are equivalent according to
142 * Returns an immutable sorted set containing the given elements sorted b
675 final Object[] elements; field in class:ImmutableSortedSet.SerializedForm
[all...] |
