histogramTest.cpp 3.6 KB
Newer Older
H
hjxilinx 已提交
1 2 3 4 5 6
#include <gtest/gtest.h>
#include <sys/time.h>
#include <cassert>
#include <iostream>

#include "taos.h"
H
Haojun Liao 已提交
7
#include "qHistogram.h"
8

S
Shengliang Guan 已提交
9
#pragma GCC diagnostic push
S
Shengliang Guan 已提交
10 11 12
#pragma GCC diagnostic ignored "-Wunused-function"
#pragma GCC diagnostic ignored "-Wunused-variable"

13 14
namespace {
void doHistogramAddTest() {
H
hjxilinx 已提交
15 16 17 18 19 20 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 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73
  SHistogramInfo* pHisto = NULL;

  /**
   * use arrayList, elapsed time is:
   * before:
   * 10,000,000  45sec, bin:1000 (-O0) / 17sec. bin:1000, (-O3)
   *
   * after:
   *
   */
  struct timeval systemTime;
  gettimeofday(&systemTime, NULL);
  int64_t st =
      (int64_t)systemTime.tv_sec * 1000L + (uint64_t)systemTime.tv_usec / 1000;
  for (int32_t i = 0; i < 10000; ++i) {
    tHistogramAdd(&pHisto, i);
    //        tHistogramPrint(pHisto);
  }
  //
  gettimeofday(&systemTime, NULL);
  int64_t et =
      (int64_t)systemTime.tv_sec * 1000L + (uint64_t)systemTime.tv_usec / 1000;
  printf("total elapsed time: %ld\n", et - st);

  printf("elements: %d, slot:%d \n", pHisto->numOfElems, pHisto->numOfEntries);
  tHistogramPrint(pHisto);

  printf("%ld\n", tHistogramSum(pHisto, 1.5));
  printf("%ld\n", tHistogramSum(pHisto, 2));
  printf("%ld\n", tHistogramSum(pHisto, 3));
  printf("%ld\n", tHistogramSum(pHisto, 4));
  printf("%ld\n", tHistogramSum(pHisto, 5));
  printf("%ld\n", tHistogramSum(pHisto, 6));

  for (int32_t i = 399; i < 400; ++i) {
    printf("val:%d, %ld\n", i, tHistogramSum(pHisto, i));
  }

  double ratio[] = {0 / 100, 20.0 / 100, 88.0 / 100, 100 / 100};
  double* res = tHistogramUniform(pHisto, ratio, 4);
  for (int32_t i = 0; i < 4; ++i) {
    printf("%f\n", res[i]);
  }

  SHistogramInfo* pHisto1 = NULL;
  for (int32_t i = (90000 - 1); i >= 80000; --i) {
    tHistogramAdd(&pHisto1, i);
  }
  tHistogramPrint(pHisto1);

  SHistogramInfo* pRes = tHistogramMerge(pHisto1, pHisto, MAX_HISTOGRAM_BIN);
  assert(pRes->numOfElems == pHisto->numOfElems + pHisto1->numOfElems);
  tHistogramPrint(pRes);

  tHistogramDestroy(&pHisto);
  tHistogramDestroy(&pHisto1);
  tHistogramDestroy(&pRes);
  free(res);
}
74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123
void doHistogramRepeatTest() {
  SHistogramInfo* pHisto = NULL;
  struct timeval systemTime;

  gettimeofday(&systemTime, NULL);
  int64_t st =
      (int64_t)systemTime.tv_sec * 1000L + (uint64_t)systemTime.tv_usec / 1000;

  for (int32_t i = 0; i < 1000; ++i) {
    tHistogramAdd(&pHisto, -24 + i);
    //        tHistogramPrint(pHisto);
  }

  tHistogramDestroy(&pHisto);

}
}

/* test validate the names for table/database */
TEST(testCase, histogram_binary_search) {
  SHistogramInfo* pHisto = tHistogramCreate(MAX_HISTOGRAM_BIN);

  pHisto->numOfEntries = 10;
  for (int32_t i = 0; i < 10; ++i) {
    pHisto->elems[i].num = 1;
    pHisto->elems[i].val = i;
  }

  int32_t idx = histoBinarySearch(pHisto->elems, pHisto->numOfEntries, 1);
  assert(idx == 1);

  idx = histoBinarySearch(pHisto->elems, pHisto->numOfEntries, 9);
  assert(idx == 9);

  idx = histoBinarySearch(pHisto->elems, pHisto->numOfEntries, 20);
  assert(idx == 10);

  idx = histoBinarySearch(pHisto->elems, pHisto->numOfEntries, -1);
  assert(idx == 0);

  idx = histoBinarySearch(pHisto->elems, pHisto->numOfEntries, 3.9);
  assert(idx == 4);

  free(pHisto);
}

TEST(testCase, histogram_add) {
  doHistogramAddTest();
  doHistogramRepeatTest();
}
H
hjxilinx 已提交
124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143

TEST(testCase, heapsort) {
  //    int32_t num = 20;
  //
  //    SHeapEntry* pEntry = tHeapCreate(num);
  //
  //    for(int32_t i=0; i<num; ++i) {
  //        pEntry[i].val = num - 1 - i;
  //    }
  //
  //    tHeapSort(pEntry, num);
  //
  //    for(int32_t i=0; i<num; ++i) {
  //        printf("%lf, ", pEntry[i].val);
  //    }
  //
  //    printf("\n");
  //
  //    free(pEntry);
}
S
Shengliang Guan 已提交
144 145

#pragma GCC diagnostic pop