<commit_before>//---------------------------------------------------------------------
// Monte Carlo & Quasi Monte Carlo stuff
//---------------------------------------------------------------------

#ifndef __MCQMC_H
#define __MCQMC_H

__BEGIN_YAFRAY
// fast incremental Halton sequence generator
// calculation of value must be double prec.
class Halton
{
public:

	Halton()
	{
		//Empty
	}

	Halton(int base)
	{
		setBase(base);
	}

	void setBase(int base)
	{
		mBase = base;
		mInvBase = 1.0 / (double) base;
		mValue = 0;
	}

	void reset()
	{
		mValue=0.0;
	}

	inline void setStart(unsigned int i)
	{
		double factor = mInvBase;

		mValue = 0.0;

		while (i > 0)
		{
			mValue += (double) (i % mBase) * factor;
			i /= mBase;
			factor *= mInvBase;
		}
	}

	inline float getNext()
	{
		double r = 0.9999999999 - mValue;
		if (mInvBase < r)
		{
			mValue += mInvBase;
		}
		else
		{
			double hh, h = mInvBase;
			while (h >= r)
			{
				hh = h;
				h *= mInvBase;
			}

			mValue += hh + h - 1.0;
		}
		return std::max(0.f, std::min(1.f, (float)mValue));
	}

private:
	unsigned int mBase;
	double mInvBase;
	double mValue;
};


// fast base-2 van der Corput, Sobel, and Larcher & Pillichshammer sequences,
// all from "Efficient Multidimensional Sampling" by <NAME>
#define multRatio (0.00000000023283064365386962890625)
inline PFLOAT RI_vdC(unsigned int bits, unsigned int r=0)
{
	bits = ( bits << 16) | ( bits >> 16);
	bits = ((bits & 0x00ff00ff) << 8) | ((bits & 0xff00ff00) >> 8);
	bits = ((bits & 0x0f0f0f0f) << 4) | ((bits & 0xf0f0f0f0) >> 4);
	bits = ((bits & 0x33333333) << 2) | ((bits & 0xcccccccc) >> 2);
	bits = ((bits & 0x55555555) << 1) | ((bits & 0xaaaaaaaa) >> 1);
	return (PFLOAT)((double)(bits^r) * multRatio);
}

inline PFLOAT RI_S(unsigned int i, unsigned int r=0)
{
	for (unsigned int v=1<<31; i; i>>=1, v^=v>>1)
		if (i & 1) r ^= v;
	return (PFLOAT)((double) r * multRatio);
}

inline PFLOAT RI_LP(unsigned int i, unsigned int r=0)
{
	for (unsigned int v=1<<31; i; i>>=1, v|=v>>1)
		if (i & 1) r ^= v;
	return (PFLOAT)((double)r * multRatio);
}


inline int nextPrime(int lastPrime)
{
	int newPrime = lastPrime + (lastPrime & 1) + 1;
	for (;;) {
		int dv=3;  bool ispr=true;
		while ((ispr) && (dv*dv<=newPrime)) {
			ispr = ((newPrime % dv)!=0);
			dv += 2;
		}
		if (ispr) break;
		newPrime += 2;
	}
	return newPrime;
}

/* The fnv - Fowler/Noll/Vo- hash code
   unrolled for the special case of hashing 32bit unsigned integers
   very easy but fast
   more details on http://www.isthe.com/chongo/tech/comp/fnv/
*/

union Fnv32_u
{
	unsigned int in;
	unsigned char out[4];
};

#define FNV1_32_INIT 0x811c9dc5
#define FNV_32_PRIME 0x01000193

inline unsigned int fnv_32a_buf(unsigned int value)
{
	unsigned int hash = FNV1_32_INIT;
	Fnv32_u val;
	val.in = value;

	for (int i = 0; i<4; i++)
	{
		hash ^= val.out[i];
		hash *= FNV_32_PRIME;
	}

	return hash;
}

/* multiply-with-carry generator x(n) = a*x(n-1) + carry mod 2^32.
   period = (a*2^31)-1 */

/* Choose a value for a from this list
   1791398085 1929682203 1683268614 1965537969 1675393560
   1967773755 1517746329 1447497129 1655692410 1606218150
   2051013963 1075433238 1557985959 1781943330 1893513180
   1631296680 2131995753 2083801278 1873196400 1554115554
*/
#define y_a 1791398085
#define y_ah (y_a >> 16)
#define y_al (y_a & 65535)

class random_t
{
	public:
		random_t(): x(30903), c(0) {}
		random_t(unsigned int seed): x(30903), c(seed) {}
		double operator()()
		{
			unsigned int xh = x>>16, xl = x & 65535;
			x = x * y_a + c;
			c = xh*y_ah + ((xh*y_al) >> 16) + ((xl*y_ah) >> 16);
			if (xl*y_al >= ~c + 1) c++;
			return (double)x * multRatio;
		}
	protected:
		unsigned int x, c;
};

#undef y_a
#undef y_ah
#undef y_al

__END_YAFRAY

#endif	//__MCQMC_H
<commit_msg>MC_QMCUtils: claming on all the sample generation algorithms<commit_after>//---------------------------------------------------------------------
// Monte Carlo & Quasi Monte Carlo stuff
//---------------------------------------------------------------------

#ifndef __MCQMC_H
#define __MCQMC_H

