Classes
struct	CompareUnderlying
	Struct which defines a custom comparison object that can be used with std::sets of std::unique_ptrs. More...

struct	do_pow
	An efficient template instantiation for raising to an arbitrary integer power. More...

struct	do_pow< 0, T >

struct	do_pow< 1, T >

struct	do_pow< 6, T >

class	is_streamable
	Helper struct for enabling template metaprogramming/SFINAE. More...

class	ReverseBytes
	This Functor simply takes an object and reverses its byte representation. More...

Functions
template<typename T >
std::string	enum_to_string (const T e)

uint32_t	hashword (const uint32_t *k, size_t length, uint32_t initval=0)
	The hashword function takes an array of uint32_t's of length 'length' and computes a single key from it. More...

uint32_t	hashword (const std::vector< uint32_t > &keys, uint32_t initval=0)
	Calls function above with slightly more convenient std::vector interface. More...

uint32_t	hashword2 (const uint32_t &first, const uint32_t &second, uint32_t initval=0)
	This is a hard-coded version of hashword for hashing exactly 2 numbers. More...

uint64_t	hashword2 (const uint64_t first, const uint64_t second)
	Computes the same hash as calling fnv_64_buf() with exactly two entries. More...

uint16_t	hashword2 (const uint16_t first, const uint16_t second)

uint64_t	hashword (const uint64_t *k, size_t length)
	Call the 64-bit FNV hash function. More...

uint16_t	hashword (const uint16_t *k, size_t length)
	In a personal communication from Bob Jenkins, he recommended using "Probably final_mix() from lookup3.c... More...

template<typename Container >
Container::value_type	hashword (const Container &keys)
	Calls functions above with slightly more convenient std::vector/array compatible interface. More...

template<typename T >
T	string_to_enum (const std::string &s)

template<typename T >
T	string_to_enum (std::string_view s)

template<typename T >
T	string_to_enum (const char *s)

std::string	get_timestamp ()

void	print_timestamp (std::ostream &target=std::cout)

std::string	system_info ()

template<typename Map , typename Key , typename std::enable_if<!is_streamable< Key >::value, Key >::type * = nullptr>
Map::mapped_type &	map_find (Map &map, const Key &key, const char *filename, int line_number)
	-Wdangling-reference was nowhere near ready to add to -Wall in gcc 13. More...

template<typename Map , typename Key , typename std::enable_if<!is_streamable< Key >::value, Key >::type * = nullptr>
const Map::mapped_type &	map_find (const Map &map, const Key &key, const char *filename, int line_number)
	A version of the function above that works for const objects. More...

template<typename Vector >
Vector::reference &	vector_at (Vector &vec, typename Vector::size_type i, const char *filename, int line_number)
	A replacement for std::vector::at(i) which is meant to be used with a macro, and, unlike at(), gives a proper line number and useful error message when the index is past the end. More...

template<typename Vector >
Vector::const_reference &	vector_at (const Vector &vec, typename Vector::size_type i, const char *filename, int line_number)
	Same as above, but for const inputs. More...

template<typename ForwardIter , typename T >
void	iota (ForwardIter first, ForwardIter last, T value)
	Utility::iota was created back when std::iota was just an SGI STL extension. More...

template<class InputIterator >
bool	is_sorted (InputIterator first, InputIterator last)
	Utility::is_sorted was created back when std::is_sorted was just an SGI STL extension. More...

template<class ForwardIterator , class T >
ForwardIterator	binary_find (ForwardIterator first, ForwardIterator last, const T &value)
	The STL provides `std::binary_search()` which returns `true` or `false` depending on whether the searched-for value is found. More...

template<class ForwardIterator , class T , class Compare >
ForwardIterator	binary_find (ForwardIterator first, ForwardIterator last, const T &value, Compare comp)
	As above, but takes a custom comparison object. More...

template<int N, typename T >
T	pow (const T &x)

unsigned int	factorial (unsigned int n)
	A simple implementation of the factorial. More...

template<typename T >
T	binomial (T n, T k)

template<typename T >
void	deallocate (std::vector< T > &vec)
	A convenient method to truly empty a vector using the "swap trick". More...

std::string_view	basename_of (const std::string &fullname)

bool	contains (std::string_view superstring, std::string_view substring)
	Look for a substring within a string. More...

