| /* |
| * Licensed to the Apache Software Foundation (ASF) under one or more |
| * contributor license agreements. See the NOTICE file distributed with |
| * this work for additional information regarding copyright ownership. |
| * The ASF licenses this file to You under the Apache License, Version 2.0 |
| * (the "License"); you may not use this file except in compliance with |
| * the License. You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| package org.apache.lucene.util.fst; |
| |
| |
| import java.io.IOException; |
| |
| import org.apache.lucene.util.packed.PackedInts; |
| import org.apache.lucene.util.packed.PagedGrowableWriter; |
| |
| // Used to dedup states (lookup already-frozen states) |
| final class NodeHash<T> { |
| |
| private PagedGrowableWriter table; |
| private long count; |
| private long mask; |
| private final FST<T> fst; |
| private final FST.Arc<T> scratchArc = new FST.Arc<>(); |
| private final FST.BytesReader in; |
| |
| public NodeHash(FST<T> fst, FST.BytesReader in) { |
| table = new PagedGrowableWriter(16, 1<<27, 8, PackedInts.COMPACT); |
| mask = 15; |
| this.fst = fst; |
| this.in = in; |
| } |
| |
| private boolean nodesEqual(Builder.UnCompiledNode<T> node, long address) throws IOException { |
| fst.readFirstRealTargetArc(address, scratchArc, in); |
| |
| // Fail fast for a node with fixed length arcs. |
| if (scratchArc.bytesPerArc() != 0) { |
| if (scratchArc.nodeFlags() == FST.ARCS_FOR_BINARY_SEARCH) { |
| if (node.numArcs != scratchArc.numArcs()) { |
| return false; |
| } |
| } else { |
| assert scratchArc.nodeFlags() == FST.ARCS_FOR_DIRECT_ADDRESSING; |
| if ((node.arcs[node.numArcs - 1].label - node.arcs[0].label + 1) != scratchArc.numArcs() |
| || node.numArcs != FST.Arc.BitTable.countBits(scratchArc, in)) { |
| return false; |
| } |
| } |
| } |
| |
| for(int arcUpto=0; arcUpto < node.numArcs; arcUpto++) { |
| final Builder.Arc<T> arc = node.arcs[arcUpto]; |
| if (arc.label != scratchArc.label() || |
| !arc.output.equals(scratchArc.output()) || |
| ((Builder.CompiledNode) arc.target).node != scratchArc.target() || |
| !arc.nextFinalOutput.equals(scratchArc.nextFinalOutput()) || |
| arc.isFinal != scratchArc.isFinal()) { |
| return false; |
| } |
| |
| if (scratchArc.isLast()) { |
| if (arcUpto == node.numArcs-1) { |
| return true; |
| } else { |
| return false; |
| } |
| } |
| fst.readNextRealArc(scratchArc, in); |
| } |
| |
| return false; |
| } |
| |
| // hash code for an unfrozen node. This must be identical |
| // to the frozen case (below)!! |
| private long hash(Builder.UnCompiledNode<T> node) { |
| final int PRIME = 31; |
| //System.out.println("hash unfrozen"); |
| long h = 0; |
| // TODO: maybe if number of arcs is high we can safely subsample? |
| for (int arcIdx=0; arcIdx < node.numArcs; arcIdx++) { |
| final Builder.Arc<T> arc = node.arcs[arcIdx]; |
| //System.out.println(" label=" + arc.label + " target=" + ((Builder.CompiledNode) arc.target).node + " h=" + h + " output=" + fst.outputs.outputToString(arc.output) + " isFinal?=" + arc.isFinal); |
| h = PRIME * h + arc.label; |
| long n = ((Builder.CompiledNode) arc.target).node; |
| h = PRIME * h + (int) (n^(n>>32)); |
| h = PRIME * h + arc.output.hashCode(); |
| h = PRIME * h + arc.nextFinalOutput.hashCode(); |
| if (arc.isFinal) { |
| h += 17; |
| } |
| } |
| //System.out.println(" ret " + (h&Integer.MAX_VALUE)); |
| return h & Long.MAX_VALUE; |
| } |
| |
| // hash code for a frozen node |
| private long hash(long node) throws IOException { |
| final int PRIME = 31; |
| //System.out.println("hash frozen node=" + node); |
| long h = 0; |
| fst.readFirstRealTargetArc(node, scratchArc, in); |
| while(true) { |
| // System.out.println(" label=" + scratchArc.label + " target=" + scratchArc.target + " h=" + h + " output=" + fst.outputs.outputToString(scratchArc.output) + " next?=" + scratchArc.flag(4) + " final?=" + scratchArc.isFinal() + " pos=" + in.getPosition()); |
| h = PRIME * h + scratchArc.label(); |
| h = PRIME * h + (int) (scratchArc.target() ^(scratchArc.target() >>32)); |
| h = PRIME * h + scratchArc.output().hashCode(); |
| h = PRIME * h + scratchArc.nextFinalOutput().hashCode(); |
| if (scratchArc.isFinal()) { |
| h += 17; |
| } |
| if (scratchArc.isLast()) { |
| break; |
| } |
| fst.readNextRealArc(scratchArc, in); |
| } |
| //System.out.println(" ret " + (h&Integer.MAX_VALUE)); |
| return h & Long.MAX_VALUE; |
| } |
| |
| public long add(Builder<T> builder, Builder.UnCompiledNode<T> nodeIn) throws IOException { |
| //System.out.println("hash: add count=" + count + " vs " + table.size() + " mask=" + mask); |
| final long h = hash(nodeIn); |
| long pos = h & mask; |
| int c = 0; |
| while(true) { |
| final long v = table.get(pos); |
| if (v == 0) { |
| // freeze & add |
| final long node = fst.addNode(builder, nodeIn); |
| //System.out.println(" now freeze node=" + node); |
| assert hash(node) == h : "frozenHash=" + hash(node) + " vs h=" + h; |
| count++; |
| table.set(pos, node); |
| // Rehash at 2/3 occupancy: |
| if (count > 2*table.size()/3) { |
| rehash(); |
| } |
| return node; |
| } else if (nodesEqual(nodeIn, v)) { |
| // same node is already here |
| return v; |
| } |
| |
| // quadratic probe |
| pos = (pos + (++c)) & mask; |
| } |
| } |
| |
| // called only by rehash |
| private void addNew(long address) throws IOException { |
| long pos = hash(address) & mask; |
| int c = 0; |
| while(true) { |
| if (table.get(pos) == 0) { |
| table.set(pos, address); |
| break; |
| } |
| |
| // quadratic probe |
| pos = (pos + (++c)) & mask; |
| } |
| } |
| |
| private void rehash() throws IOException { |
| final PagedGrowableWriter oldTable = table; |
| |
| table = new PagedGrowableWriter(2*oldTable.size(), 1<<30, PackedInts.bitsRequired(count), PackedInts.COMPACT); |
| mask = table.size()-1; |
| for(long idx=0;idx<oldTable.size();idx++) { |
| final long address = oldTable.get(idx); |
| if (address != 0) { |
| addNew(address); |
| } |
| } |
| } |
| |
| } |