// 
// Decompiled by Procyon v0.6.0
// 

package ch.randelshofer.fastdoubleparser.bte;

import java.nio.charset.StandardCharsets;
import java.util.Iterator;
import java.util.Set;

final class ByteTrieOfFewIgnoreCase implements ByteTrie
{
    private ByteTrieNode root;
    
    public ByteTrieOfFewIgnoreCase(final Set<String> set) {
        this.root = new ByteTrieNode();
        for (final String str : set) {
            if (!str.isEmpty()) {
                this.add(str);
            }
        }
    }
    
    private void add(final String str) {
        ByteTrieNode upperNode = this.root;
        ByteTrieNode lowerNode = this.root;
        final String upperStr = str.toUpperCase();
        final String lowerStr = upperStr.toLowerCase();
        for (int i = 0; i < str.length(); ++i) {
            final byte[] upper = upperStr.substring(i, i + 1).getBytes(StandardCharsets.UTF_8);
            final byte[] lower = lowerStr.substring(i, i + 1).getBytes(StandardCharsets.UTF_8);
            for (int u = 0; u < upper.length; ++u) {
                upperNode = upperNode.insert(upper[u]);
            }
            for (int l = 0; l < upper.length - 1; ++l) {
                lowerNode = lowerNode.insert(lower[l]);
            }
            lowerNode = lowerNode.insert(lower[lower.length - 1], upperNode);
        }
        upperNode.setEnd();
    }
    
    @Override
    public int match(final byte[] str, final int startIndex, final int endIndex) {
        ByteTrieNode node = this.root;
        int longestMatch = startIndex;
        for (int i = startIndex; i < endIndex; ++i) {
            node = node.get(str[i]);
            if (node == null) {
                break;
            }
            longestMatch = (node.isEnd() ? (i + 1) : longestMatch);
        }
        return longestMatch - startIndex;
    }
}