bool	ends_with (std::string_view superstring, std::string_view suffix)
	Look for a substring at the very end of a string. More...

std::string	complex_filename (std::string basename, unsigned int r_o_c=0)

void	prepare_complex_data (const std::vector< Complex > &source, std::vector< Real > &real_part, std::vector< Real > &imag_part)
	Prepare complex data for writing. More...

int	mkdir (const char *pathname)
	Create a directory. More...

std::string	unzip_file (std::string_view name)
	Create an unzipped copy of a bz2 or xz file, returning the name of the now-unzipped file that can be directly opened. More...

Function Documentation

◆ basename_of()

std::string_view libMesh::Utility::basename_of ( const std::string & fullname )

Definition at line 108 of file utility.C.

Referenced by libMesh::NameBasedIO::read(), libMesh::SparseMatrix< ValOut >::read(), libMesh::NameBasedIO::write(), and libMesh::NameBasedIO::write_equation_systems().

 {
   std::size_t first_char = fullname.find_last_of("/\\");
   if (first_char == std::string::npos)
     first_char = 0;
   return std::string_view(fullname).substr(first_char);
 }

◆ binary_find() [1/2]

template<class ForwardIterator , class T >

ForwardIterator libMesh::Utility::binary_find	(	ForwardIterator	first,
		ForwardIterator	last,
		const T &	value
	)

The STL provides std::binary_search() which returns true or false depending on whether the searched-for value is found.

In contrast, Utility::binary_find() uses a std::lower_bound() based search on a sorted range to find the required value.

Returns: An iterator to the searched-for element, or "last" if the element is not found.

Definition at line 265 of file utility.h.

References value.

Referenced by libMesh::UnstructuredMesh::stitching_helper(), libMesh::TetGenMeshInterface::triangulate_conformingDelaunayMesh_carvehole(), and NonManifoldGhostingFunctorTest::verify_send_list_entries_helper().

 {
   ForwardIterator it = std::lower_bound(first, last, value);
   return (it == last || value < *it) ? last : it;
 }

◆ binary_find() [2/2]

template<class ForwardIterator , class T , class Compare >

ForwardIterator libMesh::Utility::binary_find	(	ForwardIterator	first,
		ForwardIterator	last,
		const T &	value,
		Compare	comp
	)

As above, but takes a custom comparison object.

Definition at line 275 of file utility.h.

References value.

 {
   ForwardIterator it = std::lower_bound(first, last, value, comp);
   return (it == last || comp(value,*it)) ? last : it;
 }

◆ binomial()

template<typename T >

T libMesh::Utility::binomial	(	T	n,
		T	k
	)

Definition at line 354 of file utility.h.

Referenced by libMesh::FE< Dim, LAGRANGE_VEC >::shape_deriv(), and libMesh::FE< Dim, LAGRANGE_VEC >::shape_second_deriv().

 {
   T ret = 1;
 
   // Binomial function is "symmetric" in k, C(n, k) = C(n, n-k).
   if (k > n - k)
     k = n - k;
 
   // Compute n * (n-1) * ... * (n-k+1) / (k * (k-1) * ... * 1)
   for (T i = 0; i < k; ++i)
     {
       ret *= (n - i);
       ret /= (i + 1);
     }
 
   return ret;
 }

◆ complex_filename()

std::string libMesh::Utility::complex_filename	(	std::string	basename,
		unsigned int	r_o_c = `0`
	)

Returns: For r_o_c = 0 the filename for output of the real part of complex data, and for r_o_c = 1 the filename for the imaginary part.

Definition at line 119 of file utility.C.

 {
   if (r_o_c == 0)
     basename.append(".real");
 
   else
     basename.append(".imag");
 
   return basename;
 }

◆ contains()

bool libMesh::Utility::contains	(	std::string_view	superstring,
		std::string_view	substring
	)

Look for a substring within a string.

Definition at line 205 of file utility.C.

