math_ops.h

Go to the documentation of this file.

#ifndef MATH_OPS_GROUP
#define MATH_OPS_GROUP
 
/*****************************************************************************\
*                                                                             *
*  Name   : mathematical operations                                           *
*  Author : Chris Koeritz                                                     *
*                                                                             *
*******************************************************************************
* Copyright (c) 2002-$now By Author.  This program is free software; you can  *
* redistribute it and/or modify it under the terms of the GNU General Public  *
* License as published by the Free Software Foundation; either version 2 of   *
* the License or (at your option) any later version.  This is online at:      *
*     http://www.fsf.org/copyleft/gpl.html                                    *
* Please send any updates to: fred@gruntose.com                               *
\*****************************************************************************/
 
#include <basis/definitions.h>
 
namespace mathematics {
 
 
class math_ops
{
public:
  typedef signed long long fat_int;
//hmmm: get this definition (or a better named one) into our definitions header.
 
  static fat_int round_it(float to_round)
  {
    fat_int to_return = fat_int(to_round);
    // this uses a simplistic view of rounding.
    if (to_round - float(to_return) > 0.5) to_return++;
    return to_return;
  }
 
  static fat_int round_it(double to_round)
  {
    fat_int to_return = fat_int(to_round);
    // this uses a simplistic view of rounding.
    if (to_round - double(to_return) > 0.5) to_return++;
    return to_return;
  }
 
/*
  static basis::u_int pow_2(const basis::u_int raise_to)
  {
    if (!raise_to) return 1;
    basis::u_int to_return = 2;
    for (basis::u_int i = 1; i < raise_to; i++)
      to_return *= 2;
    return to_return;
  }
*/
 
  static basis::un_int factorial(int n)
  { return (n < 2)? 1 : n * factorial(n - 1); }
};
 
} //namespace.
 
#endif