TypeScript hash_table.HashSetUint64类代码示例

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

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

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

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

示例1: fragmentShaderTest

    fragmentShaderTest({outputValue: 'uint'}, tester => {
      let {gl, builder} = tester;
      let hashTableShaderManager = new HashSetShaderManager('h');
      hashTableShaderManager.defineShader(builder);
      builder.addFragmentCode(glsl_unpackUint64leFromUint32);
      builder.addUniform('highp uvec2', 'inputValue');
      let s = `
outputValue = uint(h_has(unpackUint64leFromUint32(inputValue)));
`;
      builder.setFragmentMain(s);
      tester.build();
      let {shader} = tester;
      shader.bind();

      let hashTable = new HashSetUint64();
      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)) {
          continue;
        }
        testValues.push(x);
        hashTable.add(x);
      }
      let notPresentValues = new Array<Uint64>();
      notPresentValues.push(new Uint64(hashTable.emptyLow, hashTable.emptyHigh));
      while (notPresentValues.length < COUNT) {
        let x = Uint64.random();
        if (hashTable.has(x)) {
          continue;
        }
        notPresentValues.push(x);
      }
      function checkPresent(x: Uint64) {
        gl.uniform2ui(shader.uniform('inputValue'), x.low, x.high);
        hashTableShaderManager.enable(gl, shader, gpuHashTable);
        tester.execute();
        return tester.values.outputValue === 1;
      }
      testValues.forEach((x, i) => {
        expect(hashTable.has(x)).toBe(true, `cpu: i = ${i}, x = ${x}`);
        expect(checkPresent(x))
            .toBe(true, `gpu: i = ${i}, x = ${x}, index = ${hashTable.indexOf(x)}`);
      });
      notPresentValues.forEach((x, i) => {
        expect(hashTable.has(x)).toBe(false, `cpu: i = ${i}, x = ${x}`);
        expect(checkPresent(x)).toBe(false, `gpu: i = ${i}, x = ${x}`);
      });
    });

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

示例2: it

  it('HashSetUint64', () => {
    let ht = new HashSetUint64();
    let set = new Set<string>();

    function compareViaIterate() {
      let htValues = new Set<string>();
      for (let v of ht) {
        let s = v.toString();
        expect(htValues.has(s)).toBe(false, `Duplicate key in hash table: ${s}`);
        expect(set.has(s)).toBe(true, `Unexpected key ${s} in hash table`);
        htValues.add(s);
      }
      for (let s of set) {
        expect(htValues.has(s)).toBe(true, `Hash table is missing key ${s}`);
      }
    }

    function compareViaHas() {
      for (let s of set) {
        let k = Uint64.parseString(s);
        expect(ht.has(k)).toBe(true, `Hash table is missing key ${s}`);
      }
    }

    function compare() {
      compareViaIterate();
      compareViaHas();
    }
    let numInsertions = 100;

    function testInsert(k: Uint64) {
      let s = '' + k;
      set.add(s);
      expect(ht.has(k)).toBe(false, `Unexpected positive has result for ${[k.low, k.high]}`);
      ht.add(k);
      compare();
    }

    let empty0 = new Uint64(ht.emptyLow, ht.emptyHigh);
    testInsert(empty0);

    for (let i = 0; i < numInsertions; ++i) {
      let k: Uint64;
      let s: string;
      while (true) {
        k = Uint64.random();
        s = k.toString();
        if (!set.has(s)) {
          break;
        }
      }
      testInsert(k);
    }

    let empty1 = new Uint64(ht.emptyLow, ht.emptyHigh);
    testInsert(empty1);

  });

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

示例3: suite

suite('gpu_hash/hash_table', () => {
  let ht = new HashSetUint64();
  const numValues = 100;
  let values = new Uint32Array(numValues * 2);
  let temp = new Uint64();
  getRandomValues(values);
  benchmark('insert', () => {
    ht.clear();
    for (let i = 0, length = values.length; i < length; i += 2) {
      temp.low = values[i];
      temp.high = values[i + 1];
      ht.add(temp);
    }
  });
});

开发者ID:google，项目名称:neuroglancer，代码行数:15，代码来源:hash_table.benchmark.ts

示例4: fragmentShaderTest

    fragmentShaderTest(1 + 2 * NUM_ALTERNATIVES, tester => {
      let numAlternatives = NUM_ALTERNATIVES;
      let {gl, builder} = tester;
      let hashTableShaderManager = new HashSetShaderManager('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}, v);
  gl_FragData[${outputNumber++}] = texture2D(${samplerName}, vec2(v.x + highOffset, v.y));
}
`;
        }
      }
      builder.setFragmentMain(s);
      tester.build();
      let {shader} = tester;
      shader.bind();

      let hashTable = new HashSetUint64();
      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)) {
          continue;
        }
        testValues.push(x);
        hashTable.add(x);
      }
      let notPresentValues = new Array<Uint64>();
      notPresentValues.push(new Uint64(hashTable.emptyLow, hashTable.emptyHigh));
      while (notPresentValues.length < COUNT) {
        let x = Uint64.random();
        if (hashTable.has(x)) {
          continue;
        }
        notPresentValues.push(x);
      }
      let executeIndex = 0;
      let mungedTable: Uint32Array;
      hashTable.tableWithMungedEmptyKey(table => { mungedTable = new Uint32Array(table); });
      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 = mungedTable[h];
          let expectedValueHigh = mungedTable[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)).toBe(true, `cpu: i = ${i}, x = ${x}`);
        expect(checkPresent(x))
            .toBe(true, `gpu: i = ${i}, x = ${x}, index = ${hashTable.indexOf(x)}`);
      });
      notPresentValues.forEach((x, i) => {
        expect(hashTable.has(x)).toBe(false, `cpu: i = ${i}, x = ${x}`);
        expect(checkPresent(x)).toBe(false, `gpu: i = ${i}, x = ${x}`);
      });
    });

开发者ID:janelia-flyem，项目名称:neuroglancer，代码行数:89，代码来源:shader.spec.ts

示例5: testInsert

 function testInsert(k: Uint64) {
   let s = '' + k;
   set.add(s);
   expect(ht.has(k)).toBe(false, `Unexpected positive has result for ${[k.low, k.high]}`);
   ht.add(k);
   compare();
 }

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

示例6: benchmark

 benchmark('insert', () => {
   ht.clear();
   for (let i = 0, length = values.length; i < length; i += 2) {
     temp.low = values[i];
     temp.high = values[i + 1];
     ht.add(temp);
   }
 });

开发者ID:google，项目名称:neuroglancer，代码行数:8，代码来源:hash_table.benchmark.ts

示例7: 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 = mungedTable[h];
     let expectedValueHigh = mungedTable[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:janelia-flyem，项目名称:neuroglancer，代码行数:25，代码来源:shader.spec.ts

示例8: compareViaHas

 function compareViaHas() {
   for (let s of set) {
     let k = Uint64.parseString(s);
     expect(ht.has(k)).toBe(true, `Hash table is missing key ${s}`);
   }
 }

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

示例9: expect

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

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

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