// Path: MaleRegexTree/src/it/units/inginf/male/tree/Node.java
// public interface Node {
//     
//     Node cloneTree();
// 
//     Node getParent();
//     void setParent(Node parent);
//     
//     int getMinChildrenCount();
//     int getMaxChildrenCount();
//     List<Node> getChildrens();
//     long getId();
//     
//     void describe(StringBuilder builder);
//     void describe(StringBuilder builder, DescriptionContext context, RegexFlavour flavour);
//     boolean isValid();
// 
//     public enum RegexFlavour {
//         JAVA,
//         CSHARP,
//         JS
//     }
//     public boolean isCharacterClass();
//     public boolean isEscaped();
// }


import it.units.inginf.male.tree.Node;
import java.util.ArrayList;
import java.util.Collection;
import java.util.HashSet;
import java.util.Set;
/*
 * Copyright (C) 2015 Machine Learning Lab - University of Trieste, 
 * Italy (http://machinelearning.inginf.units.it/)  
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
package it.units.inginf.male.utils;


/**
 *
 * @author MaleLabTs
 */
public class UniqueList<E> extends ArrayList<Node> {

    private Set<String> hashes = new HashSet<>();

    public UniqueList(int initialCapacity) {
        super(initialCapacity);
    }        

    @Override
    public boolean add(Node e) {
        StringBuilder builder = new StringBuilder();
        e.describe(builder);
        String hash = builder.toString();
        if (hashes.contains(hash)) {
            return false;
        }
        hashes.add(hash);
        return super.add(e);
    }   

    @Override
    public boolean addAll(Collection<? extends Node> c) {
        boolean ret = false;
// Path: MaleRegexTree/src/it/units/inginf/male/tree/Node.java
// public interface Node {
//     
//     Node cloneTree();
// 
//     Node getParent();
//     void setParent(Node parent);
//     
//     int getMinChildrenCount();
//     int getMaxChildrenCount();
//     List<Node> getChildrens();
//     long getId();
//     
//     void describe(StringBuilder builder);
//     void describe(StringBuilder builder, DescriptionContext context, RegexFlavour flavour);
//     boolean isValid();
// 
//     public enum RegexFlavour {
//         JAVA,
//         CSHARP,
//         JS
//     }
//     public boolean isCharacterClass();
//     public boolean isEscaped();
// }


// Path: Random Regex Turtle/src/it/units/inginf/male/utils/UniqueList.java
import it.units.inginf.male.tree.Node;
import java.util.ArrayList;
import java.util.Collection;
import java.util.HashSet;
import java.util.Set;

/*
 * Copyright (C) 2015 Machine Learning Lab - University of Trieste, 
 * Italy (http://machinelearning.inginf.units.it/)  
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
package it.units.inginf.male.utils;


/**
 *
 * @author MaleLabTs
 */
public class UniqueList<E> extends ArrayList<Node> {

    private Set<String> hashes = new HashSet<>();

    public UniqueList(int initialCapacity) {
        super(initialCapacity);
    }        

    @Override
    public boolean add(Node e) {
        StringBuilder builder = new StringBuilder();
        e.describe(builder);
        String hash = builder.toString();
        if (hashes.contains(hash)) {
            return false;
        }
        hashes.add(hash);
        return super.add(e);
    }   

    @Override
    public boolean addAll(Collection<? extends Node> c) {
        boolean ret = false;
        for(Node n:c){