/external/openfst/src/include/fst/script/ |
H A D | connect.h | 22 #include <fst/dfs-visit.h>
|
/external/chromium_org/chrome/browser/history/ |
H A D | visit_filter_unittest.cc | 247 VisitRow visit; local 256 // No decay on current visit. 257 visit.visit_time = filter_time; 258 EXPECT_DOUBLE_EQ(1.0, filter.GetVisitScore(visit)); 260 visit.visit_time = filter_time - base::TimeDelta::FromDays(7); 261 EXPECT_DOUBLE_EQ(0.5, filter.GetVisitScore(visit)); 263 visit.visit_time = filter_time + base::TimeDelta::FromDays(1); 264 EXPECT_DOUBLE_EQ(1.0, filter.GetVisitScore(visit)); 267 // Every visit should score 1 with this filter. 268 visit [all...] |
H A D | visit_database.h | 21 // A visit database is one which stores visits for URLs, that is, times and 22 // linking information. A visit database must also be a URLDatabase, as this 33 // Deletes the visit table. Used for rapidly clearing all visits. In this 38 // Adds a line to the visit database with the given information, returning 39 // the added row ID on success, 0 on failure. The given visit is updated with 42 VisitID AddVisit(VisitRow* visit, VisitSource source); 44 // Deletes the given visit from the database. If a visit with the given ID 46 void DeleteVisit(const VisitRow& visit); 48 // Query a VisitInfo giving an visit i [all...] |
/external/chromium_org/third_party/angle/src/compiler/translator/ |
H A D | parseConst.cpp | 37 bool visitBinary(Visit visit, TIntermBinary *); 38 bool visitUnary(Visit visit, TIntermUnary *); 39 bool visitSelection(Visit visit, TIntermSelection *); 40 bool visitAggregate(Visit visit, TIntermAggregate *); 41 bool visitLoop(Visit visit, TIntermLoop *); 42 bool visitBranch(Visit visit, TIntermBranch *); 71 bool TConstTraverser::visitBinary(Visit visit, TIntermBinary *node) argument 90 bool TConstTraverser::visitUnary(Visit visit, TIntermUnary *node) argument 100 bool TConstTraverser::visitAggregate(Visit visit, TIntermAggregate *node) argument 153 bool TConstTraverser::visitSelection(Visit visit, TIntermSelectio argument 228 visitLoop(Visit visit, TIntermLoop *node) argument 236 visitBranch(Visit visit, TIntermBranch *node) argument [all...] |
H A D | intermOut.cpp | 36 bool visitBinary(Visit visit, TIntermBinary *); 37 bool visitUnary(Visit visit, TIntermUnary *); 38 bool visitSelection(Visit visit, TIntermSelection *); 39 bool visitAggregate(Visit visit, TIntermAggregate *); 40 bool visitLoop(Visit visit, TIntermLoop *); 41 bool visitBranch(Visit visit, TIntermBranch *); 94 bool TOutputTraverser::visitBinary(Visit visit, TIntermBinary *node) argument 215 bool TOutputTraverser::visitUnary(Visit visit, TIntermUnary *node) argument 275 bool TOutputTraverser::visitAggregate(Visit visit, TIntermAggregate *node) argument 360 bool TOutputTraverser::visitSelection(Visit visit, TIntermSelectio argument 437 visitLoop(Visit visit, TIntermLoop *node) argument 484 visitBranch(Visit visit, TIntermBranch *node) argument [all...] |
H A D | RenameFunction.h | 23 virtual bool visitAggregate(Visit visit, TIntermAggregate* node) argument
|
H A D | ScalarizeVecAndMatConstructorArgs.h | 22 virtual bool visitAggregate(Visit visit, TIntermAggregate *node);
|
/external/clang/include/clang/AST/ |
H A D | CommentVisitor.h | 27 return static_cast<ImplClass*>(this)->visit ## NAME(static_cast<PTR(CLASS)>(C)) 29 RetTy visit(PTR(Comment) C) { 48 RetTy visit ## CLASS(PTR(CLASS) C) { DISPATCH(PARENT, PARENT); }
|
/external/mockito/cglib-and-asm/src/org/mockito/cglib/transform/ |
H A D | AnnotationVisitorTee.java | 36 public void visit(String name, Object value) { method in class:AnnotationVisitorTee 37 av2.visit(name, value); 38 av2.visit(name, value);
|
/external/chromium_org/third_party/mesa/src/src/glsl/ |
H A D | ir_hierarchical_visitor.h | 30 * Enumeration values returned by visit methods to guide processing 34 visit_continue_with_parent, /**< Don't visit siblings, continue w/parent. */ 43 * important ways. Rather than having a single \c visit method for each 44 * subclass in the composite, there are three kinds of visit methods. 45 * Leaf-node classes have a traditional \c visit method. Internal-node 50 * In addition, each visit method and the \c accept methods in the composite 51 * have a return value which guides the navigation. Any of the visit methods 59 * class will simply call the \c visit method, as usual, and pass its return 66 * abstract. Default implementations of every \c visit, \c visit_enter, and 85 virtual ir_visitor_status visit(clas [all...] |
H A D | ir_print_visitor.cpp | 138 void ir_print_visitor::visit(ir_rvalue *ir) function in class:ir_print_visitor 143 void ir_print_visitor::visit(ir_variable *ir) function in class:ir_print_visitor 161 void ir_print_visitor::visit(ir_function_signature *ir) function in class:ir_print_visitor 206 void ir_print_visitor::visit(ir_function *ir) function in class:ir_print_visitor 222 void ir_print_visitor::visit(ir_expression *ir) function in class:ir_print_visitor 238 void ir_print_visitor::visit(ir_texture *ir) function in class:ir_print_visitor 301 void ir_print_visitor::visit(ir_swizzle *ir) function in class:ir_print_visitor 320 void ir_print_visitor::visit(ir_dereference_variable *ir) function in class:ir_print_visitor 327 void ir_print_visitor::visit(ir_dereference_array *ir) function in class:ir_print_visitor 336 void ir_print_visitor::visit(ir_dereference_recor function in class:ir_print_visitor 344 void ir_print_visitor::visit(ir_assignment *ir) function in class:ir_print_visitor 373 void ir_print_visitor::visit(ir_constant *ir) function in class:ir_print_visitor 409 ir_print_visitor::visit(ir_call *ir) function in class:ir_print_visitor 425 ir_print_visitor::visit(ir_return *ir) function in class:ir_print_visitor 440 ir_print_visitor::visit(ir_discard *ir) function in class:ir_print_visitor 454 ir_print_visitor::visit(ir_if *ir) function in class:ir_print_visitor 496 ir_print_visitor::visit(ir_loop *ir) function in class:ir_print_visitor 527 ir_print_visitor::visit(ir_loop_jump *ir) function in class:ir_print_visitor [all...] |
/external/mesa3d/src/glsl/ |
H A D | ir_hierarchical_visitor.h | 30 * Enumeration values returned by visit methods to guide processing 34 visit_continue_with_parent, /**< Don't visit siblings, continue w/parent. */ 43 * important ways. Rather than having a single \c visit method for each 44 * subclass in the composite, there are three kinds of visit methods. 45 * Leaf-node classes have a traditional \c visit method. Internal-node 50 * In addition, each visit method and the \c accept methods in the composite 51 * have a return value which guides the navigation. Any of the visit methods 59 * class will simply call the \c visit method, as usual, and pass its return 66 * abstract. Default implementations of every \c visit, \c visit_enter, and 85 virtual ir_visitor_status visit(clas [all...] |
H A D | ir_print_visitor.cpp | 138 void ir_print_visitor::visit(ir_rvalue *ir) function in class:ir_print_visitor 143 void ir_print_visitor::visit(ir_variable *ir) function in class:ir_print_visitor 161 void ir_print_visitor::visit(ir_function_signature *ir) function in class:ir_print_visitor 206 void ir_print_visitor::visit(ir_function *ir) function in class:ir_print_visitor 222 void ir_print_visitor::visit(ir_expression *ir) function in class:ir_print_visitor 238 void ir_print_visitor::visit(ir_texture *ir) function in class:ir_print_visitor 301 void ir_print_visitor::visit(ir_swizzle *ir) function in class:ir_print_visitor 320 void ir_print_visitor::visit(ir_dereference_variable *ir) function in class:ir_print_visitor 327 void ir_print_visitor::visit(ir_dereference_array *ir) function in class:ir_print_visitor 336 void ir_print_visitor::visit(ir_dereference_recor function in class:ir_print_visitor 344 void ir_print_visitor::visit(ir_assignment *ir) function in class:ir_print_visitor 373 void ir_print_visitor::visit(ir_constant *ir) function in class:ir_print_visitor 409 ir_print_visitor::visit(ir_call *ir) function in class:ir_print_visitor 425 ir_print_visitor::visit(ir_return *ir) function in class:ir_print_visitor 440 ir_print_visitor::visit(ir_discard *ir) function in class:ir_print_visitor 454 ir_print_visitor::visit(ir_if *ir) function in class:ir_print_visitor 496 ir_print_visitor::visit(ir_loop *ir) function in class:ir_print_visitor 527 ir_print_visitor::visit(ir_loop_jump *ir) function in class:ir_print_visitor [all...] |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | TreeWizard.java | 58 // TODO: should this be called visit or something else? 59 public void visit(Object t, Object parent, int childIndex, Map labels); method in interface:TreeWizard.ContextVisitor 63 public void visit(Object t, Object parent, int childIndex, Map labels) { method in class:TreeWizard.Visitor 64 visit(t); 66 public abstract void visit(Object t); method in class:TreeWizard.Visitor 172 * TODO: save this index so that find and visit are faster 202 visit(t, ttype, new TreeWizard.Visitor() { 203 public void visit(Object t) { 226 visit(t, rootTokenType, new TreeWizard.ContextVisitor() { 227 public void visit(Objec 249 public void visit(Object t, int ttype, ContextVisitor visitor) { method in class:TreeWizard 273 public void visit(Object t, final String pattern, final ContextVisitor visitor) { method in class:TreeWizard [all...] |
/external/openfst/src/include/fst/ |
H A D | visit.h | 0 // visit.h 20 // dfs-visit.h. 32 // Visitor Interface - class determines actions taken during a visit. 33 // If any of the boolean member functions return false, the visit is 38 // dfs-visit.h but lacks some DFS-specific behavior. 46 // // Invoked before visit 58 // // Invoked after visit 66 // Note this is more general than DfsVisit() in dfs-visit.h but lacks 82 // An Fst state's visit color 104 // Continues visit whil 105 bool visit = true; local [all...] |
/external/chromium_org/third_party/jinja2/ |
H A D | compiler.py | 61 generator.visit(node) 95 visitor.visit(node) 199 visitor.visit(node) 288 self.visit(node.test) 299 self.visit(subnode) 335 self.visit(node.node) 336 self.visit(node.target) 342 self.visit(node.iter) 345 self.visit(node.call) 348 self.visit(nod [all...] |
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
H A D | brw_fs.h | 197 void visit(ir_variable *ir); 198 void visit(ir_assignment *ir); 199 void visit(ir_dereference_variable *ir); 200 void visit(ir_dereference_record *ir); 201 void visit(ir_dereference_array *ir); 202 void visit(ir_expression *ir); 203 void visit(ir_texture *ir); 204 void visit(ir_if *ir); 205 void visit(ir_constant *ir); 206 void visit(ir_swizzl [all...] |
H A D | brw_vec4.h | 268 * As typical for the visitor pattern, there must be one \c visit method for 270 * the hierarchy should not have \c visit methods. 273 virtual void visit(ir_variable *); 274 virtual void visit(ir_loop *); 275 virtual void visit(ir_loop_jump *); 276 virtual void visit(ir_function_signature *); 277 virtual void visit(ir_function *); 278 virtual void visit(ir_expression *); 279 virtual void visit(ir_swizzle *); 280 virtual void visit(ir_dereference_variabl [all...] |
/external/mesa3d/src/mesa/drivers/dri/i965/ |
H A D | brw_fs.h | 197 void visit(ir_variable *ir); 198 void visit(ir_assignment *ir); 199 void visit(ir_dereference_variable *ir); 200 void visit(ir_dereference_record *ir); 201 void visit(ir_dereference_array *ir); 202 void visit(ir_expression *ir); 203 void visit(ir_texture *ir); 204 void visit(ir_if *ir); 205 void visit(ir_constant *ir); 206 void visit(ir_swizzl [all...] |
H A D | brw_vec4.h | 268 * As typical for the visitor pattern, there must be one \c visit method for 270 * the hierarchy should not have \c visit methods. 273 virtual void visit(ir_variable *); 274 virtual void visit(ir_loop *); 275 virtual void visit(ir_loop_jump *); 276 virtual void visit(ir_function_signature *); 277 virtual void visit(ir_function *); 278 virtual void visit(ir_expression *); 279 virtual void visit(ir_swizzle *); 280 virtual void visit(ir_dereference_variabl [all...] |
/external/chromium_org/v8/src/compiler/ |
H A D | generic-algorithm.h | 22 // dependencies and uses, it also can be used to visit any graph-like network 55 bool visit = !GetVisited(&visited, id); 56 if (visit) { 58 visit = !IsSkip(control); 61 Iterator begin(visit ? Traits::begin(current) : Traits::end(current)); 68 if (visit) { 80 visit = true;
|
/external/emma/core/java12/com/vladium/emma/report/ |
H A D | AllItem.java | 32 visitor.visit (this, ctx);
|
/external/emma/core/java12/com/vladium/jcd/cls/attribute/ |
H A D | BridgeAttribute_info.java | 42 visitor.visit (this, ctx);
|
H A D | SyntheticAttribute_info.java | 59 visitor.visit (this, ctx);
|
/external/emma/core/java12/com/vladium/jcd/cls/constant/ |
H A D | CONSTANT_String_info.java | 53 return visitor.visit (this, ctx);
|