/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
H A D | 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/Perl5/lib/ANTLR/Runtime/ |
H A D | DFA.pm | 60 # From the input stream, predict what alternative will succeed 64 sub predict { subroutine
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
H A D | dfa.rb | 95 For more information on the prediction algorithm, check out the #predict method 171 def predict( input ) method in class:ANTLR3 237 def predict( input ) method in class:ANTLR3
|
/external/antlr/antlr-3.4/runtime/C/include/ |
H A D | 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/Python/antlr3/ |
H A D | 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/Java/src/main/java/org/antlr/runtime/ |
H A D | 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/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | 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
|
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/ |
H A D | DFA.js | 15 /** From the input stream, predict what alternative will succeed 20 predict: function(input) {
|
/external/opencv/ml/src/ |
H A D | mlnbayes.cpp | 281 float CvNormalBayesClassifier::predict( const CvMat* samples, CvMat* results ) const function in class:CvNormalBayesClassifier 287 CV_FUNCNAME( "CvNormalBayesClassifier::predict" );
|
H A D | 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( sampl [all...] |
H A D | mlem.cpp | 209 CvEM::predict( const CvMat* _sample, CvMat* _probs ) const function in class:CvEM 216 CV_FUNCNAME( "CvEM::predict" ); 378 labels->data.i[i*lstep] = cvRound(predict(&sample, &prob));
|
H A D | mlann_mlp.cpp | 266 float CvANN_MLP::predict( const CvMat* _inputs, CvMat* _outputs ) const function in class:CvANN_MLP 268 CV_FUNCNAME( "CvANN_MLP::predict" );
|
H A D | mlsvm.cpp | 1815 resp = predict( &s ); 1877 float CvSVM::predict( const CvMat* sample ) const function in class:CvSVM 1884 CV_FUNCNAME( "CvSVM::predict" );
|
H A D | mltree.cpp | 2881 CvDTreeNode* CvDTree::predict( const CvMat* _sample, function in class:CvDTree 2887 CV_FUNCNAME( "CvDTree::predict" );
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | DFA.java | 653 public int predict(IntStream input) { method in class:DFA 655 return interp.predict(this); 1132 * and predict the exit branch. The reachable labels are often a
|
/external/webp/src/dsp/ |
H A D | lossless.c | 408 uint32_t predict; local 411 predict = (col == 0) ? ARGB_BLACK : current_row[col - 1]; // Left. 413 predict = upper_row[col]; // Top. 415 predict = pred_func(current_row[col - 1], upper_row + col); 417 predict_diff = VP8LSubPixels(current_row[col], predict); 457 uint32_t predict; local 459 predict = (col == 0) ? ARGB_BLACK : current_row[col - 1]; // Left. 461 predict = upper_row[col]; // Top. 463 predict = pred_func(current_row[col - 1], upper_row + col); 465 argb[pix] = VP8LSubPixels(current_row[col], predict); 725 uint32_t predict; local 762 uint32_t predict; local [all...] |
/external/antlr/antlr-3.4/lib/ |
H A D | antlr-3.4-complete.jar | META-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ... |