Examples of pspdash.data.HashTree

pspdash.data.HashTree
Implements a specialized hashtable. Keys must be strings, but values can be of any type. Neither keys nor values may be null. Key strings are assumed to contain frequent instances of the '/' character. Keys are split apart on these '/' characters, and a hierarchically nested tree of hashtables is used to store the results.

    }
    
    private static HashTree getContext(HashTree base, String path) {
        String fakeItem = path + "foo";
        base.put(fakeItem, "bar");
        HashTree result = (HashTree) base.get(path);
        base.remove(fakeItem);
        return result;
    }

View Full Code Here

        
        Set keys = new HashSet();
        
        for (int i = 0; i < prefixes.length; i++) {
            String prefix = prefixes[i] + "/";
            HashTree context = (HashTree) importedDefects.get(prefix);
            if (context != null) {
                Iterator j = context.getAllKeys();
                while (j.hasNext())
                    keys.add(prefix + j.next());
            }
        }

View Full Code Here

TOP

Related Classes of pspdash.data.HashTree

pspdash.DefectImporter

java.util.NoSuchElementException

java.util.Iterator

java.util.HashMap

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.