/packages/inputmethods/PinyinIME/jni/include/ |
spellingtable.h | 81 // It always returns false if called after arrange() withtout a new 88 // It always returns false, when being called after arrange() withtout a new 101 // Do not call put_spelling() and contains() after arrange(). 102 const char* arrange(size_t *item_size, size_t *spl_num);
|
/external/bison/m4/ |
pathmax.m4 | 17 /* Arrange to define PATH_MAX, like "pathmax.h" does. */
|
calloc.m4 | 13 # and arrange to use a calloc wrapper function that does work in that case.
|
/external/oprofile/libutil/ |
op_deviceio.h | 49 * arrange for re-starting the read if necessary.
|
/ndk/sources/host-tools/sed-4.2.1/m4/ |
mkstemp.m4 | 13 # On systems like the above, arrange to use the replacement function.
|
rename.m4 | 12 dnl If it doesn't, then define RENAME_TRAILING_SLASH_BUG and arrange
|
gettimeofday.m4 | 48 dnl If it does, then arrange to use gettimeofday and localtime only via
|
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/research/ |
BootBroadcastReceiver.java | 24 * Arrange for the uploading service to be run on regular intervals.
|
UploaderService.java | 71 * Arrange for the UploaderService to be run on a regular basis.
|
/external/guava/guava/src/com/google/common/util/concurrent/ |
ListenableFutureTask.java | 53 * given {@code Runnable}, and arrange that {@code get} will return the
|
/external/llvm/lib/Support/ |
ToolOutputFile.cpp | 20 // Arrange for the file to be deleted if the process is killed.
|
Process.cpp | 57 /// first time it was called. However, we arrange to have it called during the
|
/frameworks/compile/mclinker/lib/MC/ |
SymbolCategory.cpp | 73 // use non-stable bubble sort to arrange the order of symbols. 103 SymbolCategory& SymbolCategory::arrange(LDSymbol& pSymbol, function in class:SymbolCategory 112 // in the same category, do not need to re-arrange
|
/bionic/libm/upstream-freebsd/lib/msun/src/ |
k_exp.c | 98 * Arrange so that scale1 * scale2 == 2**expt. We use this to
|
/external/chromium-trace/trace-viewer/src/importer/linux_perf/ |
parser.js | 12 * call Parser.registerSubtype to arrange to be instantiated
|
/external/qemu/distrib/sdl-1.2.15/src/main/symbian/EKA1/ |
SDL_main.cpp | 82 /* Arrange for multi-threaded operation */
|
/frameworks/compile/mclinker/include/mcld/MC/ |
SymbolCategory.h | 44 SymbolCategory& arrange(LDSymbol& pSymbol, const ResolveInfo& pSourceInfo);
|
/frameworks/compile/mclinker/lib/Core/ |
IRBuilder.cpp | 496 ResolveInfo old_info; // used for arrange output symbols 559 // we need to arrange its position in the output symbol. We arrange the 581 m_Module.getSymbolTable().arrange(*output_sym, old_info); 729 m_Module.getSymbolTable().arrange(*output_sym, old_info); 782 m_Module.getSymbolTable().arrange(*output_sym, old_info); 829 // arrange the output position 833 m_Module.getSymbolTable().arrange(*output_sym, old_info);
|
/external/chromium/base/ |
message_pump_mac.mm | 243 // stack but foreign code is spinning the CFRunLoop. Arrange to come back 256 // Call DoWork and DoDelayedWork once, and if something was done, arrange to 277 // Arrange to come back here directly as long as the loop is still 302 // stack but foreign code is spinning the CFRunLoop. Arrange to come back 315 // Call DoIdleWork once, and if something was done, arrange to come back here 348 // Work was done. Arrange for the loop to try non-nestable idle work on
|
/bionic/libm/i387/ |
npx.h | 75 * struct and arrange to store into this struct (ending here)
|
/external/chromium/chrome/browser/speech/ |
speech_input_bubble_gtk.cc | 120 // We use a vbox to arrange the controls (label, image, button bar) vertically
|
/external/chromium/chrome/browser/web_resource/ |
promo_resource_service.h | 26 // TODO(mirandac): Arrange for a server to be set up specifically for promo
|
/external/jpeg/ |
jfdctflt.c | 26 * possible to arrange the computation so that many of the multiplies are
|
/external/libogg/ |
README | 39 Ogg project codecs use the Ogg bitstream format to arrange the raw,
|
/external/qemu/distrib/jpeg-6b/ |
jfdctflt.c | 26 * possible to arrange the computation so that many of the multiplies are
|