public static String toString(final TreeString t) { return t == null ? null : t.toString(); }
public boolean isBlank() { return StringUtils.isBlank(toString()); }
@Override public int hashCode() { int h = parent == null ? 0 : parent.hashCode(); for (int i = 0; i < label.length; i++) { h = 31 * h + label[i]; } assert toString().hashCode() == h; return h; }
/** * Interns a {@link TreeString} created elsewhere. */ public TreeString intern(final TreeString s) { if (s==null) return null; return root.intern(s.toString()).node; }
public static String toString(final TreeString t) { return t == null ? null : t.toString(); }
public boolean isBlank() { return StringUtils.isBlank(toString()); }
@Override public int hashCode() { int h = parent == null ? 0 : parent.hashCode(); for (int i = 0; i < label.length; i++) { h = 31 * h + label[i]; } assert toString().hashCode() == h; return h; }
/** * Interns a {@link TreeString} created elsewhere. */ public TreeString intern(final TreeString s) { if (s==null) return null; return root.intern(s.toString()).node; }