Examples of Permutation

bnGUI.venn.geometry.Permutation
@author muellera
cc.redberry.core.combinatorics.Permutation
kipedia.org/wiki/Permutation">http://en.wikipedia.org/wiki/Permutation). For keeping permutation it uses one-line notation. Instances of this class are immutable. {@link Comparable} implementation is necessary for using{@link TreeMap} of combinatorics in {@link PermutationsSpanIterator} @see Comparable @see PermutationsSpanIterator @author Dmitry Bolotin @author Stanislav Poslavsky
cc.redberry.core.groups.permutations.Permutation
@author Dmitry Bolotin @author Stanislav Poslavsky
com.google.gwt.dev.Permutation
Represents the state of a single permutation for compile.
infovis.utils.Permutation
ivory.lsh.data.Permutation
org.bouncycastle.pqc.math.linearalgebra.Permutation
This class implements permutations of the set {0,1,...,n-1} for some given n > 0, i.e., ordered sequences containing each number m (0 <= m < n) once and only once.
org.eigenbase.util.Permutation
Represents a mapping which reorders elements in an array.
org.teiid.query.util.Permutation

Examples of org.bouncycastle.pqc.math.linearalgebra.Permutation

        this.n = n;
        this.k = k;
        field = new GF2mField(encField);
        goppaPoly = new PolynomialGF2mSmallM(field, encGoppaPoly);
        sInv = new GF2Matrix(encSInv);
        p1 = new Permutation(encP1);
        p2 = new Permutation(encP2);
        h = new GF2Matrix(encH);
        qInv = new PolynomialGF2mSmallM[encQInv.length];
        for (int i = 0; i < encQInv.length; i++)
        {
            qInv[i] = new PolynomialGF2mSmallM(field, encQInv[i]);

View Full Code Here

Examples of org.bouncycastle.pqc.math.linearalgebra.Permutation

        GF2Matrix h = GoppaCode.createCanonicalCheckMatrix(field, gp);


        // compute short systematic form of check matrix
        MaMaPe mmp = GoppaCode.computeSystematicForm(h, random);
        GF2Matrix shortH = mmp.getSecondMatrix();
        Permutation p1 = mmp.getPermutation();


        // compute short systematic form of generator matrix
        GF2Matrix shortG = (GF2Matrix)shortH.computeTranspose();


        // extend to full systematic form
        GF2Matrix gPrime = shortG.extendLeftCompactForm();


        // obtain number of rows of G (= dimension of the code)
        int k = shortG.getNumRows();


        // generate random invertible (k x k)-matrix S and its inverse S^-1
        GF2Matrix[] matrixSandInverse = GF2Matrix
            .createRandomRegularMatrixAndItsInverse(k, random);


        // generate random permutation P2
        Permutation p2 = new Permutation(n, random);


        // compute public matrix G=S*G'*P2
        GF2Matrix g = (GF2Matrix)matrixSandInverse[0].rightMultiply(gPrime);
        g = (GF2Matrix)g.rightMultiply(p2);

View Full Code Here

Examples of org.bouncycastle.pqc.math.linearalgebra.Permutation

        return new PolynomialGF2mSmallM(this.getField(), encGp);
    }


    public Permutation getP()
    {
        return new Permutation(encP);
    }

View Full Code Here

Examples of org.bouncycastle.pqc.math.linearalgebra.Permutation

        this.oid = oid;
        this.n = n;
        this.k = k;
        field = new GF2mField(encFieldPoly);
        goppaPoly = new PolynomialGF2mSmallM(field, encGoppaPoly);
        p = new Permutation(encP);
        h = new GF2Matrix(encH);
        qInv = new PolynomialGF2mSmallM[encQInv.length];
        for (int i = 0; i < encQInv.length; i++)
        {
            qInv[i] = new PolynomialGF2mSmallM(field, encQInv[i]);

View Full Code Here

Examples of org.bouncycastle.pqc.math.linearalgebra.Permutation

        this.n = n;
        this.k = k;
        field = new GF2mField(encField);
        goppaPoly = new PolynomialGF2mSmallM(field, encGoppaPoly);
        sInv = new GF2Matrix(encSInv);
        p1 = new Permutation(encP1);
        p2 = new Permutation(encP2);
        h = new GF2Matrix(encH);
        qInv = new PolynomialGF2mSmallM[encQInv.length];
        for (int i = 0; i < encQInv.length; i++)
        {
            qInv[i] = new PolynomialGF2mSmallM(field, encQInv[i]);

View Full Code Here

Examples of org.bouncycastle.pqc.math.linearalgebra.Permutation

        return new GF2Matrix(encSInv);
    }


    public Permutation getP1()
    {
        return new Permutation(encP1);
    }

View Full Code Here

Examples of org.bouncycastle.pqc.math.linearalgebra.Permutation

        return new Permutation(encP1);
    }


    public Permutation getP2()
    {
        return new Permutation(encP2);
    }

View Full Code Here

Examples of org.eigenbase.util.Permutation

    ProjectRelBase bottomProject = call.rel(1);
    RexBuilder rexBuilder = topProject.getCluster().getRexBuilder();


    // If one or both projects are permutations, short-circuit the complex logic
    // of building a RexProgram.
    final Permutation topPermutation = topProject.getPermutation();
    if (topPermutation != null) {
      if (topPermutation.isIdentity()) {
        // Let RemoveTrivialProjectRule handle this.
        return;
      }
      final Permutation bottomPermutation = bottomProject.getPermutation();
      if (bottomPermutation != null) {
        if (bottomPermutation.isIdentity()) {
          // Let RemoveTrivialProjectRule handle this.
          return;
        }
        final Permutation product = topPermutation.product(bottomPermutation);
        call.transformTo(
            RelOptUtil.projectMapping(bottomProject.getChild(),
                product.inverse(), topProject.getRowType().getFieldNames(),
                projectFactory));
        return;
      }
    }

View Full Code Here

Examples of org.eigenbase.util.Permutation

  public Permutation getPermutation() {
    final int fieldCount = rowType.getFieldList().size();
    if (fieldCount != getChild().getRowType().getFieldList().size()) {
      return null;
    }
    Permutation permutation = new Permutation(fieldCount);
    for (int i = 0; i < fieldCount; ++i) {
      final RexNode exp = exps.get(i);
      if (exp instanceof RexInputRef) {
        permutation.set(i, ((RexInputRef) exp).getIndex());
      } else {
        return null;
      }
    }
    return permutation;

View Full Code Here

Examples of org.eigenbase.util.Permutation

      throw new AssertionError();


    if( !unique( program.getOutputRowType().getFieldNames() ) )
      throw new AssertionError();


    final Permutation permutation = program.getPermutation();


    if( permutation == null )
      throw new AssertionError();


    Fields incomingFields = createTypedFields( cluster, Mappings.apply( permutation.inverse(), program.getInputRowType().getFieldList() ), false );
    Fields renameFields = createTypedFieldsSelector( cluster, program.getOutputRowType(), false );


    return new Rename( pipe, incomingFields, renameFields );
    }

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.