Package net.yacy.kelondro.data.word

Examples of net.yacy.kelondro.data.word.WordReference.urlhash()

119
120
121
122
123
124
125
126
127
128
129
            // iterate through the entries in the container and check if the reference is in the repository
            Iterator<WordReference>  i = container.entries();
            List<byte[]> notFoundx = new ArrayList<byte[]>();
            while (i.hasNext()) {
                WordReference e = i.next();
                if (references.containsKey(e.urlhash())) continue;
                if (badReferences.has(e.urlhash())) {
                    notFoundx.add(e.urlhash());
                    continue;
                }
                URIMetadataRow r = segment.urlMetadata().load(e.urlhash());
View Full Code Here
120
121
122
123
124
125
126
127
128
129
130
            Iterator<WordReference>  i = container.entries();
            List<byte[]> notFoundx = new ArrayList<byte[]>();
            while (i.hasNext()) {
                WordReference e = i.next();
                if (references.containsKey(e.urlhash())) continue;
                if (badReferences.has(e.urlhash())) {
                    notFoundx.add(e.urlhash());
                    continue;
                }
                URIMetadataRow r = segment.urlMetadata().load(e.urlhash());
                if (r == null) {
View Full Code Here
121
122
123
124
125
126
127
128
129
130
131
            List<byte[]> notFoundx = new ArrayList<byte[]>();
            while (i.hasNext()) {
                WordReference e = i.next();
                if (references.containsKey(e.urlhash())) continue;
                if (badReferences.has(e.urlhash())) {
                    notFoundx.add(e.urlhash());
                    continue;
                }
                URIMetadataRow r = segment.urlMetadata().load(e.urlhash());
                if (r == null) {
                    notFoundx.add(e.urlhash());
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
                if (references.containsKey(e.urlhash())) continue;
                if (badReferences.has(e.urlhash())) {
                    notFoundx.add(e.urlhash());
                    continue;
                }
                URIMetadataRow r = segment.urlMetadata().load(e.urlhash());
                if (r == null) {
                    notFoundx.add(e.urlhash());
                    badReferences.put(e.urlhash());
                } else {
                    references.put(e.urlhash(), r);
View Full Code Here
126
127
128
129
130
131
132
133
134
135
136
                    notFoundx.add(e.urlhash());
                    continue;
                }
                URIMetadataRow r = segment.urlMetadata().load(e.urlhash());
                if (r == null) {
                    notFoundx.add(e.urlhash());
                    badReferences.put(e.urlhash());
                } else {
                    references.put(e.urlhash(), r);
                }
            }
View Full Code Here
127
128
129
130
131
132
133
134
135
136
137
                    continue;
                }
                URIMetadataRow r = segment.urlMetadata().load(e.urlhash());
                if (r == null) {
                    notFoundx.add(e.urlhash());
                    badReferences.put(e.urlhash());
                } else {
                    references.put(e.urlhash(), r);
                }
            }
            // now delete all references that were not found
View Full Code Here
129
130
131
132
133
134
135
136
137
138
139
                URIMetadataRow r = segment.urlMetadata().load(e.urlhash());
                if (r == null) {
                    notFoundx.add(e.urlhash());
                    badReferences.put(e.urlhash());
                } else {
                    references.put(e.urlhash(), r);
                }
            }
            // now delete all references that were not found
            for (final byte[] b : notFoundx) container.removeReference(b);
            // finally add the remaining container to the cache
View Full Code Here
247
248
249
250
251
252
253
254
255
256
257
            // split the container
            final Iterator<WordReference> i = container.entries();
            while (i.hasNext()) {
                re = i.next();
                if (re == null) continue;
                partitionBuffer[this.seeds.scheme.verticalPosition(re.urlhash())].add(re);
            }

            // add the containers to the result vector
            for (int j = 0; j < partitionBuffer.length; j++) {
                partitions[j].add(partitionBuffer[j]);
View Full Code Here
130
131
132
133
134
135
136
137
138
139
140
            final Iterator<WordReference>  i = container.entries();
            while ((i.hasNext()) && (c.size() < max)) {
                w = i.next();
                if (r.nextInt(part) == 0) {
                    c.add(w);
                    selected.add(w.urlhash());
                }
            }
            // remove the selected entries from container
            for (final byte[] b : selected) container.removeReference(b);
            // put container back
View Full Code Here
168
169
170
171
172
173
174
175
176
177
178
            // iterate through the entries in the container and check if the reference is in the repository
            final Iterator<WordReference>  i = c.entries();
            final List<byte[]> notFoundx = new ArrayList<byte[]>();
            while (i.hasNext()) {
                final WordReference e = i.next();
                if (this.references.containsKey(e.urlhash())) continue;
                if (this.badReferences.has(e.urlhash())) {
                    notFoundx.add(e.urlhash());
                    continue;
                }
                final URIMetadataRow r = Transmission.this.segment.urlMetadata().load(e.urlhash());
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.