HomeSort by relevance Sort by last modified time
    Searched full:positions (Results 201 - 225 of 701) sorted by null

1 2 3 4 5 6 7 891011>>

  /external/chromium/third_party/icu/public/i18n/unicode/
usearch.h 67 * there are some dangerous positions which the search may render incorrect
260 * Search positions that may render incorrect results are highlighted in the
534 * Search positions that may render incorrect results are highlighted in the
576 * Search positions that may render incorrect results are highlighted in the
658 * Characters at the start or end positions of a match that are ignorable
718 * Characters at the start or end positions of a match that are ignorable
    [all...]
  /external/icu4c/i18n/unicode/
usearch.h 68 * there are some dangerous positions which the search may render incorrect
323 * Search positions that may render incorrect results are highlighted in the
597 * Search positions that may render incorrect results are highlighted in the
639 * Search positions that may render incorrect results are highlighted in the
721 * Characters at the start or end positions of a match that are ignorable
    [all...]
  /external/webkit/WebCore/editing/
DeleteSelectionCommand.cpp 229 // positions based on this change.
239 // positions based on this change.
247 // We must pass the positions through rangeCompliantEquivalent, since some editing positions
250 // like the one below, since editing functions should obviously accept editing positions.
271 // two positions will be identical). Therefore there is no need to save the
    [all...]
VisibleSelection.h 117 // We need to store these as Positions because VisibleSelection is
  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/
valarray 470 * in shifted positions. For an element with index i, the new position
478 * @param n Number of element positions to shift.
479 * @return New valarray with elements in shifted positions.
487 * in shifted positions. For an element with index i, the new position
495 * @param n Number of element positions to rotate.
496 * @return New valarray with elements in shifted positions.
    [all...]
  /external/icu4c/extra/uconv/
uconv.1.in 425 error positions may be at a later offset in the input stream than
429 The reporting of error positions when a transliterator is used may be
  /external/neven/Embedded/common/src/b_BitFeatureEm/
ScanDetector.h 157 /** Scans over image returns number of detected positions
165 * All positions are sorted by descending confidence
  /external/neven/Embedded/common/src/b_ImageEm/
UInt16ByteImage.h 140 /** applies affine linear warping to pixels positions of imageA before copying the into *ptrA */
151 /** applies affine linear warping to pixels positions of ptrA before copying the into *ptrA.
  /external/webkit/WebCore/rendering/
RenderLineBoxList.cpp 177 // based off positions of our first line box or our last line box.
238 // based off positions of our first line box or our last line box.
  /frameworks/base/media/libstagefright/codecs/amrnb/enc/src/
c2_11pf.cpp 75 * Pulse i0 can have 2x8=16 possible positions, pulse i1 can have
76 * 4x8=32 positions.
181 Pulse i0 can have 2x8=16 possible positions, pulse i1 can have
182 4x8=32 positions.
364 Search the best codevector; determine positions of the 2 pulses
456 * i0 loop: try 8 positions. *
466 * i1 loop: 8 positions. *
577 codevector, based on the signs and positions of 2 pulses.
  /dalvik/dx/src/com/android/dx/dex/code/
PositionList.java 56 * @return {@code non-null;} the positions list
  /external/bison/data/
location.cc 26 b4_copyright([Positions for Bison parsers in C++],
  /external/chromium/third_party/icu/source/common/
bmpset.h 107 * correspond to the same bit positions in consecutive table words.
  /external/chromium/third_party/icu/source/test/cintltst/
cbiapts.c 144 because it would throw off the hard coded break positions in the following
368 because it would throw off the hard coded break positions in the following
536 char breaks[] = "** ** * ** *"; /* * the expected break positions */
537 char tags[] = "01 21 6 21 2"; /* expected tag values at break positions */
  /external/icu4c/common/
bmpset.h 107 * correspond to the same bit positions in consecutive table words.
  /external/icu4c/test/cintltst/
cbiapts.c 146 because it would throw off the hard coded break positions in the following
370 because it would throw off the hard coded break positions in the following
538 char breaks[] = "** ** * ** *"; /* * the expected break positions */
539 char tags[] = "01 21 6 21 2"; /* expected tag values at break positions */
  /external/libvpx/vp8/common/arm/
filter_arm.c 23 { 0, 0, 128, 0, 0, 0 }, /* note that 1/8 pel positions are just as per alpha -0.5 bicubic */
  /external/qemu/distrib/sdl-1.2.12/include/
SDL_joystick.h 126 * The return value is one of the following positions:
  /external/sqlite/android/
PhonebookIndex.cpp 94 int m = ((to + from) >> 1) & ~0x1; // Only consider even positions
  /external/svox/pico/lib/
picotrns.c 443 reference positions in 'inSeq'. '*transductionState' must have been
445 The output is returned in 'outSeqLen' symbols and reference positions in 'outSeq'.
446 The output reference positions refer to the corresponding input reference positions.
  /external/webkit/JavaScriptCore/tests/mozilla/ecma/String/
15.5.4.6-1.js 27 more positions that are at or to the right of the
15.5.4.7-3.js 28 converting this object to a string, at one or more positions that are
  /external/webkit/WebCore/icu/unicode/
usearch.h 67 * there are some dangerous positions which the search may render incorrect
257 * Search positions that may render incorrect results are highlighted in the
531 * Search positions that may render incorrect results are highlighted in the
573 * Search positions that may render incorrect results are highlighted in the
  /external/webkit/WebCore/platform/text/gtk/
TextBreakIteratorGtk.cpp 133 // So we should advance or traverse back based on bi->m_logAttrs cursor positions.
  /frameworks/base/media/java/android/media/
FaceDetector.java 70 * the X, Y or Z axis (the positions in 3-dimensional Euclidean space).

Completed in 2110 milliseconds

1 2 3 4 5 6 7 891011>>