HomeSort by relevance Sort by last modified time
    Searched refs:best (Results 201 - 225 of 385) sorted by null

1 2 3 4 5 6 7 891011>>

  /external/doclava/res/assets/templates-sdk/
footer.cs 117 <legend class="dac-form-legend"><span data-t="newsletter.business.label">Which best describes your business:</span><span class="dac-form-required">*</span>
  /external/libvncserver/webclients/novnc/include/web-socket-js/
web_socket.js 277 // the best we can do as far as we know now.
  /frameworks/rs/script_api/
rs_for_each.spec 79 versions, it will also be used to provide hint on how to best iterate over
  /prebuilts/go/darwin-x86/src/encoding/binary/
binary_test.go 299 // panic. This is probably not the best choice, but at this point
  /prebuilts/go/darwin-x86/src/net/rpc/
client.go 305 // is totally unbuffered, it's best not to run at all.
  /prebuilts/go/darwin-x86/src/regexp/
backtrack.go 276 // Record best match so far.
  /prebuilts/go/linux-x86/src/encoding/binary/
binary_test.go 299 // panic. This is probably not the best choice, but at this point
  /prebuilts/go/linux-x86/src/net/rpc/
client.go 305 // is totally unbuffered, it's best not to run at all.
  /prebuilts/go/linux-x86/src/regexp/
backtrack.go 276 // Record best match so far.
  /external/mesa3d/src/gallium/drivers/nouveau/codegen/
nv50_ir_ra.cpp 1321 RIG_Node *best = hi.next; local
    [all...]
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/
regalloc.go 380 // we've seen so far. A new best spill candidate.
600 best := -1
606 if best == -1 || blockOrder[p.ID] > blockOrder[b.Preds[best].b.ID] {
607 best = i
610 s.primary[b.ID] = int32(best)
857 // TODO: pick best of (already processed) predecessors?
    [all...]
likelyadjust.go 167 // TODO what is best arrangement for nested loops?
  /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/
regalloc.go 380 // we've seen so far. A new best spill candidate.
600 best := -1
606 if best == -1 || blockOrder[p.ID] > blockOrder[b.Preds[best].b.ID] {
607 best = i
610 s.primary[b.ID] = int32(best)
857 // TODO: pick best of (already processed) predecessors?
    [all...]
  /external/freetype/src/autofit/
aflatin.c 2627 FT_Pos best = 64 + 32 + 2; local
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/
Hyperlinks.java 1225 ResourceFile best = null; local
    [all...]
  /toolchain/binutils/binutils-2.25/gold/
layout.cc     [all...]
  /external/ImageMagick/www/api/
layer.php 113 <p>Images do NOT have to be the same size, though it is best that all the images are 'coalesced' (images are all the same size, on a flattened canvas, so as to represent exactly how an specific frame should look).</p>
  /external/bison/doc/
refcard.tex 45 % This gives the best resolution.
  /external/eigen/lapack/
clarfb.f 172 *> the H(i) is best illustrated by the following example with n = 5 and
dlarfb.f 172 *> the H(i) is best illustrated by the following example with n = 5 and
slarfb.f 172 *> the H(i) is best illustrated by the following example with n = 5 and
zlarfb.f 172 *> the H(i) is best illustrated by the following example with n = 5 and
  /external/zlib/src/contrib/delphi/
ZLib.pas 39 data_type: Integer; // best guess about the data type: ascii or binary
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/
racewalk.go 33 // at best instrumentation would cause infinite recursion.
  /prebuilts/go/darwin-x86/src/internal/pprof/profile/
profile.go 547 // names referenced in the profile. It works on a best-effort basis:

Completed in 1474 milliseconds

1 2 3 4 5 6 7 891011>>