Referenced by libMesh::NameBasedIO::is_parallel_file_format(), main(), libMesh::ErrorVector::plot_error(), libMesh::NameBasedIO::read(), libMesh::TetGenIO::read(), libMesh::UCDIO::read(), libMesh::UNVIO::read(), libMesh::EquationSystems::read(), libMesh::PltLoader::read_data(), libMesh::PltLoader::read_header(), libMesh::System::read_header(), libMesh::NameBasedIO::write(), libMesh::TetGenIO::write(), libMesh::UCDIO::write(), libMesh::UNVIO::write(), libMesh::NameBasedIO::write_equation_systems(), and libMesh::NameBasedIO::write_nodal_data().

 {
   // This can just be C++23 contains() someday
   return superstring.find(substring) != std::string::npos;
 }

◆ deallocate()

template<typename T >

void libMesh::Utility::deallocate ( std::vector< T > & vec )

A convenient method to truly empty a vector using the "swap trick".

Definition at line 377 of file utility.h.

Referenced by libMesh::Nemesis_IO::read().

 {
   std::vector<T>().swap(vec);
 }

◆ ends_with()

bool libMesh::Utility::ends_with	(	std::string_view	superstring,
		std::string_view	suffix
	)

Look for a substring at the very end of a string.

Definition at line 213 of file utility.C.

Referenced by libMesh::NameBasedIO::is_parallel_file_format(), libMesh::Xdr::open(), libMesh::STLIO::open_file(), libMesh::AbaqusIO::read(), libMesh::NameBasedIO::read(), libMesh::DynaIO::read(), libMesh::UnstructuredMesh::read(), libMesh::SparseMatrix< ValOut >::read(), libMesh::SparseMatrix< ValOut >::read_matlab(), libMesh::NumericVector< Number >::read_matlab(), unzip_file(), libMesh::NameBasedIO::write(), libMesh::VTKIO::write_nodal_data(), and libMesh::NameBasedIO::write_nodal_data().

 {
   // This can just be C++20 ends_with() someday
   const auto sufsize = suffix.size();
   const auto supsize = superstring.size();
   if (sufsize > supsize)
     return false;
 
   return superstring.compare(supsize - sufsize, std::string::npos,
                              suffix) == 0;
 }

◆ enum_to_string()

template<typename T >

std::string libMesh::Utility::enum_to_string ( const T e )

Returns: the string which matches the enumeration e of type T.

◆ factorial()

unsigned int libMesh::Utility::factorial ( unsigned int n )

inline

A simple implementation of the factorial.

Definition at line 337 of file utility.h.

 {
 
   unsigned int factorial_n = 1;
 
   if (n==0)
     return factorial_n;
 
   for (unsigned int i=1; i<n; i++)
     factorial_n *= i+1;
 
   return factorial_n;
 }

◆ get_timestamp()

std::string libMesh::Utility::get_timestamp ( )

Definition at line 37 of file timestamp.C.

References libMesh::out.

Referenced by libMesh::RBConstruction::compute_Fq_representor_innerprods(), libMesh::RBConstruction::compute_output_dual_innerprods(), libMesh::PerfLog::get_info_header(), print_timestamp(), system_info(), libMesh::TransientRBConstruction::update_residual_terms(), and libMesh::RBConstruction::update_residual_terms().

 {
 #ifdef LIBMESH_HAVE_LOCALE
   // Create time_put "facet"
   std::locale loc;
   const std::time_put<char> & tp = std::use_facet <std::time_put<char>> (loc);
 
   // Call C-style time getting functions
   time_t now = time(nullptr);
   tm * tm_struct = localtime(&now);
 
   // Date will eventually be stored in this ostringstream's string
   std::ostringstream date_stream;
 
   // See below for documentation on the use of the
   // std::time_put::put() function
   tp.put(date_stream,        /*s*/
          date_stream,        /*str*/
          date_stream.fill(), /*fill*/
          tm_struct,          /*tm*/
          'c');               /*format*/
 
   // Another way to use it is to totally customize the format...
   //    char pattern[]="%d %B %Y %I:%M:%S %p";
   //    tp.put(date_stream,                /*s*/
   //   date_stream,                /*str*/
   //   date_stream.fill(),         /*fill*/
   //   tm_struct,                  /*tm*/
   //   pattern,                    /*format begin*/
   //   pattern+sizeof(pattern)-1); /*format end  */
 
   return date_stream.str();
 #else
   // C-style code originally found here:
   // http://people.sc.fsu.edu/~burkardt/cpp_src/timestamp/timestamp.C
   // Author: John Burkardt, 24 September 2003
   const unsigned int time_size = 40;
   char time_buffer[time_size];
 
   time_t now = time (nullptr);
   tm * tm_struct = localtime (&now);
 
   // No more than time_size characters will be placed into the array.  If the
   // total number of resulting characters, including the terminating
   // NUL character, is not more than time_size, strftime() returns the
   // number of characters in the array, not counting the terminating
   // NUL.  Otherwise, zero is returned and the buffer contents are
   // indeterminate.
   size_t len = strftime ( time_buffer, time_size, "%c", tm_struct );
 
   if (len != 0)
     return std::string(time_buffer);
   else
     {
       libMesh::out << "Error formatting time buffer, returning empty string!" << std::endl;
       return std::string("");
     }
 
 #endif // LIBMESH_HAVE_LOCALE
 }

