blob: 24143f35243b9c387ecc6d72c98bdf8bfd13d1fd (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
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
|
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include "../init/BOBHash32.h"
#include "../init/BOBHash64.h"
#include "../init/params.h"
#include "../init/ssummary.h"
#include "../include/LossyCounting.h"
using namespace std;
LossyCounting::LossyCounting(int K):K(K) {ss=new ssummary(0); ss->clear();}
void LossyCounting::Insert(string x,int c)
{
bool mon=false;
int p=ss->find(x);
if (p) mon=true;
if (!mon)
{
int q=c+1;
int i=ss->getid();
ss->add2(ss->location(x),i);
ss->str[i]=x;
ss->sum[i]=q;
ss->link(i,0);
} else
{
int tmp=ss->Left[ss->sum[p]];
ss->cut(p);
if(ss->head[ss->sum[p]])tmp=ss->sum[p];
ss->sum[p]++;
ss->link(p,tmp);
}
}
void LossyCounting::clear(int c)
{
while (ss->getmin()<c)
{
int t=ss->Right[0];
int tmp=ss->head[t];
ss->cut(ss->head[t]);
ss->recycling(tmp);
}
}
void LossyCounting::work()
{
int CNT=0;
for(int i=N;i;i=ss->Left[i])
for(int j=ss->head[i];j;j=ss->Next[j]) {q[CNT].x=ss->str[j]; q[CNT].y=ss->sum[j]; CNT++; }
sort(q,q+CNT,cmp);
}
pair<string ,int> LossyCounting::Query(int k)
{
return make_pair(q[k].x,q[k].y);
}
// LossyCounting::~LossyCounting()
//{
// }
|
