386320d266
This is extracted from another git repo. This is the first release, and the prior commit history is not terribly interesting, so I'm not going to bother using filter-branch to try to cleanly isolate the history for this tool. Cheers.
217 lines
4.7 KiB
C++
217 lines
4.7 KiB
C++
// -*- c++ -*-
|
|
|
|
// 1. implement "fixed" generator
|
|
// 2. implement discrete generator
|
|
// 3. implement combine generator?
|
|
|
|
#ifndef GENERATOR_H
|
|
#define GENERATOR_H
|
|
|
|
#define MAX(a,b) ((a) > (b) ? (a) : (b))
|
|
|
|
#include "config.h"
|
|
|
|
#include <string>
|
|
#include <vector>
|
|
#include <utility>
|
|
|
|
#include <assert.h>
|
|
#include <inttypes.h>
|
|
#include <limits.h>
|
|
#include <math.h>
|
|
#include <stdint.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#include "log.h"
|
|
#include "util.h"
|
|
|
|
// Generator syntax:
|
|
//
|
|
// \d+ == fixed
|
|
// n[ormal]:mean,sd
|
|
// e[xponential]:lambda
|
|
// p[areto]:scale,shape
|
|
// g[ev]:loc,scale,shape
|
|
// fb_value, fb_key, fb_rate
|
|
|
|
class Generator {
|
|
public:
|
|
Generator() {}
|
|
// Generator(const Generator &g) = delete;
|
|
// virtual Generator& operator=(const Generator &g) = delete;
|
|
virtual ~Generator() {}
|
|
|
|
virtual double generate(double U = -1.0) = 0;
|
|
virtual void set_lambda(double lambda) {DIE("set_lambda() not implemented");}
|
|
protected:
|
|
std::string type;
|
|
};
|
|
|
|
class Fixed : public Generator {
|
|
public:
|
|
Fixed(double _value = 1.0) : value(_value) { D("Fixed(%f)", value); }
|
|
virtual double generate(double U = -1.0) { return value; }
|
|
virtual void set_lambda(double lambda) {
|
|
if (lambda > 0.0) value = 1.0 / lambda;
|
|
else value = 0.0;
|
|
}
|
|
|
|
private:
|
|
double value;
|
|
};
|
|
|
|
class Uniform : public Generator {
|
|
public:
|
|
Uniform(double _scale) : scale(_scale) { D("Uniform(%f)", scale); }
|
|
|
|
virtual double generate(double U = -1.0) {
|
|
if (U < 0.0) U = drand48();
|
|
return scale * U;
|
|
}
|
|
|
|
virtual void set_lambda(double lambda) {
|
|
if (lambda > 0.0) scale = 2.0 / lambda;
|
|
else scale = 0.0;
|
|
}
|
|
|
|
private:
|
|
double scale;
|
|
};
|
|
|
|
class Normal : public Generator {
|
|
public:
|
|
Normal(double _mean = 1.0, double _sd = 1.0) : mean(_mean), sd(_sd) {
|
|
D("Normal(mean=%f, sd=%f)", mean, sd);
|
|
}
|
|
|
|
virtual double generate(double U = -1.0) {
|
|
if (U < 0.0) U = drand48();
|
|
double V = U; // drand48();
|
|
double N = sqrt(-2 * log(U)) * cos(2 * M_PI * V);
|
|
return mean + sd * N;
|
|
}
|
|
|
|
virtual void set_lambda(double lambda) {
|
|
if (lambda > 0.0) mean = 1.0 / lambda;
|
|
else mean = 0.0;
|
|
}
|
|
|
|
private:
|
|
double mean, sd;
|
|
};
|
|
|
|
class Exponential : public Generator {
|
|
public:
|
|
Exponential(double _lambda = 1.0) : lambda(_lambda) {
|
|
D("Exponential(lambda=%f)", lambda);
|
|
}
|
|
|
|
virtual double generate(double U = -1.0) {
|
|
if (lambda <= 0.0) return 0.0;
|
|
if (U < 0.0) U = drand48();
|
|
return -log(U) / lambda;
|
|
}
|
|
|
|
virtual void set_lambda(double lambda) { this->lambda = lambda; }
|
|
|
|
private:
|
|
double lambda;
|
|
};
|
|
|
|
class GPareto : public Generator {
|
|
public:
|
|
GPareto(double _scale = 1.0, double _shape = 1.0) :
|
|
scale(_scale), shape(_shape) {
|
|
assert(shape != 0.0);
|
|
D("GPareto(scale=%f, shape=%f)", scale, shape);
|
|
}
|
|
|
|
virtual double generate(double U = -1.0) {
|
|
if (U < 0.0) U = drand48();
|
|
return scale * (pow(U, -shape) - 1) / shape;
|
|
}
|
|
|
|
virtual void set_lambda(double lambda) {
|
|
if (lambda <= 0.0) scale = 0.0;
|
|
else scale = (1 - shape) / lambda;
|
|
}
|
|
|
|
private:
|
|
double scale /* sigma */, shape /* k */;
|
|
};
|
|
|
|
class GEV : public Generator {
|
|
public:
|
|
GEV(double _loc = 0.0, double _scale = 1.0, double _shape = 1.0) :
|
|
e(1.0), loc(_loc), scale(_scale), shape(_shape) {
|
|
assert(shape != 0.0);
|
|
D("GEV(loc=%f, scale=%f, shape=%f)", loc, scale, shape);
|
|
}
|
|
|
|
virtual double generate(double U = -1.0) {
|
|
return loc + scale * (pow(e.generate(U), -shape) - 1) / shape;
|
|
}
|
|
|
|
private:
|
|
Exponential e;
|
|
double loc /* mu */, scale /* sigma */, shape /* k */;
|
|
};
|
|
|
|
class Discrete : public Generator {
|
|
public:
|
|
~Discrete() { delete def; }
|
|
Discrete(Generator* _def = NULL) : def(_def) {
|
|
if (def == NULL) def = new Fixed(0.0);
|
|
}
|
|
|
|
virtual double generate(double U = -1.0) {
|
|
double Uc = U;
|
|
if (pv.size() > 0 && U < 0.0) U = drand48();
|
|
|
|
double sum = 0;
|
|
|
|
for (auto p: pv) {
|
|
sum += p.first;
|
|
if (U < sum) return p.second;
|
|
}
|
|
|
|
return def->generate(Uc);
|
|
// return 0.0;
|
|
}
|
|
|
|
void add(double p, double v) {
|
|
pv.push_back(std::pair<double,double>(p, v));
|
|
}
|
|
|
|
private:
|
|
Generator *def;
|
|
std::vector< std::pair<double,double> > pv;
|
|
};
|
|
|
|
class KeyGenerator {
|
|
public:
|
|
KeyGenerator(Generator* _g, double _max = 10000) : g(_g), max(_max) {}
|
|
std::string generate(uint64_t ind) {
|
|
uint64_t h = fnv_64(ind);
|
|
double U = (double) h / ULLONG_MAX;
|
|
double G = g->generate(U);
|
|
int keylen = MAX(round(G), floor(log10(max)) + 1);
|
|
char key[256];
|
|
snprintf(key, 256, "%0*" PRIu64, keylen, ind);
|
|
|
|
// D("%d = %s", ind, key);
|
|
return std::string(key);
|
|
}
|
|
private:
|
|
Generator* g;
|
|
double max;
|
|
};
|
|
|
|
Generator* createGenerator(std::string str);
|
|
Generator* createFacebookKey();
|
|
Generator* createFacebookValue();
|
|
Generator* createFacebookIA();
|
|
|
|
#endif // GENERATOR_H
|