◆ hashword() [1/5]

uint32_t libMesh::Utility::hashword	(	const uint32_t *	k,
		size_t	length,
		uint32_t	initval = `0`
	)

inline

The hashword function takes an array of uint32_t's of length 'length' and computes a single key from it.

Author: Bob Jenkins

Date: May 2006

Copyright: Public Domain http://burtleburtle.net/bob/hash/index.html

Definition at line 158 of file hashword.h.

Referenced by libMesh::Elem::compute_key(), libMesh::SparsityPattern::Build::handle_vi_vj(), hashword(), libMesh::Polygon::key(), libMesh::Polyhedron::key(), libMesh::Elem::key(), libMesh::Polyhedron::low_order_key(), and libMesh::MeshTools::SidesToElemMap::HashFunction::operator()().

 {
   uint32_t a,b,c;
 
   // Set up the internal state
   a = b = c = 0xdeadbeef + ((static_cast<uint32_t>(length))<<2) + initval;
 
   //------------------------------------------------- handle most of the key
   while (length > 3)
     {
       a += k[0];
       b += k[1];
       c += k[2];
       mix(a,b,c);
       length -= 3;
       k += 3;
     }
 
   //------------------------------------------- handle the last 3 uint32_t's
   switch(length)                     // all the case statements fall through
     {
     case 3 : c+=k[2];
       libmesh_fallthrough();
     case 2 : b+=k[1];
       libmesh_fallthrough();
     case 1 : a+=k[0];
       final_mix(a,b,c);
       libmesh_fallthrough();
     default:     // case 0: nothing left to add
       break;
     }
 
   //------------------------------------------------------ report the result
   return c;
 }

◆ hashword() [2/5]

uint32_t libMesh::Utility::hashword	(	const std::vector< uint32_t > &	keys,
		uint32_t	initval = `0`
	)

inline

Calls function above with slightly more convenient std::vector interface.

Definition at line 200 of file hashword.h.

References hashword().

 {
   return hashword(keys.data(), keys.size(), initval);
 }

◆ hashword() [3/5]

uint64_t libMesh::Utility::hashword	(	const uint64_t *	k,
		size_t	length
	)

inline

Call the 64-bit FNV hash function.

Definition at line 275 of file hashword.h.

 {
   return fnv_64_buf(k, 8*length);
 }

◆ hashword() [4/5]

uint16_t libMesh::Utility::hashword	(	const uint16_t *	k,
		size_t	length
	)

inline

In a personal communication from Bob Jenkins, he recommended using "Probably final_mix() from lookup3.c...

You could hash up to 6 16-bit integers that way. The output is c, or the top or bottom 16 bits of c if you only need 16 bit hash values." [JWP]

Definition at line 289 of file hashword.h.

 {
   // Three values that will be passed to final_mix() after they are initialized.
   uint32_t a = 0;
   uint32_t b = 0;
   uint32_t c = 0;
 
   switch (length)
     {
     case 3:
       {
         // Cast the inputs to 32 bit integers and call final_mix().
         a = k[0];
         b = k[1];
         c = k[2];
         break;
       }
     case 4:
       {
         // Combine the 4 16-bit inputs, "w, x, y, z" into two 32-bit
         // inputs "wx" and "yz" using bit operations and call final_mix.
         a = ((k[0]<<16) | (k[1] & 0xffff)); // wx
         b = ((k[2]<<16) | (k[3] & 0xffff)); // yz
         break;
       }
     default:
       libmesh_error_msg("Unsupported length: " << length);
     }
 
   // Result is returned in c
   final_mix(a,b,c);
   return static_cast<uint16_t>(c);
 }

