Advertisement
Guest User

Untitled

a guest
Feb 6th, 2016
54
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 1.43 KB | None | 0 0
  1.     private PostingsList intersect(PostingsList postingsList1, PostingsList postingsList2) {
  2.         PostingsList result = new PostingsList();
  3.         ListIterator<PostingsEntry> p1Iterator = postingsList1.getIterator();
  4.         ListIterator<PostingsEntry> p2Iterator = postingsList2.getIterator();
  5.         PostingsEntry p1 = p1Iterator.next();
  6.         PostingsEntry p2 = p2Iterator.next();
  7.         Boolean start = Boolean.TRUE;
  8.         while( (p1Iterator.hasNext() && p2Iterator.hasNext()) || start) {
  9.             start = Boolean.FALSE;
  10.             if (p1.docID == p2.docID) {
  11.                 result.add(p1.docID, 0);
  12.                 p1 = p1Iterator.next();
  13.                 p2 = p2Iterator.next();
  14.             } else if (p1.docID < p2.docID) {
  15.                 p1 = p1Iterator.next();
  16.             } else {
  17.                 p2 = p2Iterator.next();
  18.             }
  19.         }
  20.  
  21.         return result;
  22.     }
  23.  
  24.  
  25.     private PostingsList intersect(PostingsList p1, PostingsList p2) {
  26.         PostingsList result = new PostingsList();
  27.         int i = 0;
  28.         int j = 0;
  29.         while (i < p1.size() && j < p2.size()) {
  30.             if(p1.get(i).docID == p2.get(j).docID) {
  31.                 result.add(p1.get(i).docID, 0);
  32.                 i++;
  33.                 j++;
  34.             } if ( p1.get(i).docID < p2.get(j).docID) {
  35.                 i++;
  36.             } else {
  37.                 j++;
  38.             }
  39.         }
  40.         return result;
  41.     }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement