/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | NFAToDFAConverter.java | 117 // added to every edge by code gen, DOT generation etc... 244 // string so if we see an EOT edge emanating from this state, then 347 * is to reduce to a single EOT edge any set of edges from d to targetState 397 * but upon seeing the EOT edge (the "else"-clause), this method 424 // merge with EOT means old edge can go away 497 * 1. Traverse an edge that takes us to the start state of another 680 // traverse epsilon edge to new rule 743 System.out.println("alt left edge "+altLeftEdge.stateNumber+ 852 // for each NFA state in d with a labeled edge, 855 //System.out.println("size(labeled edge state [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
H A D | ACyclicDFACodeGenerator.java | 99 Transition edge = (Transition) s.transition(i); 100 //System.out.println("edge "+s.stateNumber+"-"+edge.label.toString()+"->"+edge.target.stateNumber); 101 if ( edge.label.getAtom()==Label.EOT ) { 102 // don't generate a real edge for EOT; track alt EOT predicts 104 EOTTarget = (DFAState)edge.target; 108 edge.target.stateNumber+" predicates alt "+ 116 List labels = edge.label.getSet().toList(); 127 parentGenerator.genLabelExpr(templates,edge, [all...] |
H A D | CodeGenerator.java | 661 * edge. Generate a simple if-then-else. Cannot be an accept state as 678 Transition edge = (Transition) s.transition(i); 680 if ( edge.label.getAtom()==Label.EOT ) { 689 genLabelExpr(templates,edge,1); 694 Utils.integer(edge.target.stateNumber)); 695 // stick in any gated predicates for any edge if not already a pred 696 if ( !edge.label.isSemanticPredicate() ) { 697 DFAState t = (DFAState)edge.target; 707 if ( edge.label.getAtom()!=Label.EOT ) { 712 // state has >= 1 edge wit 723 genLabelExpr(STGroup templates, Transition edge, int k) argument 742 genSemanticPredicateExpr(STGroup templates, Transition edge) argument [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | DOTGenerator.java | 131 // make a DOT edge for each transition 133 Transition edge = (Transition) s.transition(i); 136 " edge from s"+s.stateNumber+" ["+i+"] of "+s.getNumberOfTransitions()); 139 if ( edge.target instanceof DFAState && 140 ((DFAState)edge.target).getAcceptStateReachable()!=DFA.REACHABLE_YES ) 145 st = stlib.getInstanceOf("edge"); 146 st.add("label", getEdgeLabel(edge)); 148 st.add("target", getStateLabel(edge.target)); 151 walkCreatingDFADOT(dot, (DFAState)edge.target); // keep walkin' 205 // make a DOT edge fo 284 getEdgeLabel(Transition edge) argument [all...] |
H A D | FASerializer.java | 97 // and then ordered by edge labels then by target state number :) 124 Transition edge = (Transition) s.transition(i); 125 walkFANormalizingStateNumbers(edge.target); // keep walkin' 128 // to it, but don't "draw" an edge. 129 if ( edge instanceof RuleClosureTransition ) { 130 walkFANormalizingStateNumbers(((RuleClosureTransition) edge).followState); 150 // depth first walk each transition, printing its edge first 152 Transition edge = (Transition) s.transition(i); 155 if ( edge.isAction() ) { 158 else if ( edge [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/ |
H A D | dot.stg | 55 edge(src,target,label,arrowhead) ::= <<
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/messages/languages/ |
H A D | en.stg | 261 ANTLR could not analyze this decision in rule <enclosingRule>; often this is because of recursive rule references visible from the left edge of alternatives. ANTLR will re-analyze the decision with a fixed lookahead of k=1. Consider using "options {k=1;}" for that decision and possibly adding a syntactic predicate.
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/ |
H A D | LoessInterpolator.java | 262 final int edge; 264 edge = ileft; 266 edge = iright; 281 double denom = FastMath.abs(1.0 / (xval[edge] - x)); 392 // The right edge should be adjusted if the next point to the right
|
/external/chromium-trace/catapult/common/py_vulcanize/py_vulcanize/ |
H A D | project.py | 226 edge = 'M%i -> M%i;' % (mFrom.id, mTo.id) 227 self.edges.append(edge)
|
/external/clang/lib/Headers/ |
H A D | opencl-c.h | 11386 * Returns 0.0 if x < edge, otherwise it returns 1.0. 11388 float __ovld __cnfn step(float edge, float x); 11389 float2 __ovld __cnfn step(float2 edge, float2 x); 11390 float3 __ovld __cnfn step(float3 edge, float3 x); 11391 float4 __ovld __cnfn step(float4 edge, float4 x); 11392 float8 __ovld __cnfn step(float8 edge, float8 x); 11393 float16 __ovld __cnfn step(float16 edge, float16 x); 11394 float2 __ovld __cnfn step(float edge, float2 x); 11395 float3 __ovld __cnfn step(float edge, float3 x); 11396 float4 __ovld __cnfn step(float edge, float [all...] |
/external/clang/utils/analyzer/ |
H A D | ubiviz | 35 elif action == 'edge': 38 edge = G.new_edge(src,dst) 40 G.set_edge_attribute(edge, attribute[0], attribute[1])
|
/external/conscrypt/benchmark-android/ |
H A D | vogar.jar | META-INF/ META-INF/MANIFEST.MF vogar/ vogar/TestProperties.class TestProperties.java package vogar ... |
/external/deqp/external/openglcts/modules/gl/ |
H A D | gl4cGPUShaderFP64Tests.cpp | 12280 static T step(T edge, T val); 12669 static T step(T edge, T val) argument 12671 if (edge > val)
|
H A D | gl4cShaderImageLoadStoreTests.cpp | 7192 TextureShapeDefinition(GLuint edge, GLuint n_elements, GLenum type) argument 7193 : m_edge(edge), m_n_elements(n_elements), m_type(type) 7268 TextureShapeDefinition(texture_edge /* edge */, 6 /* n_elements */, GL_TEXTURE_2D_ARRAY)); 7270 TextureShapeDefinition(texture_edge /* edge */, 6 /* n_elements */, GL_TEXTURE_3D)); 7272 TextureShapeDefinition(texture_edge /* edge */, 1 /* n_elements */, GL_TEXTURE_CUBE_MAP)); 7274 TextureShapeDefinition(texture_edge /* edge */, 3 /* n_elements */, GL_TEXTURE_CUBE_MAP_ARRAY)); 7456 * @param edge Length of texture edge 7462 bool CompareRGBA8Textures(GLuint left_texture_id, GLuint right_texture_id, GLuint edge, GLuint n_layers, argument 7466 const GLuint texture_data_size = edge * edg 7559 CreateRGBA8DestinationTexture(GLuint edge, GLuint n_elements, GLenum target, GLuint& out_texture_id) argument 7590 CreateRGBA8SourceTexture(GLuint edge, GLuint n_elements, GLenum target, GLuint& out_texture_id) argument 7645 CreateRGBA8Texture(GLuint edge, GLenum target, GLuint n_layers, const std::vector<GLubyte>& texture_data, GLuint& out_texture_id) argument 7725 ExtractTextureData(GLuint texture_id, GLuint edge, GLuint n_layers, GLenum target, std::vector<GLubyte>& texture_data) argument [all...] |
/external/deqp/external/openglcts/modules/glesext/tessellation_shader/ |
H A D | esextcTessellationShaderVertexSpacing.cpp | 158 /* First convert the array data to a vector of edges, where each edge 160 * points for each edge need to be sorted by U component. 164 /* Isolines are simple - we only need to create a new edge per each unique height */ 176 _tess_edge& edge = *edges_iterator; local 178 /* Each edge uses the same Y component, so we only need to check the first entry */ 179 if (de::abs(edge.points[0].y - coordinate[1]) < epsilon) 182 edge.points.push_back(new_item); 190 /* New edge starts at this point. 203 /* For each edge, sort the points by U coordinate */ 257 * data set to identify all points that are part of edges connecting the edge corner 428 _tess_edge& edge = *(edge_ptrs[n_edge]); local 486 _tess_edge& edge = *(edge_ptrs[n_edge]); local 505 _tess_edge& edge = *(edge_ptrs[n_edge]); local 726 const std::vector<_tess_coordinate_cartesian>& edge = *edge_ptrs[n_edge_ptr]; local 836 const std::vector<_tess_coordinate_cartesian>& edge = *edge_ptrs[n_edge_ptr]; local 1111 const _tess_edge& edge = *edges_iterator; local [all...] |
/external/deqp/external/vulkancts/modules/vulkan/shaderexecutor/ |
H A D | vktShaderBuiltinPrecisionTests.cpp | 3290 static double step (double edge, double x) argument 3292 return x < edge ? 0.0 : 1.0;
|
/external/deqp/framework/common/ |
H A D | tcuRasterizationVerifier.cpp | 1190 // image boundary, missing fragment could be over the image edge 2149 // a) too far from any edge 2156 const I64Vec2 edge = triangleSubPixelSpaceRound[otherVtxNdx] - triangleSubPixelSpaceRound[vtxNdx]; 2158 const deInt64 crossProduct = (edge.x() * v.y() - edge.y() * v.x()); 2160 // distance from edge: (edge x v) / |edge| 2161 // (edge x v) / |edge| > maxPixelDistanc [all...] |
H A D | tcuVectorUtil.hpp | 70 inline float step (float edge, float x) { return (x < edge) ? 0.0f : 1.0f; } argument 80 inline double step (double edge, double x) { return (x < edge) ? 0.0 : 1.0; } argument
|
/external/deqp/framework/referencerenderer/ |
H A D | rrRasterizer.cpp | 57 static inline void initEdgeCCW (EdgeFunction& edge, const HorizontalFill horizontalFill, const VerticalFill verticalFill, const deInt64 x0, const deInt64 y0, const deInt64 x1, const deInt64 y1) argument 70 edge.a = (y0 - y1); 71 edge.b = (x1 - x0); 72 edge.c = x0*y1 - y0*x1; 73 edge.inclusive = inclusive; //!< \todo [pyry] Swap for CW triangles 76 static inline void reverseEdge (EdgeFunction& edge) argument 78 edge.a = -edge.a; 79 edge.b = -edge 84 evaluateEdge(const EdgeFunction& edge, const deInt64 x, const deInt64 y) argument 89 isInsideCCW(const EdgeFunction& edge, const deInt64 edgeVal) argument [all...] |
/external/deqp/modules/gles2/scripts/ |
H A D | genutil.py | 187 def step(a, b): return (b.expandVec(a)).applyBinary(lambda edge, x: [1.0, 0.0][x < edge], a.expandVec(b))
|
/external/deqp/modules/gles3/scripts/ |
H A D | genutil.py | 197 def step(a, b): return (b.expandVec(a)).applyBinary(lambda edge, x: [1.0, 0.0][x < edge], a.expandVec(b))
|
/external/deqp/modules/gles31/scripts/ |
H A D | genutil.py | 197 def step(a, b): return (b.expandVec(a)).applyBinary(lambda edge, x: [1.0, 0.0][x < edge], a.expandVec(b))
|
/external/deqp/modules/glshared/ |
H A D | glsBuiltinPrecisionTests.cpp | 3375 static double step (double edge, double x) argument 3377 return x < edge ? 0.0 : 1.0;
|
/external/fio/tools/hist/ |
H A D | fiologparser_hist.py | 135 def _plat_idx_to_val(idx, edge=0.5, FIO_IO_U_PLAT_BITS=6, FIO_IO_U_PLAT_VAL=64): 140 edge : fractional value in the range [0,1]** indicating how far into 143 ** edge = 0.0 and 1.0 computes the lower and upper latency bounds 158 # Return the mean (if edge=0.5) of the range of the bucket 159 return base + ((k + edge) * (1 << error_bits)) 161 def plat_idx_to_val_coarse(idx, coarseness, edge=0.5): 171 lower = _plat_idx_to_val(idx, edge=0.0) 172 upper = _plat_idx_to_val(idx + stride, edge=1.0) 173 return lower + (upper - lower) * edge 191 lower_bin_vals = [] # lower edge o [all...] |
/external/flatbuffers/tests/fuzzer/ |
H A D | build_run_parser_test.sh | 17 clang++ -fsanitize-coverage=edge -fsanitize=address -std=c++11 -stdlib=libstdc++ -I.. -I../../include flatbuffers_parser_fuzzer.cc ../../src/idl_parser.cpp ../../src/util.cpp libFuzzer.a -o fuzz_parser
|