vnix Namespace Reference

Thomas E. Vaughan's public software. More...

Namespaces
	impl
	mv
	rat
	Classes and functions supporting a model of a fixed-precision rational number.
	units
	Classes and functions supporting a model of physically dimensioned quantities.

Classes
struct	int_types
	Smallest integer types for holding certain number of bits. More...
struct	int_types< 16 >
	Terminal specialization of int_types for 16-bit integer. More...
struct	int_types< 32 >
	Terminal specialization of int_types for 32-bit integer. More...
struct	int_types< 64 >
	Terminal specialization of int_types for 64-bit integer. More...
struct	int_types< 8 >
	Terminal specialization of int_types for eight-bit integer. More...

Typedefs
template<typename U , typename V >
using	gcd_promoted = decltype(U()%V())
	Output-type resulting from modular division of input-types. More...
template<unsigned NB, unsigned DB>
using	rational = rat::rational< NB, DB >
	Bring class rational into vnix namespace. More...
using	rat8_t = rational< 5, 3 >
	Rational with five bits for numerator and three for denominator. More...
using	rat16_t = rational< 9, 7 >
	Rational with nine bits for numerator and seven for denominator. More...
using	rat32_t = rational< 17, 15 >
	Rational with 17 bits for numerator and 15 for denominator. More...
using	rat64_t = rational< 33, 31 >
	Rational with 33 bits for numerator and 31 for denominator. More...

Functions
template<typename A , typename B >
constexpr gcd_promoted< A, B >	gcd (A a, B b)
	Greatest common divisor of two numbers; only absolute values are used. More...
template<typename I >
constexpr I	bit (unsigned n)
	Word with specified bit set. More...
template<typename I >
constexpr I	bit_range (unsigned n1, unsigned n2)
	Word with specified range of bits set. More...

Detailed Description

Thomas E. Vaughan's public software.

Typedef Documentation

template<typename U , typename V >

using vnix::gcd_promoted = typedef decltype(U() % V())

Output-type resulting from modular division of input-types.

Template Parameters

U	One input type.
V	Other input type.

Definition at line 16 of file gcd.hpp.

using vnix::rat16_t = typedef rational<9, 7>

Rational with nine bits for numerator and seven for denominator.

Definition at line 24 of file rat.hpp.

using vnix::rat32_t = typedef rational<17, 15>

Rational with 17 bits for numerator and 15 for denominator.

Definition at line 27 of file rat.hpp.

using vnix::rat64_t = typedef rational<33, 31>

Rational with 33 bits for numerator and 31 for denominator.

Definition at line 30 of file rat.hpp.

using vnix::rat8_t = typedef rational<5, 3>

Rational with five bits for numerator and three for denominator.

Definition at line 21 of file rat.hpp.

template<unsigned NB, unsigned DB>

using vnix::rational = typedef rat::rational<NB, DB>

Bring class rational into vnix namespace.

Template Parameters

NB	Number of bits for numerator.
DB	Number of bits for denominator.

Definition at line 17 of file rat.hpp.

Function Documentation

template<typename I >

constexpr I vnix::bit

(

unsigned

n

)

Word with specified bit set.

Template Parameters

I	Type of integer word.

Parameters

n	Offset of bit in word.

Definition at line 15 of file bit-range.hpp.

{ return I(1) << n; }

Here is the caller graph for this function:

template<typename I >

constexpr I vnix::bit_range	(	unsigned	n1,
		unsigned	n2
	)

Word with specified range of bits set.

Template Parameters

I	Type of integer word.

Parameters

n1	Offset of bit at one end of range.
n2	Offset of bit at other end of range.

Definition at line 22 of file bit-range.hpp.

                                                                      {
  if (n1 < n2) { return bit<I>(n1) | bit_range<I>(n1 + 1, n2); }
  if (n2 < n1) { return bit<I>(n2) | bit_range<I>(n2 + 1, n1); }
  return bit<I>(n1);
}

Here is the caller graph for this function:

template<typename A , typename B >

constexpr gcd_promoted<A, B> vnix::gcd	(	A	a,
		B	b
	)

Greatest common divisor of two numbers; only absolute values are used.

Parameters

a	First number.
b	Second number.

Returns

Greatest common divisor.

Definition at line 40 of file gcd.hpp.

                                                                             {
  if (a < 0) { a = -a; }
  if (b == 0) { return a; }
  if (b < 0) { b = -b; }
  return impl::basic_gcd(b, a % b);
}

Here is the caller graph for this function: