ndn-contrib/test/node/DataStructures/PIT.js

Reusable 'Classes' for Named Data Networking: NameTree, PIT, FIB, ContentStore, Interfaces, and Transports

var PIT = require('../../../src/DataStructures/PIT.js')
, NameTree = require("../../../src/DataStructures/NameTree.js")
var assert = require("assert")
var ndn = require('ndn-lib')

PIT.installNDN(ndn);
var pubKeyDigest = ndn.globalKeyManager.getKey().publicKeyDigest
NameTree.installNDN(ndn);
var pit = new PIT(new NameTree());
var inst = new ndn.Interest(new ndn.Name("a/b"))
, enc = inst.wireEncode().buffer
inst = new ndn.Interest()
inst.wireDecode(enc);

var entry = new PIT.Entry(enc, inst, 1)
var d11 = new ndn.Data(new ndn.Name("a/b"), new ndn.SignedInfo(), "test")
d11.signedInfo.setFields()
d11.sign()
var d22 = new ndn.Data(new ndn.Name("a/b/d"), new ndn.SignedInfo(), "test")
d22.signedInfo.setFields()
d22.sign()
describe("PIT.Entry", function(){


  it("should match exact", function(){


    assert(entry.matches(d11))
  })
  it("should match (with pubKey)", function(){
      entry.interest.publisherPublicKeyDigest = pubKeyDigest

      assert(entry.matches(d11))
  })
  it("should not match (data name too short)", function(){

    var data = new ndn.Data(new ndn.Name("a"), new ndn.SignedInfo(), "test")
    assert(!entry.matches(data))
  })
  it("should not match (data name too long)", function(){
    entry.interest.setMaxSuffixComponents(3)
    var data = new ndn.Data(new ndn.Name("a/b/c/d/e/d"), new ndn.SignedInfo(), "test")
    assert(!entry.matches(data))
  })
  it("should not match (data name too short)", function(){
    entry.interest.setMinSuffixComponents(2)
    var data = new ndn.Data(new ndn.Name("a/b"), new ndn.SignedInfo(), "test")
    assert(!entry.matches(data))
  })
  it("should not match (Exclude)", function(){
    entry.interest.setExclude(new ndn.Exclude([new ndn.Name.Component("c")]))
    var data = new ndn.Data(new ndn.Name("a/b/c"), new ndn.SignedInfo(), "test")
    assert(!entry.matches(data))
  })
  it("should not match (wrong pubKeyDigest)", function(){

    var newKey = new Buffer(32)
    entry.interest.publisherPublicKeyDigest = newKey;
    assert(!entry.matches(d22))
  })
})

describe("PIT", function(){
  describe("PIT.insertPitEntry", function(){
    it("should insert", function(){
      entry.interest.setInterestLifetimeMilliseconds(100)
      pit.insertPitEntry(enc,1)
      assert(pit.nameTree["/a/b"].pitEntries.length > 0)
    })
    it("should auto-consume", function(done){
      setTimeout(function(){
        assert(pit.nameTree["/a/b"].pitEntries.length == 0)
        done()
      },110)
    })
  })
  describe("PIT.lookup", function(){
    it("should get all matches and return a faceFlag", function(done){
      var inst = new ndn.Interest(new ndn.Name("a/b/c"))
      inst.setInterestLifetimeMilliseconds(50);
      var enc = inst.wireEncode()
      inst = new ndn.Interest()
      inst.wireDecode(enc)
      var entry = new PIT.Entry(enc, inst, 1)
      var data = new ndn.Data(new ndn.Name("a/b/c/d"), new ndn.SignedInfo(), "test")
      data.signedInfo.setFields()
      entry.interest.publisherPublicKeyDigest = pubKeyDigest;
      pit.insertPitEntry(enc, 1)
      var returns = pit.lookup(data);
      assert(returns.faces == 2)
      assert(returns.pitEntries.length == 1)
      done()
    })
  })
  describe("PIT.checkDuplicate", function(){
    it("should return true for duplicate", function(){
      var inst = new ndn.Interest(new ndn.Name("test/duplicate"))
      var a = inst.wireEncode()
      var b = new ndn.Interest()
      b.wireDecode(a)
      assert(!pit.checkDuplicate(b))
      pit.insertPitEntry(a, 1)
      assert(pit.checkDuplicate(b))
    })
  })
})