Package org.ardverk.dht

Examples of org.ardverk.dht.KUID

268
269
270
271
272
273
274
275
276
277
  public final ResponseMessage handleRequest(RequestMessage request) throws IOException {
    fireMessageReceived(request);
    ResponseMessage response = handleRequest0(request);
   
    if (response != null) {
      KUID contactId = request.getContact().getId();
      fireMessageSent(contactId, response);
    }
    return response;
  }
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
public class LookupResponseHandlerTest {

  @Test
  public void isCloserTo() {
    KUID lookupId = KUID.createRandom(20);
   
    List<KUID> contacts = new ArrayList<KUID>();
    for (int i = 0; i < 100; i++) {
      KUID contact = KUID.createRandom(lookupId);
      contacts.add(contact);
    }
   
    Collections.sort(contacts, new XorComparator(lookupId));
   
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
          lookupId, contacts.get(contacts.size()-1)));
  }
 
  @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++) {
      KUID contact = KUID.createRandom(lookupId);
      contacts1.add(contact);
      contacts2.add(contact);
    }
   
    Collections.sort(contacts1, comparator);
   
    KUID[] contacts3 = contacts2.toArray(new KUID[0]);
   
    // The List, Set and Array should be in the same order!
   
    TestCase.assertEquals(contacts1.size(), contacts2.size());
    TestCase.assertEquals(contacts1.size(), contacts3.length);
   
    for (int i = 0; i < contacts1.size(); i++) {
      KUID contact1 = contacts1.get(i);
      KUID contact2 = contacts2.pollFirst();
      KUID contact3 = contacts3[i];
     
      TestCase.assertEquals(contact1, contact2);
      TestCase.assertEquals(contact1, contact3);
      TestCase.assertEquals(contact2, contact3);
    }
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
    }
  }
 
  @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++) {
      KUID contact = KUID.createRandom(lookupId);
      contacts1.add(contact);
      contacts2.put(contact, contact);
    }
   
    Collections.sort(contacts1, comparator);
   
    KUID[] contacts3 = contacts2.values().toArray(new KUID[0]);
   
    // The List, Set and Array should be in the same order!
   
    TestCase.assertEquals(contacts1.size(), contacts2.size());
    TestCase.assertEquals(contacts1.size(), contacts3.length);
   
    for (int i = 0; i < contacts1.size(); i++) {
      KUID contact1 = contacts1.get(i);
      KUID contact2 = contacts2.pollFirstEntry().getValue();
      KUID contact3 = contacts3[i];
     
      TestCase.assertEquals(contact1, contact2);
      TestCase.assertEquals(contact1, contact3);
      TestCase.assertEquals(contact2, contact3);
    }
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
  public void lookup() throws Exception {
    List<DHT> dhts = createDHTs(256, 2000);
    try {
      bootstrap(dhts);
     
      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);
     
      NodeConfig config = new NodeConfig();
      config.setLookupTimeout(20L, TimeUnit.SECONDS);
     
      DHTFuture<NodeEntity> future
        = first.discover(lookupId, config);
      NodeEntity entity = future.get();
      TestCase.assertEquals(lookupId, entity.getId());
     
      Contact[] contacts = entity.getContacts();
      Contact[] closest = entity.getClosest();
     
      // The Contacts in the response should be in the same order
      // as our DHT instances!
      int k = first.getRouteTable().getK();
      for (int i = 0; i < k && i < contacts.length; i++) {
        KUID contactId = contacts[i].getId();
        KUID closestId = closest[i].getId();
       
        KUID expectedId = expected.pollFirst();
       
        TestCase.assertEquals(expectedId, contactId);
        TestCase.assertEquals(expectedId, closestId);
       
        TestCase.assertSame(closest[i], contacts[i]);
View Full Code Here
TOP

Related Classes of org.ardverk.dht.KUID

  • org.ardverk.dht.codec.bencode.BencodeMessageCodecTest
  • org.ardverk.dht.codec.bencode.MessageInputStream
  • org.ardverk.dht.codec.bencode.MessageOutputStream
  • org.ardverk.dht.io.AbstractResponseHandler
  • org.ardverk.dht.io.DefaultMessageHandler
  • org.ardverk.dht.io.LookupResponseHandler$LookupManager
  • org.ardverk.dht.io.LookupResponseHandlerTest
  • org.ardverk.dht.io.MessageDispatcher
  • org.ardverk.dht.io.NodeRequestHandler
  • org.ardverk.dht.io.NodeResponseHandlerTest
    • Copyright © 2018 www.massapicom. 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.