All Downloads are FREE. Search and download functionalities are using the official Maven repository.

shz.core.st.triest.JTrieST Maven / Gradle / Ivy

There is a newer version: 2024.0.2
Show newest version
package shz.core.st.triest;

import shz.core.queue.a.JArrayQueue;
import shz.core.queue.a.LArrayQueue;
import shz.core.stack.l.LLinkedStack;

import java.util.function.LongPredicate;

/**
 * 值为long类型的基于单词查找树的符号表
 * 

* 8+24+2*r(r为chars数组长度)=chars * 8+(56+8*r)*n(n为元素个数)+8*r*n*w(w为键的平均长度) *

* B=56*(n+1)+8*r*n*(w+1)+(2*r+对齐填充) */ public class JTrieST extends TrieST { private static final long serialVersionUID = -259062836843458712L; /** * 8+25+8*r(r为数组长度)+对齐填充=40+8*r *

* B=56+8*r */ protected static final class Node extends TrieST.Node { private static final long serialVersionUID = -3994250721408195428L; public long val; public Node(int r) { super(new Node[r]); } } public JTrieST(char[] chars) { super(chars); root = new Node(chars.length); } public static JTrieST of(char[] chars) { return new JTrieST(chars); } public final void put(char[] a, long val) { Node x = root; for (char c : a) { int i = charIndex.idx(c); if (x.next[i] == null) x.next[i] = new Node(len); x = x.next[i]; } x.val = val; x.leaf = true; } public final Long get(char[] a, int d) { Node x = get(root, a, d); return x == null || !x.leaf ? null : x.val; } public final Long get(char[] a) { return get(a, a.length); } public final JArrayQueue getAll() { return get(root); } protected final JArrayQueue get(Node x) { JArrayQueue queue = JArrayQueue.of(); if (x != null) { LLinkedStack stack = LLinkedStack.of(); push(stack, x); while (!stack.isEmpty()) { Node pop = stack.pop(); if (pop.leaf) queue.offer(pop.val); push(stack, pop); } } return queue; } private void push(LLinkedStack stack, Node x) { if (x.next == null) return; for (int i = 0; i < len; ++i) if (x.next[i] != null) stack.push(x.next[i]); } public final JArrayQueue getByPrefix(char[] prefix) { return get(get(root, prefix, prefix.length)); } public final LArrayQueue getChars(LongPredicate predicate, int limit) { return getChars0(x -> predicate == null || predicate.test(x.val), limit); } }





© 2015 - 2025 Weber Informatics LLC | Privacy Policy