TypeScript hash_table.HashTable类代码示例

OStack程序员社区-中国程序员成长平台 › 门户 › 编程› TypeScript›TypeScript教程

原作者: [db:作者] 来自: [db:来源] 收藏邀请

本文整理汇总了TypeScript中neuroglancer/gpu_hash/hash_table.HashTable类的典型用法代码示例。如果您正苦于以下问题：TypeScript HashTable类的具体用法？TypeScript HashTable怎么用？TypeScript HashTable使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。

在下文中一共展示了HashTable类的6个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的TypeScript代码示例。

示例1: checkPresent

 function checkPresent(x: Uint64) {
   let temp = new Uint32Array(2);
   temp[0] = x.low;
   temp[1] = x.high;
   let inputValue = encodeBytesToFloat32(temp);
   gl.uniform4fv(shader.uniform('inputValue'), inputValue);
   hashTableShaderManager.enable(gl, shader, gpuHashTable);
   tester.execute();
   let curIndex = executeIndex;
   ++executeIndex;
   let outputNumber = 1;
   for (let alt = 0; alt < NUM_ALTERNATIVES; ++alt) {
     let valueLow = tester.readUint32(outputNumber++);
     let valueHigh = tester.readUint32(outputNumber++);
     let h = hashTable.getHash(alt, x.low, x.high);
     let expectedValueLow = hashTable.tables[alt][h];
     let expectedValueHigh = hashTable.tables[alt][h + 1];
     expect(valueLow).toEqual(
         expectedValueLow, `curIndex = ${curIndex}, x = ${[x.low, x.high]}, alt = ${alt}`);
     expect(valueHigh).toEqual(
         expectedValueHigh, `curIndex = ${curIndex}, x = ${[x.low, x.high]}, alt = ${alt}`);
   }
   let resultBytes = tester.readBytes();
   return resultBytes[0] === 255;
 }

开发者ID:funkey，项目名称:neuroglancer，代码行数:25，代码来源:shader.spec.ts

示例2: fragmentShaderTest

    fragmentShaderTest(1 + 2 * NUM_ALTERNATIVES, tester => {
      let numAlternatives = NUM_ALTERNATIVES;
      let {gl, builder} = tester;
      let hashTableShaderManager = new HashTableShaderManager('h');
      hashTableShaderManager.defineShader(builder);
      builder.addUniform('vec4', 'inputValue', 2);
      let {bName, samplerName} = hashTableShaderManager;
      let s = `
uint64_t x;
x.low = inputValue[0];
x.high = inputValue[1];
gl_FragData[0] = h_has(x) ? vec4(1.0, 1.0, 1.0, 1.0) : vec4(0.0, 0.0, 0.0, 0.0);
float highOffset = ${bName}[${numAlternatives * 4 + 2}];
`;
      {
        let outputNumber = 1;
        for (let alt = 0; alt < NUM_ALTERNATIVES; ++alt) {
          s += `
{
  vec2 v = h_computeHash_${alt}(x);
  gl_FragData[${outputNumber++}] = texture2D(${samplerName}[${alt}], v);
  gl_FragData[${outputNumber++}] = texture2D(${samplerName}[${alt}], vec2(v.x + highOffset, v.y));
}
`;
        }
      }
      builder.setFragmentMain(s);
      tester.build();
      let {shader} = tester;
      shader.bind();

      let hashTable = new HashTable();
      let gpuHashTable = tester.registerDisposer(GPUHashTable.get(gl, hashTable));
      let testValues = new Array<Uint64>();
      while (testValues.length < COUNT) {
        let x = Uint64.random();
        if (hashTable.has(x.low, x.high)) {
          continue;
        }
        testValues.push(x);
        hashTable.add(x.low, x.high);
      }
      let notPresentValues = new Array<Uint64>();
      while (notPresentValues.length < COUNT) {
        let x = Uint64.random();
        if (hashTable.has(x.low, x.high)) {
          continue;
        }
        notPresentValues.push(x);
      }
      let executeIndex = 0;
      function checkPresent(x: Uint64) {
        let temp = new Uint32Array(2);
        temp[0] = x.low;
        temp[1] = x.high;
        let inputValue = encodeBytesToFloat32(temp);
        gl.uniform4fv(shader.uniform('inputValue'), inputValue);
        hashTableShaderManager.enable(gl, shader, gpuHashTable);
        tester.execute();
        let curIndex = executeIndex;
        ++executeIndex;
        let outputNumber = 1;
        for (let alt = 0; alt < NUM_ALTERNATIVES; ++alt) {
          let valueLow = tester.readUint32(outputNumber++);
          let valueHigh = tester.readUint32(outputNumber++);
          let h = hashTable.getHash(alt, x.low, x.high);
          let expectedValueLow = hashTable.tables[alt][h];
          let expectedValueHigh = hashTable.tables[alt][h + 1];
          expect(valueLow).toEqual(expectedValueLow, `curIndex = ${curIndex}, x = ${[x.low, x.high]}, alt = ${alt}`);
          expect(valueHigh).toEqual(expectedValueHigh, `curIndex = ${curIndex}, x = ${[x.low, x.high]}, alt = ${alt}`);
        }
        let resultBytes = tester.readBytes();
        return resultBytes[0] === 255;
      }
      testValues.forEach((x, i) => {
        expect(hashTable.has(x.low, x.high)).toBe(true, `cpu: i = ${i}, x = ${x}`);
        expect(checkPresent(x)).toBe(true, `gpu: i = ${i}, x = ${x}, index = ${hashTable.hasWithTableIndex(x.low, x.high)}`);
      });
      notPresentValues.forEach((x, i) => {
        expect(hashTable.has(x.low, x.high)).toBe(false, `cpu: i = ${i}, x = ${x}`);
        expect(checkPresent(x)).toBe(false, `gpu: i = ${i}, x = ${x}`);
      });
    });