__BEGIN_YAFRAY
// fast incremental Halton sequence generator
// calculation of value must be double prec.
class Halton
{
public:

	Halton()
	{
		//Empty
	}

	Halton(int base)
	{
		setBase(base);
	}

	void setBase(int base)
	{
		mBase = base;
		mInvBase = 1.0 / (double) base;
		mValue = 0;
	}

	void reset()
	{
		mValue=0.0;
	}

	inline void setStart(unsigned int i)
	{
		double factor = mInvBase;

		mValue = 0.0;

		while (i > 0)
		{
			mValue += (double) (i % mBase) * factor;
			i /= mBase;
			factor *= mInvBase;
		}
	}

	inline float getNext()
	{
		double r = 0.9999999999 - mValue;
		if (mInvBase < r)
		{
			mValue += mInvBase;
		}
		else
		{
			double hh, h = mInvBase;
			while (h >= r)
			{
				hh = h;
				h *= mInvBase;
			}

			mValue += hh + h - 1.0;
		}
		return std::max(0.f, std::min(1.f, (float)mValue));
	}

private:
	unsigned int mBase;
	double mInvBase;
	double mValue;
};


// fast base-2 van der Corput, Sobel, and Larcher & Pillichshammer sequences,
// all from "Efficient Multidimensional Sampling" by <NAME>
#define multRatio (0.00000000023283064365386962890625)
inline float RI_vdC(unsigned int bits, unsigned int r=0)
{
	bits = ( bits << 16) | ( bits >> 16);
	bits = ((bits & 0x00ff00ff) << 8) | ((bits & 0xff00ff00) >> 8);
	bits = ((bits & 0x0f0f0f0f) << 4) | ((bits & 0xf0f0f0f0) >> 4);
	bits = ((bits & 0x33333333) << 2) | ((bits & 0xcccccccc) >> 2);
	bits = ((bits & 0x55555555) << 1) | ((bits & 0xaaaaaaaa) >> 1);
	return std::max(0.f,std::min(1.f,(float)((double)(bits^r) * multRatio)));
}

inline float RI_S(unsigned int i, unsigned int r=0)
{
	for (unsigned int v=1<<31; i; i>>=1, v^=v>>1)
		if (i & 1) r ^= v;
	return std::max(0.f,std::min(1.f,((float)((double) r * multRatio))));
}

inline float RI_LP(unsigned int i, unsigned int r=0)
{
	for (unsigned int v=1<<31; i; i>>=1, v|=v>>1)
		if (i & 1) r ^= v;
	return std::max(0.f,std::min(1.f,((float)((double)r * multRatio))));
}


inline int nextPrime(int lastPrime)
{
	int newPrime = lastPrime + (lastPrime & 1) + 1;
	for (;;) {
		int dv=3;  bool ispr=true;
		while ((ispr) && (dv*dv<=newPrime)) {
			ispr = ((newPrime % dv)!=0);
			dv += 2;
		}
		if (ispr) break;
		newPrime += 2;
	}
	return newPrime;
}

/* The fnv - Fowler/Noll/Vo- hash code
   unrolled for the special case of hashing 32bit unsigned integers
   very easy but fast
   more details on http://www.isthe.com/chongo/tech/comp/fnv/
*/

union Fnv32_u
{
	unsigned int in;
	unsigned char out[4];
};

#define FNV1_32_INIT 0x811c9dc5
#define FNV_32_PRIME 0x01000193

inline unsigned int fnv_32a_buf(unsigned int value)
{
	unsigned int hash = FNV1_32_INIT;
	Fnv32_u val;
	val.in = value;

	for (int i = 0; i<4; i++)
	{
		hash ^= val.out[i];
		hash *= FNV_32_PRIME;
	}

	return hash;
}

/* multiply-with-carry generator x(n) = a*x(n-1) + carry mod 2^32.
   period = (a*2^31)-1 */

/* Choose a value for a from this list
   1791398085 1929682203 1683268614 1965537969 1675393560
   1967773755 1517746329 1447497129 1655692410 1606218150
   2051013963 1075433238 1557985959 1781943330 1893513180
   1631296680 2131995753 2083801278 1873196400 1554115554
*/
#define y_a 1791398085
#define y_ah (y_a >> 16)
#define y_al (y_a & 65535)

class random_t
{
	public:
		random_t(): x(30903), c(0) {}
		random_t(unsigned int seed): x(30903), c(seed) {}
		double operator()()
		{
			unsigned int xh = x>>16, xl = x & 65535;
			x = x * y_a + c;
			c = xh*y_ah + ((xh*y_al) >> 16) + ((xl*y_ah) >> 16);
			if (xl*y_al >= ~c + 1) c++;
			return (double)x * multRatio;
		}
	protected:
		unsigned int x, c;
};

#undef y_a
#undef y_ah
#undef y_al

__END_YAFRAY

#endif	//__MCQMC_H

{'fraction_non_alphanumeric': 0.18526233563338107, 'fraction_numerical': 0.10857961202968364, 'mean_word_length': 2.8603015075376885, 'pattern_counts': {'":': 0, '<': 39, '<?xml version=': 0, '>': 63, 'https://': 0, 'lorem ipsum': 0, 'www.': 2, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 12, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '630800', 'n_tokens_mistral': 3896, 'n_tokens_neox': 3160, 'n_words': 831}