HomeSort by relevance Sort by last modified time
    Searched full:pred (Results 626 - 650 of 1751) sorted by null

<<21222324252627282930>>

  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/x86/
subtract_mmx.asm 77 ;unsigned char *pred, int pred_stride)
90 mov rax, arg(3) ;pred
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/
types.pass.cpp 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
21 // typedef Pred key_equal;
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/
types.pass.cpp 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
21 // typedef Pred key_equal;
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/
types.pass.cpp 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
21 // typedef Pred key_equal;
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/
types.pass.cpp 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
21 // typedef Pred key_equal;
  /packages/apps/StorageManager/res/values-sk/
strings.xml 23 <string name="deletion_helper_app_summary" msgid="1923023368736447552">"<xliff:g id="USED">%1$s</xliff:g> ? pred <xliff:g id="DAYS">%2$d</xliff:g> d?ami"</string>
42 <string name="deletion_helper_apps_group_summary" msgid="3466154404460006085">"<xliff:g id="USED">%1$s</xliff:g> ? naposledy pou?ité pred <xliff:g id="DAYS">%2$d</xliff:g> d?ami"</string>
  /packages/apps/StorageManager/res/values-sl/
strings.xml 23 <string name="deletion_helper_app_summary" msgid="1923023368736447552">"<xliff:g id="USED">%1$s</xliff:g> ? Pred toliko dnevi: <xliff:g id="DAYS">%2$d</xliff:g>"</string>
42 <string name="deletion_helper_apps_group_summary" msgid="3466154404460006085">"<xliff:g id="USED">%1$s</xliff:g> ? Nazadnje uporabljeno pred toliko dnevi: <xliff:g id="DAYS">%2$d</xliff:g>"</string>
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/left_child_next_sibling_heap_/
left_child_next_sibling_heap_.hpp 210 template<typename Pred>
212 prune(Pred);
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/rb_tree_map_/
rb_tree_.hpp 168 template<typename Pred>
170 erase_if(Pred);
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/left_child_next_sibling_heap_/
left_child_next_sibling_heap_.hpp 210 template<typename Pred>
212 prune(Pred);
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/rb_tree_map_/
rb_tree_.hpp 168 template<typename Pred>
170 erase_if(Pred);
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/left_child_next_sibling_heap_/
left_child_next_sibling_heap_.hpp 210 template<typename Pred>
212 prune(Pred);
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/rb_tree_map_/
rb_tree_.hpp 168 template<typename Pred>
170 erase_if(Pred);
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
left_child_next_sibling_heap_.hpp 210 template<typename Pred>
212 prune(Pred);
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/rb_tree_map_/
rb_tree_.hpp 168 template<typename Pred>
170 erase_if(Pred);
  /libcore/ojluni/src/main/java/java/util/
LinkedList.java 157 final Node<E> pred = succ.prev; local
158 final Node<E> newNode = new Node<>(pred, e, succ);
160 if (pred == null)
163 pred.next = newNode;
413 Node<E> pred, succ;
416 pred = last;
419 pred = succ.prev;
424 Node<E> newNode = new Node<>(pred, e, null);
425 if (pred == null)
428 pred.next = newNode
    [all...]
  /external/llvm/lib/IR/
BasicBlock.cpp 266 void BasicBlock::removePredecessor(BasicBlock *Pred,
269 find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) &&
291 BasicBlock *Other = APN->getIncomingBlock(APN->getIncomingBlock(0) == Pred);
302 PN->removeIncomingValue(Pred, !DontDeleteUselessPHIs);
323 PN->removeIncomingValue(Pred, false);
  /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/
idct.h 48 void idctrow0(int16 *blk, uint8 *pred, uint8 *dst, int width);
49 void idctrow1(int16 *blk, uint8 *pred, uint8 *dst, int width);
50 void idctrow2(int16 *blk, uint8 *pred, uint8 *dst, int width);
51 void idctrow3(int16 *blk, uint8 *pred, uint8 *dst, int width);
52 void idctrow4(int16 *blk, uint8 *pred, uint8 *dst, int width);
idct.cpp 345 int *blk, uint8 *pred, uint8 *dst, int width)
538 res = (*pred++ + block[0+(i<<3)]);
541 res = (*pred++ + block[1+(i<<3)]);
544 res = (*pred++ + block[2+(i<<3)]);
547 res = (*pred++ + block[3+(i<<3)]);
550 res = (*pred++ + block[4+(i<<3)]);
553 res = (*pred++ + block[5+(i<<3)]);
556 res = (*pred++ + block[6+(i<<3)]);
559 res = (*pred++ + block[7+(i<<3)]);
563 pred += 8
    [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/mips-dspr2/
vp8_rtcd.h 71 void vp8_short_idct4x4llm_c(short *input, unsigned char *pred, int pitch, unsigned char *dst, int dst_stride);
72 void vp8_short_idct4x4llm_dspr2(short *input, unsigned char *pred, int pitch, unsigned char *dst, int dst_stride);
83 void vp8_dc_only_idct_add_c(short input, unsigned char *pred, int pred_stride, unsigned char *dst, int dst_stride);
84 void vp8_dc_only_idct_add_dspr2(short input, unsigned char *pred, int pred_stride, unsigned char *dst, int dst_stride);
289 void vp8_subtract_mby_c(short *diff, unsigned char *src, int src_stride, unsigned char *pred, int pred_stride);
  /libcore/luni/src/main/java/java/util/concurrent/
FutureTask.java 440 for (WaitNode pred = null, q = waiters, s; q != null; q = s) {
443 pred = q;
444 else if (pred != null) {
445 pred.next = s;
446 if (pred.thread == null) // check for race
  /external/llvm/lib/Transforms/Instrumentation/
GCOVProfiling.cpp 112 // pred block number for certain non-trivial edges.
716 // the whole-Module pred edge# between the time we set it and the time we next
719 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]].
907 // uint32_t pred = *predecessor;
908 // if (pred == 0xffffffff) return;
911 Value *Pred = Builder.CreateLoad(Arg, "pred");
912 Value *Cond = Builder.CreateICmpEQ(Pred, Builder.getInt32(0xffffffff));
    [all...]
  /external/llvm/lib/Analysis/
LazyValueInfo.cpp 718 << "' - overdefined because of pred.\n");
763 << "' - overdefined because of pred.\n");
    [all...]
  /external/libhevc/decoder/
ihevcd_structs.h 253 * where MVs and Intra pred modes will be updated
281 * where MVs and Intra pred modes will be updated
435 * where MVs and Intra pred modes will be updated
718 * Intra luma pred mode for current CU. In case of PART2Nx2N
724 * Previous intra luma pred flag used for intra pred mode computation
733 * Remaining intra pred mode
737 * Chroma pred mode index to be used to compute intra pred mode for chroma
948 * pred unit and transform tree parsing
    [all...]
  /prebuilts/go/darwin-x86/src/go/types/
api_test.go 264 pred := func(b bool, s string) {
273 pred(tv.IsVoid(), "void")
274 pred(tv.IsType(), "type")
275 pred(tv.IsBuiltin(), "builtin")
276 pred(tv.IsValue() && tv.Value != nil, "const")
277 pred(tv.IsValue() && tv.Value == nil, "value")
278 pred(tv.IsNil(), "nil")
279 pred(tv.Addressable(), "addressable")
280 pred(tv.Assignable(), "assignable")
281 pred(tv.HasOk(), "hasOk"
    [all...]

Completed in 1283 milliseconds

<<21222324252627282930>>