HomeSort by relevance Sort by last modified time
    Searched refs:sized (Results 1 - 11 of 11) sorted by null

  /libcore/luni/src/main/native/
java_text_Bidi.cpp 97 UBiDi* sized = ubidi_openSized(limit - start, 0, &status); local
101 UniquePtr<BiDiData> lineData(new BiDiData(sized));
  /external/ceres-solver/docs/
curvefitting.tex 33 Assuming the observations are in a $2n$ sized array called \texttt{data}, the problem construction is a simple matter of creating a \texttt{CostFunction} for every observation.
  /external/libvorbis/doc/
01-introduction.tex 354 This is easy to visualize in the case of equal sized-windows:
358 \captionof{figure}{overlap of two equal-sized windows}
361 And slightly more complex in the case of overlapping unequal sized
369 In the unequal-sized window case, the window shape of the long window
512 of the current window. In the case of same-sized windows, the amount
08-residue.tex 38 \item Each vector is partitioned into multiple equal sized chunks
04-codec.tex 585 the case of same-sized windows, the amount of data to return is
  /external/oprofile/events/x86-64/family10/
unit_masks 224 0x08 32 Bytes Sized Writes
225 0x10 64 Bytes Sized Writes
226 0x20 32 Bytes Sized Reads
227 0x40 64 Byte Sized Reads
322 0x01 Read sized
323 0x02 Write sized
  /external/chromium/chrome/browser/resources/keyboard/
main.js 103 * @param {string} mode The mode to be sized.
  /external/v8/tools/
tickprocessor.js 568 // creating zero-sized entries, skip such duplicates.
  /external/dropbear/libtomcrypt/
crypt.tex 411 allocation, and allows you to allocate a fixed sized buffer for storing scheduled keys. All ciphers must provide six visible
    [all...]
  /external/v8/test/mjsunit/
unicode-test.js     [all...]
  /external/dropbear/libtommath/
bn.tex     [all...]

Completed in 723 milliseconds