Searched defs:hash (Results 1 - 4 of 4) sorted by relevance
/opengrok/src/org/opensolaris/opengrok/history/ |
H A D | GitTagEntry.java | 35 private final String hash; field in class:GitTagEntry 37 public GitTagEntry(String hash, Date date, String tags) { argument 39 this.hash = hash;
|
H A D | DirectoryHistoryReader.java | 71 // This is a giant hash constructed in this class. 73 private final Map<Date, Map<String, Map<List<String>, SortedSet<String>>>> hash field in class:DirectoryHistoryReader 88 * tree under @code path and storing their histories in giant @code hash. 155 // Put all history entries for this file into the giant hash. 162 // Now go through the giant hash and produce history entries from it. 187 // Fill the giant hash with some data from one history entry. 192 Map<String, Map<List<String>, SortedSet<String>>> ac = hash.get(date); 195 hash.put(date, ac); 218 * Do one traversal step of the giant hash and produce history entry object 226 diter = hash [all...] |
/opengrok/src/org/opensolaris/opengrok/web/ |
H A D | EftarFile.java | 64 public long hash; field in class:EftarFile.Node 71 public Node(long hash, String tag) { argument 72 this.hash = hash; 77 public Node put(long hash, String desc) { argument 78 if (children.get(hash) == null) { 79 children.put(hash, new Node(hash, desc)); 81 return children.get(hash); 84 public Node get(long hash) { argument 92 public long hash; field in class:EftarFile.FNode 105 FNode(long hash, long offset, int childOffset, int num, int tagOffset) argument 113 get(long hash, RandomAccessFile f) argument 120 sbinSearch(long start, int len, long hash, RandomAccessFile f) argument [all...] |
H A D | EftarFileReader.java | 54 public long hash; field in class:EftarFileReader.FNode 63 hash = f.readLong(); 74 public FNode(long hash, long offset, int childOffset, int num, int tagOffset) { argument 75 this.hash = hash; 82 public FNode get(long hash) throws IOException { argument 86 return binarySearch(offset + childOffset, numChildren, hash); 89 private FNode binarySearch(long start, int len, long hash) throws IOException { argument 90 //System.err.printf(" Searching [%x] in %5d elem from %x\n", hash, len, start); 97 if (hash > mhas [all...] |
Completed in 120 milliseconds