Package net.tomp2p.peers

Examples of net.tomp2p.peers.Number640

21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
        byte[] me13 = new byte[] { 3, 3 };
        byte[] me14 = new byte[] { 4, 4 };
        Map<PeerAddress, Map<Number640, Data>> rawData = new HashMap<PeerAddress, Map<Number640, Data>>();
        PeerAddress pa1 = Utils2.createAddress(19);
        Map<Number640, Data> test1 = new HashMap<Number640, Data>();
        test1.put(new Number640(new Number160(12),new Number160(12),new Number160(12),new Number160(0)), new Data(me12));
        test1.put(new Number640(new Number160(13),new Number160(13),new Number160(13),new Number160(0)), new Data(me13));
        test1.put(new Number640(new Number160(14),new Number160(14),new Number160(14),new Number160(0)), new Data(me14));
        rawData.put(pa1, test1);
        //
        PeerAddress pa2 = Utils2.createAddress(20);
        Map<Number640, Data> test2 = new HashMap<Number640, Data>();
        test2.put(new Number640(new Number160(12),new Number160(12),new Number160(12),new Number160(0)), new Data(me12));
        test2.put(new Number640(new Number160(13),new Number160(13),new Number160(13),new Number160(0)), new Data(me13));
        rawData.put(pa2, test2);
        //
        PeerAddress pa3 = Utils2.createAddress(21);
        Map<Number640, Data> test3 = new HashMap<Number640, Data>();
        test3.put(new Number640(new Number160(11),new Number160(11),new Number160(11),new Number160(0)), new Data(me11));
        test3.put(new Number640(new Number160(13),new Number160(13),new Number160(13),new Number160(0)), new Data(me13));
        test3.put(new Number640(new Number160(14),new Number160(14),new Number160(14),new Number160(0)), new Data(me14));
        rawData.put(pa3, test3);
        VotingSchemeDHT evs = new VotingSchemeDHT();
        Map<Number640, Data> tmp = evs.evaluate2(rawData);
        Assert.assertEquals(false, tmp.containsKey(new Number640(new Number160(11),new Number160(11),new Number160(11),new Number160(0))));
        Assert.assertEquals(true, tmp.containsKey(new Number640(new Number160(12),new Number160(12),new Number160(12),new Number160(0))));
        Assert.assertEquals(true, tmp.containsKey(new Number640(new Number160(13),new Number160(13),new Number160(13),new Number160(0))));
        Assert.assertEquals(true, tmp.containsKey(new Number640(new Number160(14),new Number160(14),new Number160(14),new Number160(0))));
    }
View Full Code Here
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
        byte[] me13 = new byte[] { 3, 3 };
        byte[] me14 = new byte[] { 4, 4 };
        Map<PeerAddress, Map<Number640, Data>> rawData = new HashMap<PeerAddress, Map<Number640, Data>>();
        PeerAddress pa1 = Utils2.createAddress(19);
        Map<Number640, Data> test1 = new HashMap<Number640, Data>();
        test1.put(new Number640(new Number160(12),new Number160(12),new Number160(12),new Number160(0)), new Data(me12));
        test1.put(new Number640(new Number160(13),new Number160(13),new Number160(13),new Number160(0)), new Data(me13));
        test1.put(new Number640(new Number160(14),new Number160(14),new Number160(14),new Number160(0)), new Data(me14));
        rawData.put(pa1, test1);
        //
        PeerAddress pa2 = Utils2.createAddress(20);
        Map<Number640, Data> test2 = new HashMap<Number640, Data>();
        test2.put(new Number640(new Number160(12),new Number160(12),new Number160(12),new Number160(0)), new Data(me11));
        test2.put(new Number640(new Number160(13),new Number160(13),new Number160(13),new Number160(0)), new Data(me13));
        rawData.put(pa2, test2);
        //
        PeerAddress pa3 = Utils2.createAddress(21);
        Map<Number640, Data> test3 = new HashMap<Number640, Data>();
        test3.put(new Number640(new Number160(11),new Number160(11),new Number160(11),new Number160(0)), new Data(me11));
        test3.put(new Number640(new Number160(13),new Number160(13),new Number160(13),new Number160(0)), new Data(me13));
        test3.put(new Number640(new Number160(14),new Number160(14),new Number160(14),new Number160(0)), new Data(me14));
       
        rawData.put(pa3, test3);
        VotingSchemeDHT evs = new VotingSchemeDHT();
        Map<Number640, Data> tmp = evs.evaluate2(rawData);
       
        Assert.assertEquals(false, tmp.containsKey(new Number640(new Number160(11),new Number160(11),new Number160(11),new Number160(0))));
        Assert.assertEquals(false, tmp.containsKey(new Number640(new Number160(12),new Number160(12),new Number160(12),new Number160(0))));
        Assert.assertEquals(true, tmp.containsKey(new Number640(new Number160(13),new Number160(13),new Number160(13),new Number160(0))));
        Assert.assertEquals(true, tmp.containsKey(new Number640(new Number160(14),new Number160(14),new Number160(14),new Number160(0))));
    }
