<commit_before>///////////////////////////////////////////////////////////////////////////////////////////////////
// OpenGL Mathematics Copyright (c) 2005 - 2011 G-Truc Creation (www.g-truc.net)
///////////////////////////////////////////////////////////////////////////////////////////////////
// Created : 2005-12-24
// Updated : 2006-12-06
// Licence : This source is under MIT License
// File    : glm/gtx/integer.inl
///////////////////////////////////////////////////////////////////////////////////////////////////

namespace glm{
namespace gtx{
namespace integer
{
    // pow
    GLM_FUNC_QUALIFIER int pow(int x, int y)
    {
		if(y == 0)
			return 1;
        int result = x;
        for(int i = 1; i < y; ++i)
            result *= x;
        return result;
    }

    // sqrt: From <NAME>, An integer square root, Graphics Gems, 1990, page 387
    GLM_FUNC_QUALIFIER int sqrt(int x)
    {
        if(x <= 1) return x;

        int NextTrial = x >> 1;
        int CurrentAnswer;

        do
        {
            CurrentAnswer = NextTrial;
            NextTrial = (NextTrial + x / NextTrial) >> 1;
        } while(NextTrial < CurrentAnswer);

        return CurrentAnswer;
    }

    // mod
	GLM_FUNC_QUALIFIER int mod(int x, int y)
	{
		return x - y * (x / y);
	}

    // factorial (!12 max, integer only)
	template <typename genType>
    GLM_FUNC_QUALIFIER genType factorial(genType const & x)
    {
        genType Result;
        for(Result = 1; x > 1; --x)
            Result *= x;
        return Result;
    }

	template <typename valType>
    GLM_FUNC_QUALIFIER detail::tvec2<valType> factorial(
		detail::tvec2<valType> const & x)
    {
        return detail::tvec2<valType>(<commit_msg>Fixed factorial implementation<commit_after>///////////////////////////////////////////////////////////////////////////////////////////////////
// OpenGL Mathematics Copyright (c) 2005 - 2011 G-Truc Creation (www.g-truc.net)
///////////////////////////////////////////////////////////////////////////////////////////////////
// Created : 2005-12-24
// Updated : 2006-12-06
// Licence : This source is under MIT License
// File    : glm/gtx/integer.inl
///////////////////////////////////////////////////////////////////////////////////////////////////

namespace glm{
namespace gtx{
namespace integer
{
    // pow
    GLM_FUNC_QUALIFIER int pow(int x, int y)
    {
		if(y == 0)
			return 1;
        int result = x;
        for(int i = 1; i < y; ++i)
            result *= x;
        return result;
    }

    // sqrt: From <NAME>, An integer square root, Graphics Gems, 1990, page 387
    GLM_FUNC_QUALIFIER int sqrt(int x)
    {
        if(x <= 1) return x;

        int NextTrial = x >> 1;
        int CurrentAnswer;

        do
        {
            CurrentAnswer = NextTrial;
            NextTrial = (NextTrial + x / NextTrial) >> 1;
        } while(NextTrial < CurrentAnswer);

        return CurrentAnswer;
    }

    // mod
	GLM_FUNC_QUALIFIER int mod(int x, int y)
	{
		return x - y * (x / y);
	}

    // factorial (!12 max, integer only)
	template <typename genType>
    GLM_FUNC_QUALIFIER genType factorial(genType const & x)
    {
		genType Temp = x;
        genType Result;
        for(Result = 1; Temp > 1; --Temp)
            Result *= Temp;
        return Result;
    }

	template <typename valType>
    GLM_FUNC_QUALIFIER detail::tvec2<valType> factorial(
		detail::tvec2<valType> const & x)
    {
        return detail::tvec2<valType>(
{'fraction_non_alphanumeric': 0.264893001735107, 'fraction_numerical': 0.025448235974551765, 'mean_word_length': 1.2504879635653872, 'pattern_counts': {'":': 0, '<': 21, '<?xml version=': 0, '>': 25, 'https://': 0, 'lorem ipsum': 0, 'www.': 2, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, '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': '6771809', 'n_tokens_mistral': 1099, 'n_tokens_neox': 963, 'n_words': 280}