Home
last modified time | relevance | path

Searched refs:Pair (Results 1 – 25 of 88) sorted by relevance

1234

/external/chromium/base/
Dstl_util-inl.h342 template<typename Pair, typename UnaryOp>
344 : public std::unary_function<Pair, typename UnaryOp::result_type> {
352 typename UnaryOp::result_type operator()(const Pair& p) const { in operator()
360 template<typename Pair, typename UnaryOp>
361 UnaryOperateOnFirst<Pair, UnaryOp> UnaryOperate1st(const UnaryOp& f) { in UnaryOperate1st()
362 return UnaryOperateOnFirst<Pair, UnaryOp>(f); in UnaryOperate1st()
365 template<typename Pair, typename UnaryOp>
367 : public std::unary_function<Pair, typename UnaryOp::result_type> {
375 typename UnaryOp::result_type operator()(const Pair& p) const { in operator()
383 template<typename Pair, typename UnaryOp>
[all …]
/external/webkit/Source/WebCore/css/
DPair.h34 class Pair : public RefCounted<Pair> {
36 static PassRefPtr<Pair> create() in create()
38 return adoptRef(new Pair); in create()
40 …static PassRefPtr<Pair> create(PassRefPtr<CSSPrimitiveValue> first, PassRefPtr<CSSPrimitiveValue> … in create()
42 return adoptRef(new Pair(first, second)); in create()
44 virtual ~Pair() { } in ~Pair()
53 Pair() : m_first(0), m_second(0) { } in Pair() function
54 Pair(PassRefPtr<CSSPrimitiveValue> first, PassRefPtr<CSSPrimitiveValue> second) in Pair() function
DCSSPrimitiveValue.h34 class Pair; variable
178 Pair* getPairValue(ExceptionCode&) const;
179 Pair* getPairValue() const { return m_type != CSS_PAIR ? 0 : m_value.pair; } in getPairValue()
220 void init(PassRefPtr<Pair>);
237 Pair* pair;
/external/skia/src/core/
DSkPtrRecorder.cpp12 Pair* p = fList.begin(); in reset()
13 Pair* stop = fList.end(); in reset()
21 int SkPtrSet::Cmp(const Pair& a, const Pair& b) { in Cmp()
31 Pair pair; in find()
34 int index = SkTSearch<Pair>(fList.begin(), count, pair, sizeof(pair), &Cmp); in find()
47 Pair pair; in add()
50 int index = SkTSearch<Pair>(fList.begin(), count, pair, sizeof(pair), &Cmp); in add()
66 const Pair* p = fList.begin(); in copyToArray()
DSkPixelRef.cpp160 struct Pair { struct
166 static Pair gPairs[MAX_PAIR_COUNT]; argument
199 const Pair* pairs = gPairs; in NameToFactory()
212 const Pair* pairs = gPairs; in FactoryToName()
/external/skia/include/core/
DSkTDict.h47 Pair* pair = fArray.insert(~index); in set()
87 Pair* end = fArray.end(); in findKey()
88 for (Pair* pair = fArray.begin(); pair < end; pair++) { in findKey()
98 struct Pair { struct
102 friend int operator<(const Pair& a, const Pair& b) argument
106 friend int operator!=(const Pair& a, const Pair& b)
134 Pair* fIter;
135 Pair* fStop;
139 SkTDArray<Pair> fArray;
155 index = SkStrSearch(&fArray.begin()->fName, count, name, len, sizeof(Pair)); in find_index()
DSkPtrRecorder.h63 struct Pair { struct
72 SkTDArray<Pair> fList; argument
74 static int Cmp(const Pair& a, const Pair& b);
/external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/utils/
DPair.java21 public final class Pair<L, R> { class
30 public Pair(L left, R right) { in Pair() method in Pair
45 if (!(o instanceof Pair<?, ?>)) { in equals()
48 Pair<?, ?> other = (Pair<?, ?>) o; in equals()
78 public static <L, R> Pair<L, R> create(L left, R right) { in create()
79 return new Pair<L, R>(left, right); in create()
/external/clang/test/Index/
Dindex-templates.cpp76 struct Pair { struct
85 Pair<T, U> p = { t, second_type(u) }; in init_list() argument
92 typename Comparison = compare<Pair<Key, Value> >,
93 typename Allocator = allocator<Pair<Key, Value> > >
96 void f(map<Z4, Pair<int, Z4> >);
98 template class Pair<int, int>; variable
101 struct SuperPair : Pair<int, int>, Pair<T, U> { };
Dload-stmts.cpp73 struct Pair { struct
74 Pair(int, int);
80 new (mem) Pair(i, j); in test_more_exprs()
/external/chromium/chrome/common/deprecated/
Devent_sys_unittest.cc20 class Pair;
23 Pair* source;
37 class Pair { class
40 explicit Pair(const std::string& name) : name_(name), a_(0), b_(0) { in Pair() function in __anondafb35020111::Pair
44 ~Pair() { in ~Pair()
77 void Hookup(const std::string name, Pair::Channel* channel) { in Hookup()
121 Pair sally("Sally"), sam("Sam"); in TEST()
145 explicit ThreadTester(Pair* pair) in ThreadTester()
227 Pair* pair_;
238 Pair sally("Sally"); in TEST()
[all …]
/external/v8/test/mjsunit/
Dindexed-accessors.js44 function Pair(x, y) { class
48 Pair.prototype.__defineGetter__('0', function() { return this.x; });
49 Pair.prototype.__defineGetter__('1', function() { return this.y; });
50 Pair.prototype.__defineSetter__('0', function(x) { this.x = x; });
51 Pair.prototype.__defineSetter__('1', function(y) { this.y = y; });
53 var p = new Pair(2, 3);
/external/javassist/src/main/javassist/bytecode/annotation/
DAnnotation.java48 static class Pair { class in Annotation
181 Pair p = new Pair(); in addMemberValue()
194 Pair p = new Pair(); in addMemberValue()
203 private void addMemberValue(Pair pair) { in addMemberValue()
272 Pair p = (Pair)members.get(name); in getMemberValue()
315 Pair pair = (Pair)it.next(); in write()
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/
DAbstractSampleEncryptionBox.java70 e.pairs = new LinkedList<Entry.Pair>(); in _parseDetails()
163 for (Entry.Pair pair : entry.pairs) { in getContent()
196 public List<Pair> pairs = new LinkedList<Pair>();
209 for (Entry.Pair pair : pairs) { in getSize()
216 public Pair createPair(int clear, long encrypted) { in createPair()
217 return new Pair(clear, encrypted); in createPair()
221 public class Pair { class in AbstractSampleEncryptionBox.Entry
225 public Pair(int clear, long encrypted) { in Pair() method in AbstractSampleEncryptionBox.Entry.Pair
239 Pair pair = (Pair) o; in equals()
/external/llvm/include/llvm/ADT/
DDenseMapInfo.h135 typedef std::pair<T, U> Pair;
139 static inline Pair getEmptyKey() {
143 static inline Pair getTombstoneKey() {
147 static unsigned getHashValue(const Pair& PairVal) {
160 static bool isEqual(const Pair &LHS, const Pair &RHS) {
/external/llvm/lib/AsmParser/
DLLLexer.cpp84 uint64_t Pair[2]) { in HexToIntPair()
85 Pair[0] = 0; in HexToIntPair()
88 Pair[0] *= 16; in HexToIntPair()
89 Pair[0] += parseHexChar(*Buffer); in HexToIntPair()
91 Pair[1] = 0; in HexToIntPair()
93 Pair[1] *= 16; in HexToIntPair()
94 Pair[1] += parseHexChar(*Buffer); in HexToIntPair()
103 uint64_t Pair[2]) { in FP80HexToIntPair()
104 Pair[1] = 0; in FP80HexToIntPair()
107 Pair[1] *= 16; in FP80HexToIntPair()
[all …]
/external/smali/dexlib/src/main/java/org/jf/dexlib/Util/
DTryListBuilder.java136 public Pair<List<CodeItem.TryItem>, List<CodeItem.EncodedCatchHandler>> encodeTries() { in encodeTries()
138 return new Pair<List<CodeItem.TryItem>, List<CodeItem.EncodedCatchHandler>>(null, null); in encodeTries()
181 … return new Pair<List<CodeItem.TryItem>, List<CodeItem.EncodedCatchHandler>>(tries, handlers); in encodeTries()
188 Pair<TryRange, TryRange> ranges = getBoundingRanges(startAddress, endAddress); in addCatchAllHandler()
217 public Pair<TryRange, TryRange> getBoundingRanges(int startAddress, int endAddress) { in getBoundingRanges()
245 return new Pair<TryRange, TryRange>(startRange, startRange); in getBoundingRanges()
269 return new Pair<TryRange, TryRange>(startRange, startRange); in getBoundingRanges()
312 return new Pair<TryRange, TryRange>(startRange, endRange); in getBoundingRanges()
321 Pair<TryRange, TryRange> ranges = getBoundingRanges(startAddress, endAddress); in addHandler()
DPair.java31 public class Pair<A, B> { class
35 public Pair(A first, B second) { in Pair() method in Pair
/external/srec/tools/thirdparty/OpenFst/fst/lib/
Dshortest-path.h171 typedef pair<StateId, Weight> Pair; typedef
173 ShortestPathCompare(const vector<Pair>& pairs, in ShortestPathCompare()
179 const Pair &px = pairs_[x]; in operator()
180 const Pair &py = pairs_[y]; in operator()
196 const vector<Pair> &pairs_;
233 typedef pair<StateId, Weight> Pair; in ShortestPath() typedef
273 vector<Pair> pairs; in ShortestPath()
289 pairs.push_back(Pair(kNoStateId, Weight::Zero())); in ShortestPath()
290 pairs[final] = Pair(rfst.Start(), Weight::One()); in ShortestPath()
296 Pair p = pairs[state]; in ShortestPath()
[all …]
/external/skia/src/effects/
DSkPorterDuff.cpp21 static const struct Pair { struct
48 const Pair* pairs = gPairs; in find_pdmode()
62 const Pair& pair = gPairs[mode]; in ToXfermodeMode()
68 const Pair& pair = gPairs[mode]; in CreateXfermode()
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/
DAntlr.Runtime.Tools.Tests.pas537 Pair: TPair<String, Integer>;
545 for Pair in FIDictionary do
547 if (Pair.Key = 'Foo') then
550 CheckEquals(Pair.Value, 1);
553 if (Pair.Key = 'Bar') then
556 CheckEquals(Pair.Value, 3);
559 if (Pair.Key = 'Baz') then
562 CheckEquals(Pair.Value, 7);
565 if (Pair.Key = 'Zip') then
568 CheckEquals(Pair.Value, 7);
/external/openfst/src/include/fst/
Dshortest-path.h212 typedef pair<StateId, Weight> Pair; typedef
214 ShortestPathCompare(const vector<Pair>& pairs, in ShortestPathCompare()
220 const Pair &px = pairs_[x]; in operator()
221 const Pair &py = pairs_[y]; in operator()
241 const vector<Pair> &pairs_;
285 typedef pair<StateId, Weight> Pair; typedef
304 vector<Pair> pairs;
329 pairs.push_back(Pair(kNoStateId, Weight::Zero()));
330 pairs[final] = Pair(ifst.Start(), Weight::One());
337 Pair p = pairs[state];
[all …]
Dsparse-tuple-weight.h62 typedef pair<K, W> Pair; typedef
190 inline void Push(const Pair &p, bool default_value_check = true) {
218 Pair first_;
219 list<Pair> rest_;
228 typedef typename SparseTupleWeight<W, K>::Pair Pair; typedef
229 typedef typename list<Pair>::const_iterator const_iterator;
230 typedef typename list<Pair>::iterator iterator;
243 const Pair& Value() const { return init_ ? first_ : *iter_; } in Value()
258 const Pair &first_;
259 const list<Pair> & rest_;
[all …]
/external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/model/property/editor/presentation/
DButtonPropertyEditorPresentationImpl.java23 import org.eclipse.wb.internal.core.utils.Pair;
210 private final Map<Pair<PropertyTable, Property>, Control> m_map = Maps.newHashMap();
213 m_map.put(Pair.create(propertyTable, property), control); in put()
217 return m_map.remove(Pair.create(propertyTable, property)); in remove()
221 return m_map.get(Pair.create(propertyTable, property)); in get()
/external/llvm/lib/Transforms/IPO/
DConstantMerge.cpp153 PointerIntPair<Constant*, 1, bool> Pair(Init, hasKnownAlignment(GV)); in runOnModule() local
154 GlobalVariable *&Slot = CMap[Pair]; in runOnModule()
185 PointerIntPair<Constant*, 1, bool> Pair(Init, hasKnownAlignment(GV)); in runOnModule() local
186 GlobalVariable *Slot = CMap[Pair]; in runOnModule()

1234