Dendro  5.01
Dendro in Greek language means tree. The Dendro library is a large scale (262K cores on ORNL's Titan) distributed memory adaptive octree framework. The main goal of Dendro is to perform large scale multiphysics simulations efficeiently in mordern supercomputers. Dendro consists of efficient parallel data structures and algorithms to perform variational ( finite element) methods and finite difference mthods on 2:1 balanced arbitary adaptive octrees which enables the users to perform simulations raning from black holes (binary black hole mergers) to blood flow in human body, where applications ranging from relativity, astrophysics to biomedical engineering.
Namespaces | Functions
binUtils.h File Reference

A set of efficient functions that use binary operations to perform some small computations. More...

#include <vector>
Include dependency graph for binUtils.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces

 binOp
 A set of functions for fast binary operations.
 

Functions

bool binOp::isPowerOfTwo (unsigned int n)
 
unsigned int binOp::binLength (unsigned int num)
 
unsigned int binOp::fastLog2 (unsigned int num)
 
int binOp::toBin (unsigned int dec, unsigned int binLen, std::vector< bool > &result)
 Converts a decimal number to binary. More...
 
unsigned int binOp::binToDec (unsigned int *numBin, unsigned int binLen)
 
int binOp::getNextHighestPowerOfTwo (unsigned int n)
 
int binOp::getPrevHighestPowerOfTwo (unsigned int n)
 
template<typename T >
void binOp::setBit (T &val, unsigned int i)
 sets the i^th bit on the value val
 
template<typename T >
unsigned int binOp::getBit (T val, unsigned int i)
 gets the i^th bit on the value val
 

Detailed Description

A set of efficient functions that use binary operations to perform some small computations.

Author
Hari Sundar, hsund.nosp@m.ar@g.nosp@m.mail..nosp@m.com