View Full Code Here
84
85
86
87
88
89
90
91
92
93
94
95
    @Override
    public boolean put(Number640 key, Data value) {
        dataMap.put(key, value);
        if (maxVersions > 0) {
          NavigableMap<Number640, Data> versions = dataMap.subMap(
        new Number640(key.locationKey(), key.domainKey(), key.contentKey(), Number160.ZERO), true,
        new Number640(key.locationKey(), key.domainKey(), key.contentKey(), Number160.MAX_VALUE), true);
     
      while (!versions.isEmpty()
              && versions.firstKey().versionKey().timestamp() + maxVersions <= versions.lastKey().versionKey()
                      .timestamp()) {
        Map.Entry<Number640, Data> entry = versions.pollFirstEntry();
View Full Code Here
285
286
287
288
289
290
291
292
    if (version.basedOnSet().isEmpty()) {
      return;
    }
    // remove all predecessor versions recursively
    for (Number160 basedOnKey : version.basedOnSet()) {
      deletePredecessors(new Number640(key.locationAndDomainAndContentKey(), basedOnKey), sortedMap);
    }
  }
View Full Code Here
441
442
443
444
445
446
447
448
449
450
      }
    }
  }

  private boolean isEmpty(Number160 locationKey) {
    Number640 from = new Number640(locationKey, Number160.ZERO, Number160.ZERO, Number160.ZERO);
    Number640 to = new Number640(locationKey, Number160.MAX_VALUE, Number160.MAX_VALUE, Number160.MAX_VALUE);
    Map<Number640, Data> tmp = backend.subMap(from, to, 1, false);
    return tmp.size() == 0;
  }
View Full Code Here
476
477
478
479
480
481
482
483
484
485
486
487
    public DigestInfo digest(Number320 locationAndDomainKey, SimpleBloomFilter<Number160> keyBloomFilter,
          SimpleBloomFilter<Number160> contentBloomFilter, int limit, boolean ascending, boolean isBloomFilterAnd) {
    DigestInfo digestInfo = new DigestInfo();
    KeyLock<Number320>.RefCounterLock lock = dataLock320.lock(locationAndDomainKey);
    try {
      Number640 from = new Number640(locationAndDomainKey, Number160.ZERO, Number160.ZERO);
      Number640 to = new Number640(locationAndDomainKey, Number160.MAX_VALUE, Number160.MAX_VALUE);
      Map<Number640, Data> tmp = backend.subMap(from, to, limit, ascending);
      for (Map.Entry<Number640, Data> entry : tmp.entrySet()) {
        if (isBloomFilterAnd) {
          if (keyBloomFilter == null || keyBloomFilter.contains(entry.getKey().contentKey())) {
            if (contentBloomFilter == null || contentBloomFilter.contains(entry.getValue().hash())) {
View Full Code Here
690
691
692
693
694
695
696
697
698
699
700
701
  public void removeResponsibility(Number160 locationKey, boolean keepData) {
    KeyLock<Number160>.RefCounterLock lock = responsibilityLock.lock(locationKey);
    try {
      if (!keepData) {
        backend.remove(
            new Number640(locationKey, Number160.ZERO, Number160.ZERO, Number160.ZERO),
            new Number640(locationKey, Number160.MAX_VALUE, Number160.MAX_VALUE, Number160.MAX_VALUE),
            false);
      }
          backend.removeResponsibility(locationKey);
        } finally {
            responsibilityLock.unlock(lock);
View Full Code Here
263
264
265
266
267
268
269
270
271
272
273
                  final ByteBuf buf = entry.getValue().buffer();
                  Number160 versionKey = SyncUtils.decodeHeader(buf);
                  Number160 hash = SyncUtils.decodeHeader(buf);
                    List<Instruction> instructions = SyncUtils.decodeInstructions(buf);

                    Data dataOld = storageLayer.get(new Number640(entry.getKey().locationAndDomainAndContentKey(), versionKey));

                    if (dataOld == null || !dataOld.hash().equals(hash)) {
                        continue;
                    }
                    // TODO: don't copy data, toBytes does a copy!
View Full Code Here
696
697
698
699
700
701
702
703
704
705
706
707
708
          dataSize = 1;
          result = new HashMap<Number640, Byte>(1);
          LOG.debug("received meta request to change domain");
          Number160 locationKey = message.key(0);
          Number160 domainKey = message.key(1);
          final Number640 key = new Number640(locationKey, domainKey, Number160.ZERO, Number160.ZERO);
          PublicKey publicKeyChange = message.publicKey(1);
          Enum<?> status = storageLayer.updateMeta(key.locationAndDomainKey(), publicKey, publicKeyChange);
          result.put(key, (byte) status.ordinal());
        } else {
          dataSize = toStore.size();
            result = new HashMap<Number640, Byte>(dataSize);
          LOG.debug("received meta request to change entry");
View Full Code Here
807
808
809
810
811
812
813
814
815
816
817
        LOG.debug("add list data with key {} on {}", entry.getKey(), serverPeerAddress);
        if (list) {
            Number160 contentKey2 = new Number160(RND);
            Enum<?> status;
            Number640 key = new Number640(entry.getKey().locationKey(), entry.getKey().domainKey(),
                    contentKey2, entry.getKey().versionKey());
            while ((status = storageLayer.put(key, entry.getValue(), publicKey, true, protectDomain)) == PutStatus.FAILED_NOT_ABSENT) {
                contentKey2 = new Number160(RND);
            }
            return status;
View Full Code Here
TOP

Related Classes of net.tomp2p.peers.Number640

  • net.tomp2p.dht.PutBuilder
  • net.tomp2p.dht.StorageLayer
  • net.tomp2p.dht.StorageMemory
  • net.tomp2p.dht.StorageRPC
  • net.tomp2p.dht.TestDHT
  • net.tomp2p.dht.TestH2H
  • net.tomp2p.dht.TestSecurity
  • net.tomp2p.dht.TestStorage
  • net.tomp2p.dht.TestStorageDHT
  • net.tomp2p.examples.ExampleConsistency
    • 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.