HomeSort by relevance Sort by last modified time
    Searched full:comp (Results 101 - 125 of 1256) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/smali/dexlib/src/main/java/org/jf/dexlib/
AnnotationSetRefList.java 116 int comp = annotationSets.length - o.annotationSets.length; local
117 if (comp != 0) {
118 return comp;
122 comp = annotationSets[i].compareTo(o.annotationSets[i]);
123 if (comp != 0) {
124 return comp;
128 return comp;
  /external/smali/dexlib/src/main/java/org/jf/dexlib/EncodedValue/
ArrayEncodedSubValue.java 102 int comp = values.length - other.values.length; local
103 if (comp != 0) {
104 return comp;
108 comp = values[i].compareTo(other.values[i]);
109 if (comp != 0) {
110 return comp;
114 return comp;
EncodedValue.java 94 int comp = getValueType().compareTo(o.getValueType()); local
95 if (comp == 0) {
96 comp = compareValue(o);
98 return comp;
  /hardware/qcom/display/msm8960/libhwcomposer/
hwc_mdpcomp.h 42 /*sets up mdp comp for the current frame */
52 /* Initialize MDP comp*/
139 /* checks if full MDP comp can be done */
141 /* check if we can use layer cache to do at least partial MDP comp */
154 /* checks for mdp comp dimension limitation */
158 /* optimize layers for mdp comp*/
160 /* gets available pipes for mdp comp */
  /hardware/qcom/display/msm8x26/libhwcomposer/
hwc_mdpcomp.h 42 /*sets up mdp comp for the current frame */
52 /* Initialize MDP comp*/
139 /* checks if full MDP comp can be done */
141 /* check if we can use layer cache to do at least partial MDP comp */
154 /* checks for mdp comp dimension limitation */
158 /* optimize layers for mdp comp*/
160 /* gets available pipes for mdp comp */
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
losertree.h 80 Comparator comp; member in class:__gnu_parallel::LoserTreeBase
97 : comp(_comp)
190 && !comp(losers[right].key, losers[left].key)))
228 && ((comp(losers[pos].key, key))
229 || (!comp(key, losers[pos].key)
285 && !comp(losers[right].key, losers[left].key)))
323 if (sup || (!losers[pos].sup && comp(losers[pos].key, key)))
356 Comparator comp; member in class:__gnu_parallel::LoserTreePointerBase
360 : comp(_comp)
417 || (!losers[left].sup && !comp(*losers[right].keyp
565 Comparator comp; member in class:__gnu_parallel::LoserTreeUnguardedBase
800 Comparator comp; member in class:__gnu_parallel::LoserTreePointerUnguardedBase
    [all...]
algo.h 153 comp(__gnu_parallel::equal_to<value_type, const T&>(), val);
154 return __gnu_parallel::find_template(begin, end, begin, comp,
224 BinaryPredicate comp, __gnu_parallel::sequential_tag)
225 { return _GLIBCXX_STD_P::find_first_of(begin1, end1, begin2, end2, comp); }
244 BinaryPredicate comp, random_access_iterator_tag,
248 find_template(begin1, end1, begin1, comp,
260 BinaryPredicate comp, IteratorTag1, IteratorTag2)
261 { return find_first_of(begin1, end1, begin2, end2, comp,
270 BinaryPredicate comp)
277 return find_first_of_switch(begin1, end1, begin2, end2, comp,
    [all...]
base.h 162 Comparator& comp; member in class:__gnu_parallel::equal_from_less
165 equal_from_less(Comparator& _comp) : comp(_comp) { }
169 return !comp(a, b) && !comp(b, a);
435 according to @c comp.
439 * @param comp Comparator.
444 RandomAccessIterator c, Comparator& comp)
446 if (comp(*a, *b))
447 if (comp(*b, *c))
450 if (comp(*a, *c)
    [all...]
for_each_selectors.h 307 template<typename Comp, typename It>
310 Comp& comp; member in struct:__gnu_parallel::min_element_reduct
313 min_element_reduct(Comp &c) : comp(c) { }
318 if (comp(*x, *y))
326 template<typename Comp, typename It>
329 Comp& comp; member in struct:__gnu_parallel::max_element_reduct
332 max_element_reduct(Comp& c) : comp(c) {
    [all...]
multiseq_selection.h 59 Comparator& comp; member in class:__gnu_parallel::lexicographic
62 lexicographic(Comparator& _comp) : comp(_comp) { }
68 if (comp(p1.first, p2.first))
71 if (comp(p2.first, p1.first))
84 Comparator& comp; member in class:__gnu_parallel::lexicographic_reverse
87 lexicographic_reverse(Comparator& _comp) : comp(_comp) { }
93 if (comp(p2.first, p1.first))
96 if (comp(p1.first, p2.first))
118 * @param comp The ordering functor, defaults to std::less<T>.
126 Comparator comp = std::less
    [all...]
  /hardware/ti/omap3/omx/audio/src/openmax_il/nbamr_enc/src/
libOMX.TI.AMR.encode.so 
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/algorithm/string/
finder.hpp 46 \param Comp An element comparison predicate
71 const RangeT& Search, PredicateT Comp )
77 PredicateT>( ::boost::as_literal(Search), Comp );
87 \param Comp An element comparison predicate
110 last_finder( const RangeT& Search, PredicateT Comp )
116 PredicateT>( ::boost::as_literal(Search), Comp ) ;
127 \param Comp An element comparison predicate
155 PredicateT Comp )
161 PredicateT>( ::boost::as_literal(Search), Nth, Comp );
  /external/libppp/src/
slcompress.c 84 sl_compress_init(struct slcompress *comp, int max_state)
87 register struct cstate *tstate = comp->tstate;
89 memset(comp, '\0', sizeof *comp);
96 comp->last_cs = &tstate[0];
97 comp->last_recv = 255;
98 comp->last_xmit = 255;
99 comp->flags = SLF_TOSS;
159 struct slcompress *comp,
163 register struct cstate *cs = comp->last_cs->cs_next
    [all...]
  /dalvik/vm/compiler/template/mips/
TEMPLATE_STRING_COMPARETO.S 5 * return negative if this's string is < comp, 0 if they are the
15 * a1: comp object pointer
31 * At this point, we have this/comp:
58 * a1: *comp string data
  /external/chromium_org/components/policy/core/common/
schema_map.cc 96 for (ComponentMap::const_iterator comp = components.begin();
97 comp != components.end(); ++comp) {
98 PolicyNamespace ns(domain->first, comp->first);
  /external/chromium_org/third_party/openssl/openssl/crypto/err/
openssl.ec 30 L COMP crypto/comp/comp.h crypto/comp/comp_err.c
  /external/compiler-rt/BlocksRuntime/tests/
rettypepromotion.c 25 void sortWithBlock(long (^comp)(void *arg1, void *arg2)) {
  /external/libpng/contrib/pngminus/
makevms.com 12 $ comp = "__decc__=1"
20 $ comp = "__gcc__=1"
23 $ comp = "__vaxc__=1"
28 $ comp = "__decc__=1"
  /external/openssl/crypto/err/
openssl.ec 30 L COMP crypto/comp/comp.h crypto/comp/comp_err.c
  /external/valgrind/main/drd/tests/
pth_barrier_race.c 9 * See also http://article.gmane.org/gmane.comp.debugging.valgrind/8945/match=pthread_barrier_wait
  /external/valgrind/main/memcheck/tests/x86/
bug152022.c 3 http://comments.gmane.org/gmane.comp.debugging.valgrind/7535
  /packages/apps/Gallery2/src/com/android/gallery3d/ingest/data/
MtpBitmapFetch.java 81 int comp = Math.max(h, w); local
83 while ((comp >> 1) >= maxSide) {
84 comp = comp >> 1;
  /external/chromium_org/third_party/openssl/openssl/crypto/stack/
stack.c 83 int (*old)(const void *,const void *)=sk->comp;
85 if (sk->comp != c)
87 sk->comp=c;
97 if ((ret=sk_new(sk->comp)) == NULL) goto err;
107 ret->comp=sk->comp;
131 ret->comp=c;
220 if (st->comp == NULL)
229 r=OBJ_bsearch_ex_(&data,st->data,st->num,sizeof(void *),st->comp,
318 /* same comment as in sk_find ... previously st->comp was declare
    [all...]
  /external/openssl/crypto/stack/
stack.c 83 int (*old)(const void *,const void *)=sk->comp;
85 if (sk->comp != c)
87 sk->comp=c;
97 if ((ret=sk_new(sk->comp)) == NULL) goto err;
107 ret->comp=sk->comp;
131 ret->comp=c;
220 if (st->comp == NULL)
229 r=OBJ_bsearch_ex_(&data,st->data,st->num,sizeof(void *),st->comp,
318 /* same comment as in sk_find ... previously st->comp was declare
    [all...]
  /external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/swingui/
AbstractInputEditor.java 46 protected JComponent comp; field in class:AbstractInputEditor
47 public JComponent getControl() { return comp; }

Completed in 620 milliseconds

1 2 3 45 6 7 8 91011>>