◆ hashword() [5/5]

template<typename Container >

Container::value_type libMesh::Utility::hashword ( const Container & keys )

inline

Calls functions above with slightly more convenient std::vector/array compatible interface.

Definition at line 330 of file hashword.h.

References hashword().

 {
   return hashword(keys.data(), keys.size());
 }

◆ hashword2() [1/3]

uint32_t libMesh::Utility::hashword2	(	const uint32_t &	first,
		const uint32_t &	second,
		uint32_t	initval = `0`
	)

inline

This is a hard-coded version of hashword for hashing exactly 2 numbers.

Author: Bob Jenkins

Date: May 2006

Copyright: Public Domain http://burtleburtle.net/bob/hash/index.html

Definition at line 215 of file hashword.h.

Referenced by libMesh::Elem::compute_key(), and libMesh::SparsityPattern::Build::handle_vi_vj().

 {
   uint32_t a,b,c;
 
   // Set up the internal state
   a = b = c = 0xdeadbeef + 8 + initval;
 
   b+=second;
   a+=first;
   final_mix(a,b,c);
 
   return c;
 }

◆ hashword2() [2/3]

uint64_t libMesh::Utility::hashword2	(	const uint64_t	first,
		const uint64_t	second
	)

inline

Computes the same hash as calling fnv_64_buf() with exactly two entries.

This function allows the compiler to optimize by unrolling loops whose number of iterations are known at compile time. By inspecting the assembly generated for different optimization levels, we observed that the compiler sometimes chooses to unroll only the outer loop, but may also choose to unroll both the outer and inner loops.

Definition at line 238 of file hashword.h.

 {
   // Initializing hval with this value corresponds to the FNV-1 hash algorithm.
   uint64_t hval = static_cast<uint64_t>(0xcbf29ce484222325ULL);
 
   for (int i=0; i!=2; ++i)
     {
       // char pointers to (start, end) of either "first" or "second". We interpret
       // the 64 bits of each input 64-bit integer as 8 8-byte characters.
       auto beg = reinterpret_cast<const unsigned char *>(i==0 ? &first : &second);
       auto end = beg + sizeof(uint64_t)/sizeof(unsigned char); // beg+8
 
       // FNV-1 hash each octet of the buffer
       while (beg < end)
         {
           hval +=
             (hval << 1) + (hval << 4) + (hval << 5) +
             (hval << 7) + (hval << 8) + (hval << 40);
 
           // xor the bottom with the current octet
           hval ^= static_cast<uint64_t>(*beg++);
         }
     }
 
   return hval;
 }

◆ hashword2() [3/3]

uint16_t libMesh::Utility::hashword2	(	const uint16_t	first,
		const uint16_t	second
	)

inline

Definition at line 266 of file hashword.h.

 {
   return static_cast<uint16_t>(first%65449 + (second<<5)%65449);
 }

◆ iota()

template<typename ForwardIter , typename T >

void libMesh::Utility::iota	(	ForwardIter	first,
		ForwardIter	last,
		T	value
	)

Utility::iota was created back when std::iota was just an SGI STL extension.

Definition at line 229 of file utility.h.

References value.

