bn::util Namespace Reference

Functions
template<class T >
void	put (const T &x, size_t len)
template<class T >
void	put (const T &x)
template<class Vec >
void	convertToBinary (Vec &v, const mie::Vuint &x)
template<class Vec >
size_t	getContinuousVal (const Vec &v, size_t pos, int val)
template<class Vec >
void	convertToNAF (Vec &v, const Vec &in)
template<class Vec >
size_t	getNumOfNonZeroElement (const Vec &v)
template<class Vec >
bool	getGoodRepl (Vec &v, const mie::Vuint &x)

Function Documentation

convertToBinary()

template<class Vec >

void bn::util::convertToBinary	(	Vec &	v,
		const mie::Vuint &	x )

Definition at line 103 of file bn.h.

{
    const size_t len = x.bitLen();
    v.clear();
    for (size_t i = 0; i < len; i++) {
        v.push_back(x.testBit(len - 1 - i) ? 1 : 0);
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

convertToNAF()

template<class Vec >

void bn::util::convertToNAF	(	Vec &	v,
		const Vec &	in )

Definition at line 121 of file bn.h.

{
    v = in;
    size_t pos = v.size() - 1;
    for (;;) {
        size_t p = getContinuousVal(v, pos, 0);
        if (p == 1) return;
        assert(v[p] == 1);
        size_t q = getContinuousVal(v, p, 1);
        if (q == 1) return;
        assert(v[q] == 0);
        if (p - q <= 1) {
            pos = p - 1;
            continue;
        }
        v[q] = 1;
        for (size_t i = q + 1; i < p; i++) {
            v[i] = 0;
        }
        v[p] = -1;
        pos = q;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

getContinuousVal()

template<class Vec >

size_t bn::util::getContinuousVal	(	const Vec &	v,
		size_t	pos,
		int	val )

Definition at line 112 of file bn.h.

{
    while (pos >= 2) {
        if (v[pos] != val) break;
        pos--;
    }
    return pos;
}

Here is the caller graph for this function:

getGoodRepl()

template<class Vec >

bool bn::util::getGoodRepl	(	Vec &	v,
		const mie::Vuint &	x )

Definition at line 159 of file bn.h.

{
    Vec bin;
    util::convertToBinary(bin, x);
    Vec naf;
    util::convertToNAF(naf, bin);
    const size_t binW = util::getNumOfNonZeroElement(bin);
    const size_t nafW = util::getNumOfNonZeroElement(naf);
    if (nafW < binW) {
        v.swap(naf);
        return true;
    } else {
        v.swap(bin);
        return false;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

getNumOfNonZeroElement()

template<class Vec >

size_t bn::util::getNumOfNonZeroElement

(

const Vec &

v

)

Definition at line 145 of file bn.h.

{
    size_t w = 0;
    for (size_t i = 0; i < v.size(); i++) {
        if (v[i]) w++;
    }
    return w;
}

Here is the caller graph for this function:

put() [1/2]

template<class T >

void bn::util::put

(

const T &

x

)

Definition at line 98 of file bn.h.

{
    put(x, x.size());
}

Here is the call graph for this function:

put() [2/2]

template<class T >

void bn::util::put	(	const T &	x,
		size_t	len )

Definition at line 90 of file bn.h.

{
    for (size_t i = 0; i < len; i++) {
        printf("% 2d,", x[i]);
    }
    printf("\n");
}