Examples of XorComparator

Examples of org.ardverk.dht.utils.XorComparator

376
377
378
379
380
381
382
383
384
385
386
      this.lookupId = lookupId;
     
      Contact localhost = routeTable.getIdentity();
      KUID contactId = localhost.getId();
     
      XorComparator comparator = new XorComparator(lookupId);
      this.responses = new TreeSet<Contact>(comparator);
      this.closest = new TreeSet<Contact>(comparator);
      this.query = new TreeSet<Contact>(comparator);
     
      history.put(contactId, 0);
View Full Code Here

Examples of org.ardverk.dht.utils.XorComparator

108
109
110
111
112
113
114
115
116
117
118
      KUID[] contacts = new KUID[] {
        KUID.createRandom(lookupId),
        KUID.createRandom(lookupId)
      };
     
      Arrays.sort(contacts, new XorComparator(lookupId));
     
      TestCase.assertTrue(contacts[0].isCloserTo(lookupId, contacts[1]));
      TestCase.assertFalse(contacts[1].isCloserTo(lookupId, contacts[0]));
    }
  }
View Full Code Here

Examples of org.ardverk.dht.utils.XorComparator

41
42
43
44
45
46
47
48
49
50
51
    for (int i = 0; i < 100; i++) {
      KUID contact = KUID.createRandom(lookupId);
      contacts.add(contact);
    }
   
    Collections.sort(contacts, new XorComparator(lookupId));
   
    for (int i = 1; i < contacts.size(); i++) {
      TestCase.assertTrue(contacts.get(i-1).isCloserTo(
          lookupId, contacts.get(i)));
    }
View Full Code Here

Examples of org.ardverk.dht.utils.XorComparator

56
57
58
59
60
61
62
63
64
65
66
 
  @Test
  public void pollFirst() {
    KUID lookupId = KUID.createRandom(20);
    Comparator<Identifier> comparator
      = new XorComparator(lookupId);
   
    List<KUID> contacts1 = new ArrayList<KUID>();
    TreeSet<KUID> contacts2 = new TreeSet<KUID>(comparator);
   
    for (int i = 0; i < 100; i++) {
View Full Code Here

Examples of org.ardverk.dht.utils.XorComparator

91
92
93
94
95
96
97
98
99
100
101
 
  @Test
  public void pollFirst2() {
    KUID lookupId = KUID.createRandom(20);
    Comparator<Identifier> comparator
      = new XorComparator(lookupId);
   
    List<KUID> contacts1 = new ArrayList<KUID>();
    TreeMap<KUID, KUID> contacts2 = new TreeMap<KUID, KUID>(comparator);
   
    for (int i = 0; i < 100; i++) {
View Full Code Here

Examples of org.ardverk.dht.utils.XorComparator

120
121
122
123
124
125
126
127
128
129
130
     
      KUID lookupId = KUID.createRandom(20);
     
      // Sort the DHTs by their XOR distance to the given lookupId.
      TreeSet<KUID> expected = new TreeSet<KUID>(
          new XorComparator(lookupId));
      for (DHT dht : dhts) {
        expected.add(dht.getIdentity().getId());
      }
     
      DHT first = dhts.get(0);
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.