List of simplify() Examples

Examples of simplify()

aima.core.logic.fol.inference.otter.defaultimpl.DefaultClauseSimplifier.simplify()
client.net.sf.saxon.ce.expr.Expression.simplify()
Simplify an expression. This performs any static optimization (by rewriting the expression as a different expression). The default implementation does nothing. @exception client.net.sf.saxon.ce.trans.XPathException if an error is discovered during expressionrewriting @return the simplified expression @param visitor an expression visitor
client.net.sf.saxon.ce.expr.ExpressionVisitor.simplify()
Simplify an expression, via the ExpressionVisitor @param exp the expression to be simplified @return the simplified expression @throws XPathException
com.google.javascript.jscomp.regex.RegExpTree.simplify()
Returns a simpler regular expression that is semantically the same assuming the given flags. @param flags Regular expression flags, e.g. {@code "igm"}.
dk.brics.string.flow.FlowGraph.simplify()
See {@link Simplifier#simplify(FlowGraph)}.
eas.simulation.spatial.sim2D.marbSimulation.endlAutomat.conditions.Condition.simplify()
Vereinfacht die Bedingung. Dabei wird folgende Normalform N erzeugt (die die semantische Ausdruckskraft der Bedingung nicht einschr�nkt):

N ::= true | false | C
C ::= H comp B | H comp H | (C op C)
H ::= h1 | h2 | ...
B ::= 1 | 2 | ... | 255
comp ::= < |> | = | ! | [ | ] | ~ | #
op ::= UND | ODER

N.b. Insbesondere kommen true und false nicht in zusammengesetzten Bedingungen vor (auch nicht in Form von Vergleichen zwischen zwei Byte-Werten; zu beachten ist jedoch, dass stets oder niemals wahre Teilbedingungen trotzdem vorkommen können, bspw. als "h1 <= 255"). @return Die vereinfachte Bedingung.
eas.simulation.spatial.sim2D.marbSimulation.endlAutomat.conditions.ConstLeaf.simplify()
Ein Objekt dieser Klasse ist bereits vereinfacht. @return this.
fmg.fmg8.endlAutomat.conditions.Condition.simplify()
Vereinfacht die Bedingung. Dabei wird folgende Normalform N erzeugt (die die semantische Ausdruckskraft der Bedingung nicht einschr�nkt):

N ::= true | false | C
C ::= H comp B | H comp H | (C op C)
H ::= h1 | h2 | ...
B ::= 1 | 2 | ... | 255
comp ::= < |> | = | ! | [ | ] | ~ | #
op ::= UND | ODER

N.b. Insbesondere kommen true und false nicht in zusammengesetzten Bedingungen vor (auch nicht in Form von Vergleichen zwischen zwei Byte-Werten; zu beachten ist jedoch, dass stets oder niemals wahre Teilbedingungen trotzdem vorkommen k�nnen, bspw. als "h1 <= 255"). @return Die vereinfachte Bedingung.
fmg.fmg8.endlAutomat.conditions.ConstLeaf.simplify()
Ein Objekt dieser Klasse ist bereits vereinfacht. @return this.
net.sf.saxon.expr.Atomizer.simplify()
Simplify an expression @param visitor an expression visitor
net.sf.saxon.expr.Expression.simplify()
Simplify an expression. This performs any static optimization (by rewriting the expression as a different expression). The default implementation does nothing. @exception net.sf.saxon.trans.XPathException if an error is discovered during expressionrewriting @return the simplified expression @param visitor an expression visitor
net.sf.saxon.expr.ExpressionVisitor.simplify()
Simplify an expression, via the ExpressionVisitor @param exp the expression to be simplified @return the simplified expression @throws XPathException
net.sf.saxon.functions.Concat.simplify()
net.sf.saxon.instruct.Block.simplify()
Simplify an expression. This performs any static optimization (by rewriting the expression as a different expression). The default implementation does nothing. @exception XPathException if an error is discovered during expressionrewriting @return the simplified expression @param visitor an expression visitor
net.sf.saxon.sort.Reverser.simplify()
org.broadinstitute.gatk.utils.sam.GATKSAMRecord.simplify()
Clears all attributes except ReadGroup of the read.
org.pdf4j.saxon.expr.ExpressionVisitor.simplify()
Simplify an expression, via the ExpressionVisitor @param exp the expression to be simplified @return the simplified expression @throws XPathException
org.sbml.jsbml.UnitDefinition.simplify()
@param ud @return a simplified version of the given {@link UnitDefinition}. In order to make sure that the original {@link UnitDefinition} is notchanged, it is cloned before the simplification.

Examples of aima.core.logic.fol.inference.otter.defaultimpl.DefaultClauseSimplifier.simplify()


    CNF cnf = cnfConverter.convertToCNF(s1);


    Assert.assertEquals(1, cnf.getNumberOfClauses());


    Clause simplified = simplifier.simplify(cnf.getConjunctionOfClauses()
        .get(0));


    Assert.assertEquals("[P(y,y), P(y,ONE), P(ONE,y)]",
        simplified.toString());
  }

View Full Code Here

Examples of client.net.sf.saxon.ce.expr.Expression.simplify()

            ExpressionVisitor visitor = makeExpressionVisitor();
            return new AnalyzeString(select,
                                     regex,
                                     flags,
                                     (matchingBlock==null ? null : matchingBlock.simplify(visitor)),
                                     (nonMatchingBlock==null ? null : nonMatchingBlock.simplify(visitor)));
        } catch (XPathException e) {
            compileError(e);
            return null;
        }
    }

View Full Code Here

Examples of client.net.sf.saxon.ce.expr.ExpressionVisitor.simplify()

            }


            try {


                ExpressionVisitor visitor = makeExpressionVisitor();
                body = visitor.simplify(body);


                procedure.setUseAttributeSets(useAttributeSets);
                procedure.setName(getObjectName());
                procedure.setBody(body);
                procedure.setSourceLocator(this);

View Full Code Here

Examples of com.google.javascript.jscomp.regex.RegExpTree.simplify()

        regexTree = RegExpTree.parseRegExp(pattern, flags);
      } catch (IllegalArgumentException ex) {
        // Warnings are propagated in the CheckRegExp pass.
        return subtree;
      }
      regexTree = regexTree.simplify(flags);
      // Decompose the AST.
      String literal = regexTree.toString();
      String newPattern = literal.substring(1, literal.length() - 1);
      // Remove unnecessary flags and order them consistently for gzip.
      String newFlags = (

View Full Code Here

Examples of com.google.javascript.jscomp.regex.RegExpTree.simplify()

        regexTree = RegExpTree.parseRegExp(pattern, flags);
      } catch (IllegalArgumentException ex) {
        // Warnings are propagated in the CheckRegExp pass.
        return subtree;
      }
      regexTree = regexTree.simplify(flags);
      // Decompose the AST.
      String literal = regexTree.toString();
      String newPattern = literal.substring(1, literal.length() - 1);
      // Remove unnecessary flags and order them consistently for gzip.
      String newFlags = (

View Full Code Here

Examples of dk.brics.string.flow.FlowGraph.simplify()

            for (Map.Entry<Statement, Node> me : m2.entrySet()) {
                log.debug("  " + me.getKey() + " -> " + me.getValue());
            }
        }
        log.info("Simplifying flow graph...");
        Map<Node, Node> m3 = g.simplify();
        Set<Node> nodes = new HashSet<Node>();
        for (Statement ss : hotspot_statements) {
            Node beforeSimplifyNode = m2.get(ss);
            Node n = m3.get(beforeSimplifyNode);
            if (n != null) {

View Full Code Here

Examples of eas.simulation.spatial.sim2D.marbSimulation.endlAutomat.conditions.Condition.simplify()

                        cZwisch[j], 
                        eas.simulation.spatial.sim2D.marbSimulation.Konstanten.UND);
            }
        }
        
        c = c.simplify();
        
        // BO
//        System.out.println();
//        System.out.println(
//            aut.holeKnoten(quellKnotNam).getInfo().getBedingungen());

View Full Code Here

Examples of eas.simulation.spatial.sim2D.marbSimulation.endlAutomat.conditions.ConstLeaf.simplify()

                    cond, 
                    zwisch, 
                    eas.simulation.spatial.sim2D.marbSimulation.Konstanten.UND);
        }
        
        cond = cond.simplify();
        
        if (!cond.equals(new ConstLeaf(false))) {
            this.einfuegKante(kn1, kn2, cond, 1);
        }
    }

View Full Code Here

Examples of fmg.fmg8.endlAutomat.conditions.Condition.simplify()

                        cZwisch[j], 
                        fmg.fmg8.endlAutomat.Konstanten.UND);
            }
        }
        
        c = c.simplify();
        
        // BO
//        System.out.println();
//        System.out.println(
//            aut.holeKnoten(quellKnotNam).getInfo().getBedingungen());

View Full Code Here

Examples of fmg.fmg8.endlAutomat.conditions.ConstLeaf.simplify()

                        getBedingungen().get(i).getCond().formatted());
            zwisch.negiere();
            cond = new InnerNode(cond, zwisch, endlicherAutomat.Konstanten.UND);
        }
        
        cond = cond.simplify();
        
        if (!cond.equals(new ConstLeaf(false))) {
            this.einfuegKante(kn1, kn2, cond, 1);
        }
    }

View Full Code Here

0 1 2 3

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.