Examples of cc.redberry.core.combinatorics.Symmetry

cc.redberry.core.combinatorics.Symmetry
This class represents a permutational symmetry, i.e. a permutation and its sign (+1 or -1). The sign of a composition of two symmetries is a product of their signs. @author Dmitry Bolotin @author Stanislav Poslavsky @see Permutation @see cc.redberry.core.indices.Indices @see cc.redberry.core.indices.IndicesSymmetries @see cc.redberry.core.combinatorics.symmetries.Symmetries @since 1.0

        Map<IntArray, Boolean> symmetries = cachedLeviCivitaSymmetries.get(indicesSize);
        if (symmetries != null)
            return symmetries;
        symmetries = new HashMap<>();
        Symmetries ss = SymmetriesFactory.createSymmetries(indicesSize);
        ss.addUnsafe(new Symmetry(Combinatorics.createTransposition(indicesSize, 0, 1), true));
        if (indicesSize % 2 == 0)
            ss.addUnsafe(new Symmetry(Combinatorics.createCycle(indicesSize), true));
        else
            ss.addUnsafe(new Symmetry(Combinatorics.createCycle(indicesSize), false));
        for (Symmetry symmetry : ss)
            symmetries.put(symmetry.getPermutation(), symmetry.isAntiSymmetry());
        cachedLeviCivitaSymmetries.put(indicesSize, symmetries);
        return symmetries;
    }

View Full Code Here

                continue;
            if (typeData.length == 0)//redundant
                continue;
            int count = random.nextInt(4);
            for (i = 0; i < count; ++i)
                descriptor.getSymmetries().addUnsafe(type, new Symmetry(nextPermutation(typeData.length), false));
        }
    }

View Full Code Here

        }


        if (symmetryIterator != null) {
            OUT:
            while (symmetryIterator.hasNext()) {
                Symmetry s = symmetryIterator.next();
                IndexMappingBuffer tempBuffer = currentBuffer.clone();
                for (int i = 0; i < size; ++i)
                    if (!tempBuffer.tryMap(fromIndices.get(s.newIndexOf(i)), toIndices.get(i)))
                        continue OUT;
                tempBuffer.addSign(s.isAntiSymmetry());
                return tempBuffer;
            }
            symmetryIterator = null;
            currentBuffer = null;
            return null;

View Full Code Here

                //adding symmetries for indices from each slot
                cycle = Combinatorics.createBlockCycle(structuresOfIndices[i + 1].size(), 2);
                aggregator.addAll(mapping[j]);
                aggregator.addAll(mapping[j + 1]);
                symmetries.addUnsafe(
                        new Symmetry(Combinatorics.convertPermutation(cycle, aggregator.toArray(), baseStructure.size()), false));


                if (orders[i] >= 3) {
                    for (k = 2; k < orders[i]; ++k)
                        aggregator.addAll(mapping[j + k]);


                    cycle = Combinatorics.createBlockCycle(structuresOfIndices[i + 1].size(), orders[i]);
                    symmetries.addUnsafe(
                            new Symmetry(Combinatorics.convertPermutation(cycle, aggregator.toArray(), baseStructure.size()), false));
                }
                aggregator.clear();
            }
            j += orders[i];
        }

View Full Code Here

                    IndicesUtils.getNameWithType(_toIndices.get(positionInFrom)));


            if (positionInIndices < 0)
//                 throw new IllegalArgumentException();
//                todo review
                return new Symmetry(dimension);


            permutation[_sortPermutation[i]] = _sortPermutation[positionInIndices];
        }
        for (i = 0; i < dimension; ++i)
            if (permutation[i] == -1)
                permutation[i] = i;


        return new Symmetry(permutation, mapping.getSign()); //this is inverse permutation
    }

View Full Code Here

     * @throws InconsistentGeneratorsException
     *                                  if the specified symmetry is
     *                                  inconsistent with already defined
     */
    public boolean add(IndexType type, boolean sign, int... permutation) {
        return add(type.getType(), new Symmetry(permutation, sign));
    }

View Full Code Here

     * @throws InconsistentGeneratorsException
     *                                  if the specified symmetry is
     *                                  inconsistent with already defined
     */
    public boolean add(byte type, boolean sign, int... permutation) {
        return add(type, new Symmetry(permutation, sign));
    }

View Full Code Here

                    throw new IllegalArgumentException();
                type = (byte) i;
            }
        }
        if (unsafe)
            return addUnsafe(type, new Symmetry(permutation, sign));
        else
            return add(type, new Symmetry(permutation, sign));
    }

View Full Code Here

        for (int j = 0; j < data.length; ++j, ++i)
            s[i] = symmetry.newIndexOf(j) + data.from;
        for (; i < structureOfIndices.size(); ++i)
            s[i] = i;
        try {
            if (symmetries.add(new Symmetry(s, symmetry.isAntiSymmetry()))) {
                diffIds = null;
                return true;
            }
            return false;
        } catch (InconsistentGeneratorsException exception) {

View Full Code Here

            s[i] = i;
        for (int j = 0; j < data.length; ++j, ++i)
            s[i] = symmetry.newIndexOf(j) + data.from;
        for (; i < structureOfIndices.size(); ++i)
            s[i] = i;
        symmetries.addUnsafe(new Symmetry(s, symmetry.isAntiSymmetry()));
        return true;
    }

View Full Code Here

0 1 2 3 4 5 6 7

TOP

Related Classes of cc.redberry.core.combinatorics.Symmetry

cc.redberry.core.combinatorics.symmetries.EmptySymmetries

cc.redberry.core.combinatorics.symmetries.FullSymmetries

cc.redberry.core.combinatorics.symmetries.SymmetriesFactory

cc.redberry.core.combinatorics.symmetries.SymmetriesImpl

cc.redberry.core.context.Context

cc.redberry.core.context.Context$MetricKroneckerListener

cc.redberry.core.context.NameDescriptorForTensorFieldDerivative

cc.redberry.core.indexmapping.IndexMappingUtils

cc.redberry.core.indexmapping.ProviderSimpleTensor

cc.redberry.core.indices.IndicesBuilderSimple

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.