| /external/chromium/chrome/common/extensions/docs/examples/extensions/benchmark/jst/ |
| jstemplate.js | 18 * HTML templates. The template is edited in place. I.e. in order to
173 * formatted as "name1=value1&name2=value2&...", in the order defined by
324 * - pre-order function calls are downward edges (recursion into call).
325 * - post-order function calls are upward edges (return from call).
339 * A stack of queues of pre-order calls.
342 * ie. a flattened array of methods with 2 arguments, in reverse order
353 * be to maintain the queues in reverse order (popping off of the
526 // NOTE(mesch): Evaluation order is sometimes significant, e.g. when
666 // the order aligned with the DOM order, because the newly
[all...] |
| /external/chromium/chrome/common/extensions/docs/examples/extensions/irc/servlet/jstemplate/ |
| jstemplate.js | 18 * HTML templates. The template is edited in place. I.e. in order to
173 * formatted as "name1=value1&name2=value2&...", in the order defined by
324 * - pre-order function calls are downward edges (recursion into call).
325 * - post-order function calls are upward edges (return from call).
339 * A stack of queues of pre-order calls.
342 * ie. a flattened array of methods with 2 arguments, in reverse order
353 * be to maintain the queues in reverse order (popping off of the
526 // NOTE(mesch): Evaluation order is sometimes significant, e.g. when
666 // the order aligned with the DOM order, because the newl
[all...] |
| /external/chromium_org/chrome/common/extensions/docs/examples/extensions/benchmark/jst/ |
| jstemplate.js | 18 * HTML templates. The template is edited in place. I.e. in order to
173 * formatted as "name1=value1&name2=value2&...", in the order defined by
324 * - pre-order function calls are downward edges (recursion into call).
325 * - post-order function calls are upward edges (return from call).
339 * A stack of queues of pre-order calls.
342 * ie. a flattened array of methods with 2 arguments, in reverse order
353 * be to maintain the queues in reverse order (popping off of the
526 // NOTE(mesch): Evaluation order is sometimes significant, e.g. when
666 // the order aligned with the DOM order, because the newly
[all...] |
| /external/chromium_org/chrome/common/extensions/docs/examples/extensions/irc/servlet/jstemplate/ |
| jstemplate.js | 18 * HTML templates. The template is edited in place. I.e. in order to
173 * formatted as "name1=value1&name2=value2&...", in the order defined by
324 * - pre-order function calls are downward edges (recursion into call).
325 * - post-order function calls are upward edges (return from call).
339 * A stack of queues of pre-order calls.
342 * ie. a flattened array of methods with 2 arguments, in reverse order
353 * be to maintain the queues in reverse order (popping off of the
526 // NOTE(mesch): Evaluation order is sometimes significant, e.g. when
666 // the order aligned with the DOM order, because the newl
[all...] |
| /external/chromium_org/third_party/jstemplate/ |
| jstemplate.js | 18 * HTML templates. The template is edited in place. I.e. in order to
159 * formatted as "name1=value1&name2=value2&...", in the order defined by
306 * - pre-order function calls are downward edges (recursion into call).
307 * - post-order function calls are upward edges (return from call).
321 * A stack of queues of pre-order calls.
324 * ie. a flattened array of methods with 2 arguments, in reverse order
335 * be to maintain the queues in reverse order (popping off of the
496 // NOTE(mesch): Evaluation order is sometimes significant, e.g. when
633 // the order aligned with the DOM order, because the newl
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/util/ |
| BufferUtils.java | 721 DoubleBuffer buf = ByteBuffer.allocateDirect(8 * size).order(ByteOrder.nativeOrder()).asDoubleBuffer();
784 FloatBuffer buf = ByteBuffer.allocateDirect(4 * size).order(ByteOrder.nativeOrder()).asFloatBuffer();
846 IntBuffer buf = ByteBuffer.allocateDirect(4 * size).order(ByteOrder.nativeOrder()).asIntBuffer();
909 ByteBuffer buf = ByteBuffer.allocateDirect(size).order(ByteOrder.nativeOrder());
987 ShortBuffer buf = ByteBuffer.allocateDirect(2 * size).order(ByteOrder.nativeOrder()).asShortBuffer();
[all...] |
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/common/checkout/scm/ |
| git.py | 295 order = ""
297 order = "-O%s" % order_file
299 command = [self.executable_name, 'diff', '--binary', '--no-color', "--no-ext-diff", "--full-index", "--no-renames", order, self.merge_base(git_commit), "--"]
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/controllers/ |
| manager.py | 113 if self._options.order == 'natural':
115 elif self._options.order == 'random':
117 elif self._options.order == 'random-seeded':
|
| /external/chromium_org/third_party/zlib/ |
| infback.c | 260 static const unsigned short order[19] = /* permutation of code lengths */ local
371 state->lens[order[state->have++]] = (unsigned short)BITS(3);
375 state->lens[order[state->have++]] = 0;
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| ImmutableSortedMultisetTest.java | 61 public List<String> order(List<String> insertionOrder) {
75 public List<String> order(List<String> insertionOrder) {
91 public List<String> order(List<String> insertionOrder) {
|
| /external/libvorbis/doc/ |
| 03-codebook.tex | 116 codebook is encoded in ascending length order. Rather than reading
163 each vector of order \varname{[codebook_dimensions]} scalars. Lookup
185 store these in order in the array [codebook_multiplicands]
205 codebooks support unused codeword entries) is assigned, in order, the
220 Assigning codewords in order (lowest possible value of the appropriate
253 As we assign codewords in order, we see that each choice constructs a
|
| /external/marisa-trie/tests/ |
| unit-test.cc | 246 ASSERT(progress.order() == MARISA_DEFAULT_ORDER);
257 ASSERT(progress.order() == MARISA_DEFAULT_ORDER);
269 ASSERT(progress.order() == MARISA_LABEL_ORDER);
|
| /external/marisa-trie/v0_1_5/tests/ |
| unit-test.cc | 250 ASSERT(progress.order() == MARISA_ALPHA_DEFAULT_ORDER);
261 ASSERT(progress.order() == MARISA_ALPHA_DEFAULT_ORDER);
273 ASSERT(progress.order() == MARISA_ALPHA_LABEL_ORDER);
|
| /external/qemu/distrib/zlib-1.2.3/ |
| infback.c | 260 static const unsigned short order[19] = /* permutation of code lengths */ local
371 state->lens[order[state->have++]] = (unsigned short)BITS(3);
375 state->lens[order[state->have++]] = 0;
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| queue.h | 189 // used to compare two StateIds. If a (single) state's order changes,
264 // specialized to use the weight's natural order for the comparion function.
279 // Topological-order queue discipline, templated on the StateId.
286 // This constructor computes the top. order. It accepts an arc filter
302 // This constructor is passed the top. order, useful when we know it
304 TopOrderQueue(const vector<StateId> &order)
306 order_(order), state_(order.size(), kNoStateId) {}
348 // State order queue discipline, templated on the StateId.
398 // SCC topological-order meta-queue discipline, templated on the StateId
[all...] |
| /external/zlib/src/ |
| infback.c | 269 static const unsigned short order[19] = /* permutation of code lengths */ local
380 state->lens[order[state->have++]] = (unsigned short)BITS(3);
384 state->lens[order[state->have++]] = 0;
|
| /frameworks/base/core/java/android/net/dhcp/ |
| DhcpPacket.java | 263 buf.order(ByteOrder.BIG_ENDIAN);
582 packet.order(ByteOrder.BIG_ENDIAN);
813 ByteBuffer buffer = ByteBuffer.wrap(packet).order(ByteOrder.BIG_ENDIAN);
|
| /hardware/qcom/display/msm8960/libexternal/ |
| external.cpp | 548 int order = getModeOrder(mode); local
549 if (order > bestOrder) {
550 bestOrder = order;
|
| /hardware/qcom/display/msm8974/libexternal/ |
| external.cpp | 560 int order = getModeOrder(mode); local
561 if (order > bestOrder) {
562 bestOrder = order;
|
| /hardware/qcom/display/msm8x26/libexternal/ |
| external.cpp | 548 int order = getModeOrder(mode); local
549 if (order > bestOrder) {
550 bestOrder = order;
|
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| cgraph.h | 226 per-function in order to allow IPA passes to introduce new functions. */
246 int order; variable
474 int order; variable
513 int order; variable
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| cgraph.h | 226 per-function in order to allow IPA passes to introduce new functions. */
246 int order; variable
474 int order; variable
513 int order; variable
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| cgraph.h | 226 per-function in order to allow IPA passes to introduce new functions. */
246 int order; variable
474 int order; variable
513 int order; variable
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| cgraph.h | 226 per-function in order to allow IPA passes to introduce new functions. */
246 int order; variable
474 int order; variable
513 int order; variable
[all...] |
| /external/wpa_supplicant_8/src/crypto/ |
| crypto_openssl.c | 1021 BIGNUM *order; member in struct:crypto_ec
1057 e->order = BN_new();
1059 e->order == NULL ||
1061 !EC_GROUP_get_order(e->group, e->order, e->bnctx)) {
1074 BN_free(e->order);
1109 return (const struct crypto_bignum *) e->order;
|