开发者ID:j6k4m8，项目名称:neuroglancer，代码行数:83，代码来源:shader.spec.ts

示例3: it

  it('test', () => {
    let ht = new HashTable();
    let map = new Map();

    let maxValue = Math.pow(2, 32);
    function genNumber() { return Math.floor(Math.random() * maxValue); }
    function getRandomKey() {
      while (true) {
        let v = new Uint64(genNumber(), genNumber());
        if (v.low !== ht.emptyLow || v.high !== ht.emptyHigh) {
          return v;
        }
      }
    }

    function compareViaIterate() {
      let htValues = new Map();
      for (let [low, high] of ht) {
        let v = new Uint64(low, high);
        let s = v.toString();
        if (htValues.has(s)) {
          throw new Error('Duplicate key in hash table: ' + [low, high]);
        }
        if (!map.has(s)) {
          throw new Error('Unexpected key ' + [low, high] + ' in hash table');
        }
        htValues.set(s, v);
      }
      for (let [s, k] of map) {
        if (!htValues.has(s)) {
          throw new Error('Hash table is missing key ' + [k.low, k.high]);
        }
      }
    }

    function compareViaHas() {
      for (let [, k] of map) {
        expect(ht.has(k.low, k.high)).toBe(true, `Hash table is missing key ${[k.low, k.high]}`);
      }
    }

    function compare() {
      compareViaIterate();
      compareViaHas();
    }
    let numInsertions = 100;
    for (let i = 0; i < numInsertions; ++i) {
      let k: Uint64;
      let s: string;
      while (true) {
        k = getRandomKey();
        s = k.toString();
        if (!map.has(k)) {
          break;
        }
      }
      map.set(s, k);
      expect(ht.has(k.low, k.high))
          .toBe(false, `Unexpected positive has result for ${[k.low, k.high]}`);
      ht.add(k.low, k.high);
      compare();
    }
  });

开发者ID:funkey，项目名称:neuroglancer，代码行数:63，代码来源:hash_table.spec.ts

示例4: expect

 testValues.forEach((x, i) => {
   expect(hashTable.has(x.low, x.high)).toBe(true, `cpu: i = ${i}, x = ${x}`);
   expect(checkPresent(x))
       .toBe(
           true,
           `gpu: i = ${i}, x = ${x}, index = ${hashTable.hasWithTableIndex(x.low, x.high)}`);
 });

开发者ID:funkey，项目名称:neuroglancer，代码行数:7，代码来源:shader.spec.ts

示例5: expect

 notPresentValues.forEach((x, i) => {
   expect(hashTable.has(x.low, x.high)).toBe(false, `cpu: i = ${i}, x = ${x}`);
   expect(checkPresent(x)).toBe(false, `gpu: i = ${i}, x = ${x}`);
 });

开发者ID:j6k4m8，项目名称:neuroglancer，代码行数:4，代码来源:shader.spec.ts

示例6: compareViaHas

 function compareViaHas() {
   for (let [, k] of map) {
     expect(ht.has(k.low, k.high)).toBe(true, `Hash table is missing key ${[k.low, k.high]}`);
   }
 }

开发者ID:funkey，项目名称:neuroglancer，代码行数:5，代码来源:hash_table.spec.ts

注：本文中的neuroglancer/gpu_hash/hash_table.HashTable类示例由纯净天空整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。