HomeSort by relevance Sort by last modified time
    Searched refs:comp (Results 26 - 50 of 355) sorted by null

12 3 4 5 6 7 8 91011>>

  /frameworks/av/media/libstagefright/codecs/m4v_h263/enc/src/
findhalfpel.cpp 187 Int k, comp; local
207 for (comp = 0; comp < 4; comp++)
215 imin = xpos + ((comp & 1) << 3) + (mot[comp+1].x >> 1);
216 jmin = ypos + ((comp & 2) << 2) + (mot[comp+1].y >> 1);
217 ilow = xpos + ((comp & 1) << 3) - range;
218 jlow = ypos + ((comp & 2) << 2) - range
    [all...]
  /external/opencv/cv/src/
cvcamshift.cpp 62 CvTermCriteria criteria, CvConnectedComp* comp )
72 if( comp )
73 comp->rect = windowIn;
136 if( comp )
138 comp->rect = cur_rect;
139 comp->area = (float)moments.m00;
179 CvConnectedComp comp; local
184 comp.rect = windowIn;
190 CV_CALL( itersUsed = cvMeanShift( mat, windowIn, criteria, &comp ));
191 windowIn = comp.rect
    [all...]
  /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;
AnnotationEncodedSubValue.java 119 int comp = annotationType.compareTo(other.annotationType); local
120 if (comp != 0) {
121 return comp;
124 comp = names.length - other.names.length;
125 if (comp != 0) {
126 return comp;
130 comp = names[i].compareTo(other.names[i]);
131 if (comp != 0) {
132 return comp;
135 comp = values[i].compareTo(other.values[i])
    [all...]
  /external/jdiff/src/jdiff/
Modifiers.java 46 int comp = visibility.compareTo(oModifiers.visibility); local
47 if (comp != 0)
48 return comp;
92 int comp = visibility.compareTo(newModifiers.visibility); local
93 if (comp != 0) {
DiffOutput.java 45 int comp = pkgName_.compareTo(oDiffOutput.pkgName_); local
46 if (comp != 0)
47 return comp;
  /external/ppp/pppd/include/net/
vjcompress.h 133 extern void vj_compress_init __P((struct vjcompress *comp, int max_state));
135 struct vjcompress *comp, int compress_cid_flag,
137 extern void vj_uncompress_err __P((struct vjcompress *comp));
139 struct vjcompress *comp));
141 struct vjcompress *comp, u_char **hdrp,
  /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/
idct.h 59 void idctrow0_intra(int16 *blk, PIXEL *comp, int width);
60 void idctrow1_intra(int16 *blk, PIXEL *comp, int width);
61 void idctrow2_intra(int16 *blk, PIXEL *comp, int width);
62 void idctrow3_intra(int16 *blk, PIXEL *comp, int width);
63 void idctrow4_intra(int16 *blk, PIXEL *comp, int width);
datapart_decode.cpp 525 int comp; local
552 for (comp = 0; comp < 6; comp++)
554 status = PV_DecodePredictedIntraDC(comp, stream, (*DC + comp)); /* 03/01/01 */
560 for (comp = 0; comp < 6; comp++)
562 (*DC)[comp] = 0; /* 04/26/01 needed for switched case*
581 int comp; local
633 int comp; local
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
set_operations.h 74 symmetric_difference_func(Comparator c) : comp(c) {}
76 Comparator comp; member in struct:__gnu_parallel::symmetric_difference_func
85 if (comp(*a, *c))
91 else if (comp(*c, *a))
114 if (comp(*a, *c))
119 else if (comp(*c, *a))
153 difference_func(Comparator c) : comp(c) {}
155 Comparator comp; member in struct:__gnu_parallel::difference_func
163 if (comp(*a, *c))
169 else if (comp(*c, *a)
223 Comparator comp; member in struct:__gnu_parallel::intersection_func
287 Comparator comp; member in struct:__gnu_parallel::union_func
    [all...]
checkers.h 42 * @brief Check whether @c [begin, @c end) is sorted according to @c comp.
45 * @param comp Comparator.
52 Comparator comp
64 if (comp(*current, *recent))
78 * @brief Check whether @c [begin, @c end) is sorted according to @c comp.
83 * @param comp Comparator.
91 Comparator comp
103 if (comp(*current, *recent))
119 * @brief Check whether @c [begin, @c end) is sorted according to @c comp.
123 * @param comp Comparator
    [all...]
balanced_quicksort.h 94 * @param comp Comparator.
101 Comparator comp, thread_index_t num_threads)
111 end - 1, comp);
118 (!comp(*pivot_pos, *begin) && !comp(*(begin + n / 2), *pivot_pos))
119 || (!comp(*pivot_pos, *begin) && !comp(*(end - 1), *pivot_pos))
120 || (!comp(*pivot_pos, *(begin + n / 2)) && !comp(*begin, *pivot_pos))
121 || (!comp(*pivot_pos, *(begin + n / 2)) && !comp(*(end - 1), *pivot_pos)
    [all...]
merge.h 51 * @param comp Comparator.
61 _DifferenceTp max_length, Comparator comp)
67 if (comp(*begin2, *begin1))
100 * @param comp Comparator.
111 _DifferenceTp max_length, Comparator comp)
130 if (comp(element2, element1))
168 * @param comp Comparator.
177 Comparator comp)
182 max_length, comp);
193 * @param comp Comparator
    [all...]
quicksort.h 43 * @param comp Comparator.
53 Comparator comp, typename std::iterator_traits
78 __gnu_sequential::sort(samples, samples + num_samples, comp);
83 pred(comp, pivot);
95 * @param comp Comparator.
103 Comparator comp,
112 __gnu_sequential::sort(begin, end, comp);
131 parallel_sort_qs_divide(begin, end, comp, pivot_rank,
139 comp, num_threads_left);
142 comp, num_threads - num_threads_left)
    [all...]
  /external/webkit/Source/WebCore/platform/graphics/wince/
FontWinCE.cpp 221 const TextRunComponent& comp = components.at(i); local
222 int len = comp.textLength();
224 if (curPos < to && from < curEnd && !comp.isSpace()) {
227 pt.setX(point.x() + w - comp.m_offset - comp.m_width);
229 pt.setX(point.x() + comp.m_offset);
230 drawSimpleText(context, comp.m_textRun, pt, from - curPos, std::min(to, curEnd) - curPos);
265 const TextRunComponent& comp = components.at(i); local
266 int xe = w - comp.m_offset;
267 int xs = xe - comp.m_width
277 const TextRunComponent& comp = components.at(i); local
298 const TextRunComponent& comp = components.at(i); local
    [all...]
  /external/stlport/stlport/stl/
_queue.h 168 _Compare comp; member in class:priority_queue
171 explicit priority_queue(const _Compare& __x) : c(), comp(__x) {}
173 : c(__s), comp(__x)
174 { make_heap(c.begin(), c.end(), comp); }
179 comp(_STLP_PRIV _AsMoveSource(src.get().comp)) {}
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
190 : c(__first, __last), comp(__x)
191 { make_heap(c.begin(), c.end(), comp); }
196 : c(__s), comp(__x
262 #undef comp macro
    [all...]
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_queue.h 168 _Compare comp; member in class:priority_queue
171 explicit priority_queue(const _Compare& __x) : c(), comp(__x) {}
173 : c(__s), comp(__x)
174 { make_heap(c.begin(), c.end(), comp); }
179 comp(_STLP_PRIV _AsMoveSource(src.get().comp)) {}
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
190 : c(__first, __last), comp(__x)
191 { make_heap(c.begin(), c.end(), comp); }
196 : c(__s), comp(__x
262 #undef comp macro
    [all...]
  /prebuilts/ndk/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/
_queue.h 168 _Compare comp; member in class:priority_queue
171 explicit priority_queue(const _Compare& __x) : c(), comp(__x) {}
173 : c(__s), comp(__x)
174 { make_heap(c.begin(), c.end(), comp); }
179 comp(_STLP_PRIV _AsMoveSource(src.get().comp)) {}
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
190 : c(__first, __last), comp(__x)
191 { make_heap(c.begin(), c.end(), comp); }
196 : c(__s), comp(__x
262 #undef comp macro
    [all...]
  /prebuilts/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/
_queue.h 168 _Compare comp; member in class:priority_queue
171 explicit priority_queue(const _Compare& __x) : c(), comp(__x) {}
173 : c(__s), comp(__x)
174 { make_heap(c.begin(), c.end(), comp); }
179 comp(_STLP_PRIV _AsMoveSource(src.get().comp)) {}
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
190 : c(__first, __last), comp(__x)
191 { make_heap(c.begin(), c.end(), comp); }
196 : c(__s), comp(__x
262 #undef comp macro
    [all...]
  /prebuilts/ndk/android-ndk-r7/sources/cxx-stl/stlport/stlport/stl/
_queue.h 168 _Compare comp; member in class:priority_queue
171 explicit priority_queue(const _Compare& __x) : c(), comp(__x) {}
173 : c(__s), comp(__x)
174 { make_heap(c.begin(), c.end(), comp); }
179 comp(_STLP_PRIV _AsMoveSource(src.get().comp)) {}
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
190 : c(__first, __last), comp(__x)
191 { make_heap(c.begin(), c.end(), comp); }
196 : c(__s), comp(__x
262 #undef comp macro
    [all...]
  /external/libxslt/libxslt/
variables.c 525 cur->comp = elem->comp;
703 if (cur->comp != NULL) {
704 if (cur->comp->type == XSLT_FUNC_WITHPARAM)
706 else if (cur->comp->type == XSLT_FUNC_PARAM)
787 * @comp: the compiled XSLT instruction
798 xsltStyleItemVariablePtr comp = local
801 xsltStylePreCompPtr comp = castedComp;
829 if ((comp != NULL) && (comp->comp != NULL))
1025 xsltStyleBasicItemVariablePtr comp; local
1027 xsltStylePreCompPtr comp; local
1726 xsltStyleBasicItemVariablePtr comp = local
1774 xsltStyleBasicItemVariablePtr comp = local
1921 xsltStyleBasicItemVariablePtr comp; local
1983 xsltStyleItemVariablePtr comp; local
2045 xsltStyleItemParamPtr comp; local
2108 xsltStyleItemVariablePtr comp; local
2150 xsltStyleItemParamPtr comp; local
    [all...]
pattern.c 90 xmlXPathCompExprPtr comp; member in struct:_xsltStepOp
126 xsltCompMatchPtr comp; /* the result */ member in struct:_xsltParserContext
171 * @comp: an XSLT comp
173 * Free up the memory allocated by @comp
176 xsltFreeCompMatch(xsltCompMatchPtr comp) {
180 if (comp == NULL)
182 if (comp->pattern != NULL)
183 xmlFree((xmlChar *)comp->pattern);
184 if (comp->nsList != NULL
230 xsltCompMatchPtr comp = payload; local
    [all...]
transform.h 94 xsltStylePreCompPtr comp);
99 xsltStylePreCompPtr comp);
104 xsltStylePreCompPtr comp);
109 xsltStylePreCompPtr comp);
114 xsltStylePreCompPtr comp);
119 xsltStylePreCompPtr comp);
124 xsltStylePreCompPtr comp);
129 xsltStylePreCompPtr comp);
134 xsltStylePreCompPtr comp);
139 xsltStylePreCompPtr comp);
    [all...]
  /external/compiler-rt/BlocksRuntime/tests/
rettypepromotion.c 25 void sortWithBlock(long (^comp)(void *arg1, void *arg2)) {
  /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;

Completed in 313 milliseconds

12 3 4 5 6 7 8 91011>>