Skip to content

Commit

Permalink
New release
Browse files Browse the repository at this point in the history
  • Loading branch information
lemire committed Aug 21, 2014
1 parent ec608b6 commit 74c0dc3
Show file tree
Hide file tree
Showing 54 changed files with 61 additions and 62 deletions.
3 changes: 2 additions & 1 deletion CHANGELOG
Original file line number Diff line number Diff line change
@@ -1,7 +1,8 @@
upcoming
0.1.5 August 21st 2014
Added SIMD versions of OptPFD and NewPFD.
Fixed buffer overrun in varintg8iu
Factor out decodeBlock method from decodeArray (Matthias Petri)
Renamed the FastPfor namespace FastPforLib to avoid name clash
0.1.4 May 21st 2014
Added "myths" section to README file
0.1.3 January 22nd 2014
Expand Down
2 changes: 1 addition & 1 deletion example.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@


int main() {
using namespace FastPFor;
using namespace FastPForLib;

// We pick a CODEC
IntegerCODEC & codec = * CODECFactory::getFromName("simdfastpfor");
Expand Down
2 changes: 1 addition & 1 deletion headers/VarIntG8IU.h
Original file line number Diff line number Diff line change
Expand Up @@ -15,7 +15,7 @@
#define PREDICT_FALSE(x) x
#endif

namespace FastPFor {
namespace FastPForLib {
/**
*
* Implementation of varint-G8IU taken from
Expand Down
2 changes: 1 addition & 1 deletion headers/bitpackingaligned.h
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@

#include "common.h"

namespace FastPFor {
namespace FastPForLib {

const uint32_t * fastunpack_8(const uint32_t * __restrict__ in,
uint32_t * __restrict__ out, const uint32_t bit);
Expand Down
2 changes: 1 addition & 1 deletion headers/bitpackinghelpers.h
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@

#include "bitpacking.h"

namespace FastPFor {
namespace FastPForLib {

inline void fastunpack(const uint32_t * __restrict__ in, uint32_t * __restrict__ out, const uint32_t bit) {
// Could have used function pointers instead of switch.
Expand Down
2 changes: 1 addition & 1 deletion headers/bitpackingunaligned.h
Original file line number Diff line number Diff line change
Expand Up @@ -8,7 +8,7 @@
#define BITPACKINGUNALIGNED
#include "common.h"

namespace FastPFor {
namespace FastPForLib {

typedef uint8_t byte;

Expand Down
2 changes: 1 addition & 1 deletion headers/blockpacking.h
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@
#include "bitpackingaligned.h"
#include "util.h"

namespace FastPFor {
namespace FastPForLib {

/**
* This is 32-bit *aligned* binary packing, designed from the
Expand Down
2 changes: 1 addition & 1 deletion headers/codecfactory.h
Original file line number Diff line number Diff line change
Expand Up @@ -31,7 +31,7 @@
#include "simdbinarypacking.h"
#include "snappydelta.h"

namespace FastPFor {
namespace FastPForLib {

typedef std::map<std::string, std::shared_ptr<IntegerCODEC> > CodecMap;

Expand Down
2 changes: 1 addition & 1 deletion headers/codecs.h
Original file line number Diff line number Diff line change
Expand Up @@ -12,7 +12,7 @@
#include "util.h"
#include "bitpackinghelpers.h"

namespace FastPFor {
namespace FastPForLib {

class NotEnoughStorage: public std::runtime_error {
public:
Expand Down
2 changes: 1 addition & 1 deletion headers/compositecodec.h
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@
#include "util.h"
#include "codecs.h"

namespace FastPFor {
namespace FastPForLib {

/**
* This is a useful class for CODEC that only compress
Expand Down
4 changes: 2 additions & 2 deletions headers/cpubenchmark.h
Original file line number Diff line number Diff line change
Expand Up @@ -10,11 +10,11 @@

#include "common.h"

namespace FastPFor {
namespace FastPForLib {

#if defined( __corei7__ ) // __amd64__ is untested
// start and stop are as recommended by
// Gabriele Paoloni, How to Benchmark Code Execution Times on Intel¨ IA-32 and IA-64 Instruction Set Architectures
// Gabriele Paoloni, How to Benchmark Code Execution Times on Intel IA-32 and IA-64 Instruction Set Architectures
// September 2010
// http://edc.intel.com/Link.aspx?id=3954

Expand Down
2 changes: 1 addition & 1 deletion headers/csv.h
Original file line number Diff line number Diff line change
Expand Up @@ -15,7 +15,7 @@
#include <vector>
#include "common.h"

namespace FastPFor {
namespace FastPForLib {

enum {
INCREASINGCARDINALITY, DECREASINGCARDINALITY
Expand Down
2 changes: 1 addition & 1 deletion headers/deltautil.h
Original file line number Diff line number Diff line change
Expand Up @@ -15,7 +15,7 @@
#include "entropy.h"
#include "ztimer.h"

namespace FastPFor {
namespace FastPForLib {

/**
* This file is made of various convenient functions and structures.
Expand Down
2 changes: 1 addition & 1 deletion headers/entropy.h
Original file line number Diff line number Diff line change
Expand Up @@ -12,7 +12,7 @@
#include "common.h"
#include "util.h"

namespace FastPFor {
namespace FastPForLib {

class EntropyRecorder {
public:
Expand Down
2 changes: 1 addition & 1 deletion headers/externalvector.h
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@
#include <queue>
#include "common.h"

namespace FastPFor {
namespace FastPForLib {

template<class CMP>
class BinaryFileBuffer {
Expand Down
2 changes: 1 addition & 1 deletion headers/fastpfor.h
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@
#include "blockpacking.h"
#include "simple8b.h"

namespace FastPFor {
namespace FastPForLib {

/**
* FastPFor
Expand Down
2 changes: 1 addition & 1 deletion headers/horizontalbitpacking.h
Original file line number Diff line number Diff line change
Expand Up @@ -31,7 +31,7 @@
#endif
#include "common.h"

namespace FastPFor {
namespace FastPForLib {

void simdhunpack(const uint8_t * __restrict__ in,uint32_t * __restrict__ out, uint32_t bit);

Expand Down
2 changes: 1 addition & 1 deletion headers/maropuparser.h
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@

#include "common.h"

namespace FastPFor {
namespace FastPForLib {

/**
* This is just a bit of code to parse the binary files provided by the
Expand Down
2 changes: 1 addition & 1 deletion headers/memutil.h
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@

#include "common.h"

namespace FastPFor {
namespace FastPForLib {

template<class T, size_t alignment>
T * moveToBoundary(T * inbyte) {
Expand Down
2 changes: 1 addition & 1 deletion headers/mersenne.h
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@
#include "common.h"
#include "util.h"

namespace FastPFor {
namespace FastPForLib {

/**
* Mersenne twister - random number generator.
Expand Down
2 changes: 1 addition & 1 deletion headers/newpfor.h
Original file line number Diff line number Diff line change
Expand Up @@ -19,7 +19,7 @@
#include "util.h"
#include "codecs.h"

namespace FastPFor {
namespace FastPForLib {

/**
* NewPFD also known as NewPFOR.
Expand Down
2 changes: 1 addition & 1 deletion headers/optpfor.h
Original file line number Diff line number Diff line change
Expand Up @@ -18,7 +18,7 @@
#include "simple16.h"
#include "newpfor.h"

namespace FastPFor {
namespace FastPForLib {

/**
* OptPFD
Expand Down
2 changes: 1 addition & 1 deletion headers/packingvectors.h
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@
#include "common.h"
#include "bitpacking.h"

namespace FastPFor {
namespace FastPForLib {

template <uint32_t PACKSIZE = 32>
class packingvector
Expand Down
2 changes: 1 addition & 1 deletion headers/pfor.h
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@
#include "bitpacking.h"
#include "util.h"

namespace FastPFor {
namespace FastPForLib {

/**
* This implements as best as possible the PFor scheme
Expand Down
2 changes: 1 addition & 1 deletion headers/pfor2008.h
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@
#include "util.h"
#include <iostream>

namespace FastPFor {
namespace FastPForLib {

/**
* Follows:
Expand Down
2 changes: 1 addition & 1 deletion headers/rolledbitpacking.h
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@
#include "util.h"


namespace FastPFor {
namespace FastPForLib {

/***
* The idea here is not to unroll the loops and to let the
Expand Down
2 changes: 1 addition & 1 deletion headers/simdbinarypacking.h
Original file line number Diff line number Diff line change
Expand Up @@ -12,7 +12,7 @@
#include "simdbitpacking.h"
#include "util.h"

namespace FastPFor {
namespace FastPForLib {

/**
*
Expand Down
2 changes: 1 addition & 1 deletion headers/simdbitpacking.h
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@

#include "common.h"

namespace FastPFor {
namespace FastPForLib {

void simdpack(const uint32_t * __restrict__ in,__m128i * __restrict__ out, uint32_t bit);
void simdpackwithoutmask(const uint32_t * __restrict__ in,__m128i * __restrict__ out, uint32_t bit);
Expand Down
2 changes: 1 addition & 1 deletion headers/simdfastpfor.h
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@
#include "memutil.h"
#include "util.h"

namespace FastPFor {
namespace FastPForLib {

/**
* SIMDFastPFor
Expand Down
2 changes: 1 addition & 1 deletion headers/simdnewpfor.h
Original file line number Diff line number Diff line change
Expand Up @@ -23,7 +23,7 @@
#include "usimdbitpacking.h"


namespace FastPFor {
namespace FastPForLib {

/**
* SIMDNewPFD, a SIMD-version of NewPFD designed by D. Lemire.
Expand Down
2 changes: 1 addition & 1 deletion headers/simdoptpfor.h
Original file line number Diff line number Diff line change
Expand Up @@ -18,7 +18,7 @@
#include "simple16.h"
#include "simdnewpfor.h"

namespace FastPFor {
namespace FastPForLib {

/**
* SIMDOptPFor, a SIMD-version of OPTPFor designed by D. Lemire
Expand Down
2 changes: 1 addition & 1 deletion headers/simdpfor.h
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@
#include "usimdbitpacking.h"
#include "util.h"

namespace FastPFor {
namespace FastPForLib {

/**
* This implements as best as possible the PFor scheme
Expand Down
2 changes: 1 addition & 1 deletion headers/simple16.h
Original file line number Diff line number Diff line change
Expand Up @@ -15,7 +15,7 @@
#include "common.h"
#include "codecs.h"

namespace FastPFor {
namespace FastPForLib {

/**
* If MarkLength is true, than the number of symbols is written
Expand Down
4 changes: 1 addition & 3 deletions headers/simple8b.h
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@
#include "common.h"
#include "codecs.h"

namespace FastPFor {
namespace FastPForLib {

/**
* Follows Vo Ngoc Anh, Alistair Moffat: Index compression using 64-bit words.
Expand All @@ -31,7 +31,6 @@ namespace FastPFor {
template<bool MarkLength>
class Simple8b: public IntegerCODEC {
public:

template<uint32_t num1, uint32_t log1>
static bool tryme(const uint32_t *n, size_t len) {
if (log1 >= 32)
Expand All @@ -53,7 +52,6 @@ class Simple8b: public IntegerCODEC {
}
return true;
}

static void bit_writer(uint64_t * out, const uint32_t value,
const uint32_t bits) {
*out = (*out << bits) | value;
Expand Down
2 changes: 1 addition & 1 deletion headers/simple9.h
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@
#include "common.h"
#include "codecs.h"

namespace FastPFor {
namespace FastPForLib {

/**
* If MarkLength is true, than the number of symbols is written
Expand Down
2 changes: 1 addition & 1 deletion headers/stringutil.h
Original file line number Diff line number Diff line change
Expand Up @@ -12,7 +12,7 @@
#include "common.h"
#include "util.h"

namespace FastPFor {
namespace FastPForLib {

using namespace std;

Expand Down
2 changes: 1 addition & 1 deletion headers/synthetic.h
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@
#include "mersenne.h"
#include "memutil.h"

namespace FastPFor {
namespace FastPForLib {

std::vector<uint32_t,cacheallocator> generateArray(uint32_t N, const uint32_t mask = 0xFFFFFFFFU) {
std::vector<uint32_t,cacheallocator> ans(N);
Expand Down
2 changes: 1 addition & 1 deletion headers/usimdbitpacking.h
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@

#include "common.h"

namespace FastPFor {
namespace FastPForLib {

void usimdpack(const uint32_t * __restrict__ in,__m128i * __restrict__ out, uint32_t bit);
void usimdpackwithoutmask(const uint32_t * __restrict__ in,__m128i * __restrict__ out, uint32_t bit);
Expand Down
2 changes: 1 addition & 1 deletion headers/util.h
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@
#define USE_O_DIRECT
#endif

namespace FastPFor {
namespace FastPForLib {

//#define STATS
// taken from stackoverflow
Expand Down
2 changes: 1 addition & 1 deletion headers/variablebyte.h
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@
#include "common.h"
#include "codecs.h"

namespace FastPFor {
namespace FastPForLib {

class VariableByte: public IntegerCODEC {
public:
Expand Down
Loading

0 comments on commit 74c0dc3

Please sign in to comment.