@ohos.util.TreeSet

@ohos.util.TreeSet.add

官方API文档

测试用例 1: 测试TreeSet容器add接口

function test_add(loopCount: number): string {
  // test: TreeSet.add
  // desc: 测试TreeSet容器add接口
  const test_id = 1;

  // prepare: setup objects to test
  let treeSet = new TreeSet<number>();

  // test
  const startTime = new Date();
  for (let i = 0; i < loopCount; i++) {
    treeSet.add(i);
  }
  const endTime = new Date();

  // finish
  const executionTime = endTime.getTime() - startTime.getTime();
  const averageTime = executionTime / loopCount;
  return `!${test_id}: ${averageTime} ms`;
}

测试结果

测试用例	测试平台	运行时间
测试用例 1	[Huawei Phone]	0.00034 ms

---

@ohos.util.TreeSet.remove

官方API文档

测试用例 2: 测试TreeSet容器remove接口

function test_remove(loopCount: number): string {
  // test: TreeSet.remove
  // desc: 测试TreeSet容器remove接口
  const test_id = 2;

  // prepare: setup objects to test
  let treeSet = new TreeSet<number>();
  for (let i = 0; i < 50000; i++) {
    treeSet.add(i);
  }

  // test
  const startTime = new Date();
  for (let i = 0; i < loopCount; i++) {
    treeSet.remove(i);
  }
  const endTime = new Date();

  // finish
  const executionTime = endTime.getTime() - startTime.getTime();
  const averageTime = executionTime / loopCount;
  return `!${test_id}: ${averageTime} ms`;
}

测试结果

测试用例	测试平台	运行时间
测试用例 2	[Huawei Phone]	0.00034 ms

---

@ohos.util.TreeSet.has

官方API文档

最优情况

测试用例 1: 测试在最优情况下（查找存在的第一个元素）TreeSet容器的has接口

function test_hasBest(loopCount: number): string {
  // test: TreeSet.has
  // desc: 测试在最优情况下（查找存在的第一个元素）TreeSet容器的has接口，TreeSet长度为 50000
  const test_id = 3;

  // prepare: setup objects to test
  let treeSet = new TreeSet<number>();
  for (let i = 0; i < 50000; i++) {
    treeSet.add(i);
  }

  // test
  const startTime = new Date();
  for (let i = 0; i < loopCount; i++) {
    treeSet.has(0);
  }
  const endTime = new Date();

  // finish
  const executionTime = endTime.getTime() - startTime.getTime();
  const averageTime = executionTime / loopCount;
  return `!${test_id}: ${averageTime} ms`;
}

测试结果

测试用例	测试平台	运行时间
测试用例 1	[Huawei Phone]	0.00016 ms

---

最坏情况

官方API文档

测试用例 2: 测试在最坏情况下（查找不存在的元素）TreeSet容器的has接口

function test_hasWorst(loopCount: number): string {
  // test: TreeSet.has
  // desc: 测试在最坏情况下（查找不存在的元素）TreeSet容器的has接口，TreeSet长度为 50000
  const test_id = 4;

  // prepare: setup objects to test
  let treeSet = new TreeSet<number>();
  for (let i = 0; i < 50000; i++) {
    treeSet.add(i);
  }

  // test
  const startTime = new Date();
  for (let i = 0; i < loopCount; i++) {
    treeSet.has(100000);
  }
  const endTime = new Date();

  // finish
  const executionTime = endTime.getTime() - startTime.getTime();
  const averageTime = executionTime / loopCount;
  return `!${test_id}: ${averageTime} ms`;
}

测试结果

测试用例	测试平台	运行时间
测试用例 2	[Huawei Phone]	0.00026 ms
[Huawei Phone]: ../../../device#huawei-phone
---