utils.cpp

Dolfin provide a high-performance linear algebra library

// Copyright (C) 2002-2005 Anders Logg.
// Licensed under the GNU LGPL Version 2.1.
//
// First added:  2002-11-29
// Last changed: 2005-12-21

#include <ctime>
#include <dolfin/dolfin_log.h>
#include <dolfin/utils.h>

using namespace dolfin;

//-----------------------------------------------------------------------------
bool dolfin::suffix(const char *string, const char *suffix)
{
  // Step to end of string
  unsigned int i = 0;
  for (; string[i]; i++);

  // Step to end of suffix
  unsigned int j = 0;
  for (; suffix[j]; j++);

  // String can not be shorter than suffix
  if ( i < j )
    return false;
  
  // Compare
  for (unsigned int k = i-j; k < i; k++)
    if ( string[k] != suffix[k-i+j] )
      return false;
  
  return true;
}
//-----------------------------------------------------------------------------
void dolfin::remove_newline(char *string)
{
  for (unsigned int i = 0; string[i]; i++)
    if ( string[i] == '\n' ){
      string[i] = '\0';
      return;
    }
}
//-----------------------------------------------------------------------------
int dolfin::length(const char *string)
{
  int n = 0;
  for (; string[n]; n++);
  return n;
}
//-----------------------------------------------------------------------------
void dolfin::delay(real seconds)
{
  if ( seconds < 0 )
  {
    warning("Delay must be positive.");
    return;
  }
  
  struct timespec req;
  req.tv_sec  = (int) floor(seconds);
  req.tv_nsec = (int) (1000000000.0 * (seconds - floor(seconds)));
  
  nanosleep(&req, 0);
}
//-----------------------------------------------------------------------------
std::string dolfin::date()
{
  // Get current date
  time_t t = time(0);
  std::string current_date(ctime(&t));

  // Remove trailing newline
  if ( current_date[current_date.length() - 1] == '\n' )
    current_date.erase(current_date.length() - 1);
  
  return current_date;
}
//-----------------------------------------------------------------------------