Referenced by libMesh::PetscVector< libMesh::Number >::create_subvector(), libMesh::DTKAdapter::DTKAdapter(), libMesh::DynaIO::ElementDefinition::ElementDefinition(), libMesh::OldSolutionCoefs< Output, point_output >::eval_mixed_derivatives(), libMesh::OldSolutionValue< Output, point_output >::eval_mixed_derivatives(), libMesh::EquationSystems::find_variable_numbers(), libMesh::PetscVector< libMesh::Number >::localize(), libMesh::PointLocatorNanoflann::operator()(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectInteriors::operator()(), libMesh::System::project_vector(), libMesh::System::projection_matrix(), libMesh::NumericVector< Number >::read_matlab(), libMesh::C0Polygon::retriangulate(), libMesh::RBEIMConstruction::set_rb_construction_parameters(), SparseMatrixTest< LaspackMatrix< Number > >::setValues(), LibMeshNetgenTest::testAllPermutations(), LibMeshNetgenTest::testBadHole(), LibMeshPoly2TriTest::testLibMeshPoly2Tri(), LibMeshPoly2TriTest::testLibMeshPoly2TriHole(), LibMeshPoly2TriTest::testLibMeshPoly2TriSlivers(), and DiagonalMatrixTest::testNumerics().

 {
   // Use std::iota instead!
   libmesh_deprecated();
 
   while (first != last)
     {
       *first = value++;
       ++first;
     }
 }

◆ is_sorted()

template<class InputIterator >

bool libMesh::Utility::is_sorted	(	InputIterator	first,
		InputIterator	last
	)

Utility::is_sorted was created back when std::is_sorted was just an SGI STL extension.

Definition at line 247 of file utility.h.

 {
   libmesh_deprecated();
   return std::is_sorted(first, last);
 }

◆ map_find() [1/2]

template<typename Map , typename Key , typename std::enable_if<!is_streamable< Key >::value, Key >::type * = nullptr>

Map::mapped_type & libMesh::Utility::map_find	(	Map &	map,
		const Key &	key,
		const char *	filename,
		int	line_number
	)

inline

-Wdangling-reference was nowhere near ready to add to -Wall in gcc 13.

A version of the map_find() utility which can only be used if the map key is printable via std::stream.

It's been moved to -Wextra, but we use that too. :-)

See e.g. https://gcc.gnu.org/bugzilla/show_bug.cgi?id=109642

Our map_find functions trigger it. This function should not be called directly (although it can be), instead see the libmesh_map_find() macro.

Calls find(key), and checks the result against end(). Returns the corresponding value if found, throws an error otherwise. Templated on the type of map, so this will work with both std::map and std::unordered_map.

Definition at line 105 of file utility.h.

 {
   auto it = map.find(key);
   libmesh_error_msg_if(it == map.end(),
                        "map_find() error: key not found in file "
                        << filename << " on line " << line_number);
   return it->second;
 }

◆ map_find() [2/2]

template<typename Map , typename Key , typename std::enable_if<!is_streamable< Key >::value, Key >::type * = nullptr>

const Map::mapped_type & libMesh::Utility::map_find	(	const Map &	map,
		const Key &	key,
		const char *	filename,
		int	line_number
	)

inline

A version of the function above that works for const objects.

Definition at line 124 of file utility.h.

 {
   auto it = map.find(key);
   libmesh_error_msg_if(it == map.end(),
                        "map_find() error: key not found in file "
                        << filename << " on line " << line_number);
   return it->second;
 }

◆ mkdir()

int libMesh::Utility::mkdir ( const char * pathname )

Create a directory.

Definition at line 152 of file utility.C.

Referenced by libMesh::RBSCMEvaluation::legacy_write_offline_data_to_files(), libMesh::RBEvaluation::legacy_write_offline_data_to_files(), libMesh::RBEIMEvaluation::write_out_interior_basis_functions(), libMesh::RBEIMEvaluation::write_out_node_basis_functions(), libMesh::RBEIMEvaluation::write_out_side_basis_functions(), libMesh::RBEvaluation::write_out_vectors(), and libMesh::RBConstruction::write_riesz_representors_to_files().

                                        {
 #if defined(LIBMESH_HAVE_MKDIR)
   return ::mkdir(pathname, 0755);
 #elif LIBMESH_HAVE_DECL__MKDIR
   return _mkdir(pathname);
 #else
   libmesh_error_msg("Function mkdir not available on this system.");
 #endif
 
 }

◆ pow()

template<int N, typename T >

T libMesh::Utility::pow ( const T & x )

inline

Definition at line 328 of file utility.h.

References libMesh::Utility::do_pow< N, T >::apply().

Referenced by GETPOT_NAMESPACE::GetPot::_DBE_expand(), assemble_ellipticdg(), assemble_laplace(), compute_jacobian(), compute_residual(), compute_stresses(), LinearElasticityWithContact::compute_stresses(), libMesh::ContinuationSystem::continuation_solve(), libMesh::VariationalSmootherSystem::element_time_derivative(), exact_derivative(), exact_solution(), libMesh::RBConstructionBase< CondensedEigenSystem >::generate_training_parameters_deterministic(), libMesh::RBConstructionBase< CondensedEigenSystem >::generate_training_parameters_random(), libMesh::FESubdivision::init_shape_functions(), initial_condition(), libMesh::RBEIMConstruction::inner_product(), libMesh::InverseDistanceInterpolation< KDDim >::interpolate(), libMesh::LIBMESH_DEFAULT_VECTORIZED_FE(), std::LIBMESH_FLOAT128_BINARY(), main(), libMesh::RBEIMConstruction::node_inner_product(), libMesh::Hex::quality(), libMesh::TransientRBEvaluation::rb_solve(), libMesh::FESubdivision::regular_shape(), libMesh::FE< Dim, LAGRANGE_VEC >::shape_deriv(), libMesh::FE< Dim, LAGRANGE_VEC >::shape_second_deriv(), libMesh::RBEIMConstruction::side_inner_product(), libMesh::MeshTools::Modification::smooth(), libMesh::TwostepTimeSolver::solve(), ElemTest< elem_type >::test_n_refinements(), QuadratureTest::testJacobi(), QuadratureTest::testPolynomial(), libMesh::BoundaryInfo::transfer_boundary_ids_from_children(), and libMesh::NetGenMeshInterface::triangulate().

 {
   return do_pow<N,T>::apply(x);
 }

◆ prepare_complex_data()

void libMesh::Utility::prepare_complex_data	(	const std::vector< Complex > &	source,
		std::vector< Real > &	real_part,
		std::vector< Real > &	imag_part
	)

Prepare complex data for writing.

Definition at line 133 of file utility.C.

 {
   const unsigned int len = source.size();
 
   real_part.resize(len);
   imag_part.resize(len);
 
   for (unsigned int i=0; i<len; i++)
     {
       real_part[i] = source[i].real();
       imag_part[i] = source[i].imag();
     }
 }

◆ print_timestamp()

void libMesh::Utility::print_timestamp ( std::ostream & target = std::cout )

inline

Definition at line 37 of file timestamp.h.

References get_timestamp().

 {
   target << get_timestamp() << std::endl;
 }

◆ string_to_enum() [1/3]

template<typename T >

T libMesh::Utility::string_to_enum ( const std::string & s )

Returns: the enumeration of type T which matches the string s.

◆ string_to_enum() [2/3]

template<typename T >

T libMesh::Utility::string_to_enum ( std::string_view s )

Returns: the enumeration of type T which matches the string_view s.

◆ string_to_enum() [3/3]

template<typename T >

T libMesh::Utility::string_to_enum ( const char * s )

Returns: the enumeration of type T which matches the C-style string s.

◆ system_info()

std::string libMesh::Utility::system_info ( )

Returns: A string containing information about the system you are running on.

Definition at line 63 of file utility.C.

References get_timestamp().

 {
   std::ostringstream oss;
 
   std::string date = Utility::get_timestamp();
 
 #ifdef LIBMESH_HAVE_SYS_UTSNAME_H
   // Get system information
   struct utsname sysInfo;
   uname(&sysInfo);
 #endif
 
   // Get user information
 #ifdef LIBMESH_HAVE_GETPWUID
   struct passwd * p = getpwuid(getuid());
 #endif
 
 
   oss << '\n'
       << " ---------------------------------------------------------------------\n"
       << "| Time:           " << date             << '\n'
 #ifdef LIBMESH_HAVE_SYS_UTSNAME_H
       << "| OS:             " << sysInfo.sysname  << '\n'
       << "| HostName:       " << sysInfo.nodename << '\n'
       << "| OS Release      " << sysInfo.release  << '\n'
       << "| OS Version:     " << sysInfo.version  << '\n'
       << "| Machine:        " << sysInfo.machine  << '\n'
 #else
       << "| OS:             " << "Unknown"        << '\n'
       << "| HostName:       " << "Unknown"        << '\n'
       << "| OS Release      " << "Unknown"        << '\n'
       << "| OS Version:     " << "Unknown"        << '\n'
       << "| Machine:        " << "Unknown"        << '\n'
 #endif
 #ifdef LIBMESH_HAVE_GETPWUID
       << "| Username:       " << p->pw_name       << '\n'
 #else
       << "| Username:       " << "Unknown"        << '\n'
 #endif
       << " ---------------------------------------------------------------------\n";
 
   return oss.str();
 }

◆ unzip_file()

std::string libMesh::Utility::unzip_file ( std::string_view name )

Create an unzipped copy of a bz2 or xz file, returning the name of the now-unzipped file that can be directly opened.

This is a hack because we don't have a neat bz2/xz equivalent to gzstreams.

Definition at line 164 of file utility.C.

References ends_with(), and libMesh::Quality::name().

Referenced by libMesh::Xdr::open(), libMesh::STLIO::open_file(), libMesh::AbaqusIO::read(), libMesh::DynaIO::read(), libMesh::SparseMatrix< ValOut >::read_matlab(), and libMesh::NumericVector< Number >::read_matlab().

 {
   std::ostringstream pid_suffix;
   pid_suffix << '_' << getpid();
 
   std::string new_name { name };
   if (Utility::ends_with(name, ".bz2"))
     {
 #ifdef LIBMESH_HAVE_BZIP
       new_name.erase(new_name.end() - 4, new_name.end());
       new_name += pid_suffix.str();
       LOG_SCOPE("system(bunzip2)", "Utility");
       std::string system_string = "bunzip2 -f -k -c ";
       system_string.append(name);
       system_string += " > " + new_name;
       if (std::system(system_string.c_str()))
         libmesh_file_error(system_string);
 #else
       libmesh_error_msg("ERROR: need bzip2/bunzip2 to open .bz2 file " << name);
 #endif
     }
   else if (Utility::ends_with(name, ".xz"))
     {
 #ifdef LIBMESH_HAVE_XZ
       new_name.erase(new_name.end() - 3, new_name.end());
       new_name += pid_suffix.str();
       LOG_SCOPE("system(xz -d)", "Utility");
       std::string system_string = "xz -f -d -k -c ";
       system_string.append(name);
       system_string += " > " + new_name;
       if (std::system(system_string.c_str()))
         libmesh_file_error(system_string);
 #else
       libmesh_error_msg("ERROR: need xz to open .xz file " << name);
 #endif
     }
   return new_name;
 }

◆ vector_at() [1/2]

template<typename Vector >

Vector::reference& libMesh::Utility::vector_at	(	Vector &	vec,
		typename Vector::size_type	i,
		const char *	filename,
		int	line_number
	)

inline

A replacement for std::vector::at(i) which is meant to be used with a macro, and, unlike at(), gives a proper line number and useful error message when the index is past the end.

Definition at line 192 of file utility.h.

 {
   libmesh_error_msg_if(i >= vec.size(),
                        "vec_at() error: Index " << i <<
                        " past end of vector in file " << filename <<
                        " on line " << line_number);
   return vec[i];
 }

◆ vector_at() [2/2]

template<typename Vector >

Vector::const_reference& libMesh::Utility::vector_at	(	const Vector &	vec,
		typename Vector::size_type	i,
		const char *	filename,
		int	line_number
	)

inline

Same as above, but for const inputs.

Definition at line 210 of file utility.h.

 {
   libmesh_error_msg_if(i >= vec.size(),
                        "vec_at() error: Index " << i <<
                        " past end of vector in file " << filename <<
                        " on line " << line_number);
   return vec[i];
 }

Classes

Functions

Function Documentation

◆ basename_of()

◆ binary_find() [1/2]

◆ binary_find() [2/2]

◆ binomial()

◆ complex_filename()

◆ contains()

◆ deallocate()

◆ ends_with()

◆ enum_to_string()

◆ factorial()

◆ get_timestamp()

◆ hashword() [1/5]

◆ hashword() [2/5]

◆ hashword() [3/5]

◆ hashword() [4/5]

◆ hashword() [5/5]

◆ hashword2() [1/3]

◆ hashword2() [2/3]

◆ hashword2() [3/3]

◆ iota()

◆ is_sorted()

◆ map_find() [1/2]

◆ map_find() [2/2]

◆ mkdir()

◆ pow()

◆ prepare_complex_data()

◆ print_timestamp()

◆ string_to_enum() [1/3]

◆ string_to_enum() [2/3]

◆ string_to_enum() [3/3]

◆ system_info()

◆ unzip_file()

◆ vector_at() [1/2]

◆ vector_at() [2/2]