HomeSort by relevance Sort by last modified time
    Searched refs:predict (Results 1 - 25 of 81) sorted by null

1 2 3 4

  /external/libvpx/libvpx/vp9/common/
vp9_scale.c 108 scale_comm->predict[0][0][0] = vp9_convolve_copy;
109 scale_comm->predict[0][0][1] = vp9_convolve_avg;
110 scale_comm->predict[0][1][0] = vp9_convolve8_vert;
111 scale_comm->predict[0][1][1] = vp9_convolve8_avg_vert;
112 scale_comm->predict[1][0][0] = vp9_convolve8_horiz;
113 scale_comm->predict[1][0][1] = vp9_convolve8_avg_horiz;
116 scale_comm->predict[0][0][0] = vp9_convolve8_vert;
117 scale_comm->predict[0][0][1] = vp9_convolve8_avg_vert;
118 scale_comm->predict[0][1][0] = vp9_convolve8_vert;
119 scale_comm->predict[0][1][1] = vp9_convolve8_avg_vert
    [all...]
vp9_scale.h 33 convolve_fn_t predict[2][2][2]; // horiz, vert, avg member in struct:scale_factors_common
  /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/
WnnEngine.java 54 * Predict words/phrases.
57 * @param minLen The minimum length of a word to predict (0 : no limit)
58 * @param maxLen The maximum length of a word to predict (-1 : no limit)
61 public int predict(ComposingText text, int minLen, int maxLen); method in interface:WnnEngine
97 * After {@link #predict(ComposingText, int, int)} or {@link #makeCandidateListOf(int)} or
100 * frequency order for {@link #predict(ComposingText, int, int)} and
  /external/libvpx/libvpx/test/
idct_test.cc 41 unsigned char predict[256]; member in class:__anon21165::IDCTTest
82 for (i = 0; i < 256; i++) predict[i] = i;
84 REGISTER_STATE_CHECK(UUT(input, predict, 16, output, 16));
  /external/antlr/antlr-3.4/runtime/C/include/
antlr3cyclicdfa.h 75 ANTLR3_INT32 (*predict) (void * ctx, pANTLR3_BASE_RECOGNIZER recognizer, pANTLR3_INT_STREAM is, struct ANTLR3_CYCLIC_DFA_struct * dfa); member in struct:ANTLR3_CYCLIC_DFA_struct
  /external/marisa-trie/tests/
trie-test.cc 152 ASSERT(trie.predict("") == 4);
153 ASSERT(trie.predict("a") == 3);
154 ASSERT(trie.predict("ap") == 2);
155 ASSERT(trie.predict("app") == 2);
156 ASSERT(trie.predict("appl") == 1);
157 ASSERT(trie.predict("apple") == 1);
158 ASSERT(trie.predict("appleX") == 0);
159 ASSERT(trie.predict("X") == 0);
162 ASSERT(trie.predict("a", &ids) == 3);
169 ASSERT(trie.predict("a", &ids, &strs) == 3)
    [all...]
  /external/marisa-trie/v0_1_5/tests/
trie-test.cc 154 ASSERT(trie.predict("") == 4);
155 ASSERT(trie.predict("a") == 3);
156 ASSERT(trie.predict("ap") == 2);
157 ASSERT(trie.predict("app") == 2);
158 ASSERT(trie.predict("appl") == 1);
159 ASSERT(trie.predict("apple") == 1);
160 ASSERT(trie.predict("appleX") == 0);
161 ASSERT(trie.predict("X") == 0);
164 ASSERT(trie.predict("a", &ids) == 3);
171 ASSERT(trie.predict("a", &ids, &strs) == 3)
    [all...]
  /external/marisa-trie/tools/
marisa-predict.cc 23 " -d, --depth-first predict keys in depth first order(default)\n"
24 " -b, --breadth-first predict keys in breadth first order\n"
32 int predict(const char * const *args, std::size_t num_args) { function in namespace:__anon22648
66 std::size_t num_keys = trie.predict(str);
81 << ": failed to predict keys from: " << str << std::endl;
158 return predict(cmdopt.argv + cmdopt.optind, cmdopt.argc - cmdopt.optind);
  /external/marisa-trie/v0_1_5/tools/
marisa_alpha-predict.cc 23 " -d, --depth-first predict keys in depth first order(default)\n"
24 " -b, --breadth-first predict keys in breadth first order\n"
32 int predict(const char * const *args, std::size_t num_args) { function in namespace:__anon22661
66 std::size_t num_keys = trie.predict(str);
81 << ": failed to predict keys from: " << str << std::endl;
159 return predict(cmdopt.argv + cmdopt.optind, cmdopt.argc - cmdopt.optind);
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p2/src/
armVCM4P2_SetPredDir_s.s 32 ; * OMX_VC_HORIZONTAL predict horizontally
33 ; * OMX_VC_VERTICAL predict vertically
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p2/src/
armVCM4P2_SetPredDir_s.s 32 ; * OMX_VC_HORIZONTAL predict horizontally
33 ; * OMX_VC_VERTICAL predict vertically
  /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
ANTLRDFA.h 52 // simulate the DFA using the static tables and predict an alternative
53 - (NSInteger) predict:(id<ANTLRCharStream>)anInput;
  /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
ANTLRDFA.h 52 // simulate the DFA using the static tables and predict an alternative
53 - (NSInteger) predict:(id<ANTLRCharStream>)anInput;
  /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
ANTLRDFA.h 52 // simulate the DFA using the static tables and predict an alternative
53 - (NSInteger) predict:(id<ANTLRCharStream>)anInput;
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/
ANTLRDFA.h 48 // simulate the DFA using the static tables and predict an alternative
49 - (NSInteger) predict:(id<ANTLRCharStream>)anInput;
  /frameworks/native/services/sensorservice/
Fusion.h 78 void predict(const vec3_t& w, float dT);
  /packages/inputmethods/PinyinIME/jni/include/
atomdictbase.h 181 virtual size_t predict(const char16 last_hzs[], uint16 hzs_len,
dictlist.h 107 size_t predict(const char16 last_hzs[], uint16 hzs_len,
  /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/
TestDFAMatching.java 99 assertEquals(dfa.predict(stream), expected);
  /external/opencv/ml/src/
mlrtrees.cpp 389 // predict oob samples
391 CV_CALL(predicted_node = tree->predict(&sample, &missing, true));
457 // predict "permuted" cases and calculate the number of votes for the
469 predct_resp = tree->predict(&sample, &missing, true)->value;
525 result += trees[i]->predict( sample1, missing1 ) ==
526 trees[i]->predict( sample2, missing2 ) ? 1 : 0;
535 float CvRTrees::predict( const CvMat* sample, const CvMat* missing ) const function in class:CvRTrees
539 CV_FUNCNAME("CvRTrees::predict");
551 CvDTreeNode* predicted_node = trees[k]->predict( sample, missing );
568 result += trees[k]->predict( sample, missing )->value
    [all...]
  /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/
DFA.as 56 /** From the input stream, predict what alternative will succeed
61 public function predict(input:IntStream):int { function
63 trace("Enter DFA.predict for decision "+decisionNumber);
91 if ( debug ) trace("accept; predict "+accept[s]+" from state "+s);
128 if ( debug ) trace("accept via EOF; predict "+accept[eof[s]]+" from "+eof[s]);
  /external/marisa-trie/lib/marisa/
trie.h 114 std::size_t predict(const char *str,
116 std::size_t predict(const char *ptr, std::size_t length,
118 std::size_t predict(const std::string &str,
121 std::size_t predict(const char *str,
125 std::size_t predict(const char *ptr, std::size_t length,
129 std::size_t predict(const std::string &str,
  /external/marisa-trie/v0_1_5/lib/marisa_alpha/
trie.h 114 std::size_t predict(const char *str,
116 std::size_t predict(const char *ptr, std::size_t length,
118 std::size_t predict(const std::string &str,
121 std::size_t predict(const char *str,
125 std::size_t predict(const char *ptr, std::size_t length,
129 std::size_t predict(const std::string &str,
  /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/
DFA.js 15 /** From the input stream, predict what alternative will succeed
20 predict: function(input) {
  /external/antlr/antlr-3.4/runtime/Perl5/lib/ANTLR/Runtime/
DFA.pm 60 # From the input stream, predict what alternative will succeed
64 sub predict { subroutine

Completed in 1361 milliseconds

1 2 3 4