| /external/libvpx/libvpx/vp9/common/ |
| vp9_scale.c | 85 sf->predict[0][0][0] = vp9_convolve_copy;
86 sf->predict[0][0][1] = vp9_convolve_avg;
87 sf->predict[0][1][0] = vp9_convolve8_vert;
88 sf->predict[0][1][1] = vp9_convolve8_avg_vert;
89 sf->predict[1][0][0] = vp9_convolve8_horiz;
90 sf->predict[1][0][1] = vp9_convolve8_avg_horiz;
93 sf->predict[0][0][0] = vp9_convolve8_vert;
94 sf->predict[0][0][1] = vp9_convolve8_avg_vert;
95 sf->predict[0][1][0] = vp9_convolve8_vert;
96 sf->predict[0][1][1] = vp9_convolve8_avg_vert
[all...] |
| vp9_scale.h | 34 convolve_fn_t predict[2][2][2]; // horiz, vert, avg member in struct:scale_factors
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/ |
| vp9_scale.c | 84 sf->predict[0][0][0] = vp9_convolve_copy;
85 sf->predict[0][0][1] = vp9_convolve_avg;
86 sf->predict[0][1][0] = vp9_convolve8_vert;
87 sf->predict[0][1][1] = vp9_convolve8_avg_vert;
88 sf->predict[1][0][0] = vp9_convolve8_horiz;
89 sf->predict[1][0][1] = vp9_convolve8_avg_horiz;
92 sf->predict[0][0][0] = vp9_convolve8_vert;
93 sf->predict[0][0][1] = vp9_convolve8_avg_vert;
94 sf->predict[0][1][0] = vp9_convolve8_vert;
95 sf->predict[0][1][1] = vp9_convolve8_avg_vert
[all...] |
| vp9_scale.h | 34 convolve_fn_t predict[2][2][2]; // horiz, vert, avg member in struct:scale_factors
|
| /external/chromium_org/third_party/libvpx/source/libvpx/test/ |
| idct_test.cc | 39 unsigned char predict[256]; member in class:__anon17616::IDCTTest
80 for (i = 0; i < 256; i++) predict[i] = i;
82 ASM_REGISTER_STATE_CHECK(UUT(input, predict, 16, output, 16));
|
| /external/libvpx/libvpx/test/ |
| idct_test.cc | 39 unsigned char predict[256]; member in class:__anon4338::IDCTTest
80 for (i = 0; i < 256; i++) predict[i] = i;
82 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/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;
|
| /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/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
|
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| dfa.py | 64 def predict(self, input): member in class:DFA
66 From the input stream, predict what alternative will succeed
|
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/ |
| nuances.rb | 132 // this rule used to generate an infinite loop in DFA.predict
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/C/ |
| Dbg.stg | 223 alt<decisionNumber> = cdfa<decisionNumber>.predict(ctx, RECOGNIZER, ISTREAM, &cdfa<decisionNumber>);
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| DFA.java | 57 /** From the input stream, predict what alternative will succeed
62 public int predict(IntStream input) method in class:DFA
66 System.err.println("Enter DFA.predict for decision "+decisionNumber);
93 if ( debug ) System.err.println("accept; predict "+accept[s]+" from state "+s);
130 if ( debug ) System.err.println("accept via EOF; predict "+accept[eof[s]]+" from "+eof[s]);
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/x86/ |
| idctllm_sse2.asm | 70 ; Add to predict buffer
311 ; Load up predict blocks
385 ; Load up predict blocks
399 ; Predict buffer needs to be expanded from bytes to words
405 ; Add to predict buffer
648 ; Load up predict blocks
|
| /external/chromium_org/third_party/libwebp/dsp/ |
| lossless.c | 629 uint32_t predict; local
631 predict = (col == 0) ? ARGB_BLACK : current_row[col - 1]; // Left.
633 predict = upper_row[col]; // Top.
635 predict = pred_func(current_row[col - 1], upper_row + col);
637 UpdateHisto(histo_argb, VP8LSubPixels(current_row[col], predict));
672 uint32_t predict; local
674 predict = (col == 0) ? ARGB_BLACK : current_row[col - 1]; // Left.
676 predict = upper_row[col]; // Top.
678 predict = pred_func(current_row[col - 1], upper_row + col);
680 argb[pix] = VP8LSubPixels(current_row[col], predict);
[all...] |
| /external/libvpx/libvpx/vp8/common/x86/ |
| idctllm_sse2.asm | 70 ; Add to predict buffer
311 ; Load up predict blocks
385 ; Load up predict blocks
399 ; Predict buffer needs to be expanded from bytes to words
405 ; Add to predict buffer
648 ; Load up predict blocks
|
| /external/opencv/ml/include/ |
| ml.h | 250 virtual float predict( const CvMat* _samples, CvMat* results=0 ) const;
514 virtual float predict( const CvMat* _sample ) const;
604 virtual float predict( const CvMat* sample, CvMat* probs ) const;
845 virtual CvDTreeNode* predict( const CvMat* _sample, const CvMat* _missing_data_mask=0,
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| Interpreter.java | 117 * predict which alternative will succeed. This is exactly what the
235 // decision point, must predict and jump to alt
245 int predictedAlt = predict(dfa);
395 public int predict(DFA dfa) { method in class:Interpreter
402 System.out.println("DFA.predict("+s.getStateNumber()+", "+
431 // woohoo! We know which alt to predict
|
