Details.h File Reference

Implementation details for implementing graphs -*- C++ -*-. More...

#include "Galois/LargeArray.h"
#include "Galois/LazyObject.h"
#include "Galois/NoDerefIterator.h"
#include "Galois/Threads.h"
#include "Galois/Runtime/Context.h"
#include "Galois/Runtime/MethodFlags.h"
#include "Galois/Runtime/PerThreadStorage.h"
#include <boost/mpl/if.hpp>
#include <algorithm>

Go to the source code of this file.

Classes
struct	Galois::Graph::read_default_graph_tag
struct	Galois::Graph::read_with_aux_graph_tag
struct	Galois::Graph::read_lc_inout_graph_tag
struct	Galois::Graph::EdgeSortValue< GraphNode, EdgeTy >
	Proxy object for detail::EdgeSortIterator. More...
class	Galois::Graph::detail::LocalIteratorFeature< Enable >
struct	Galois::Graph::detail::LocalIteratorFeature< false >
struct	Galois::Graph::detail::EdgeSortReference< GraphNode, EdgeIndex, EdgeDst, EdgeData >
	Proxy object for EdgeSortIterator. More...
struct	Galois::Graph::detail::EdgeSortCompWrapper< EdgeSortValueTy, CompTy >
	Converts comparison functions over EdgeTy to be over EdgeSortValue. More...
class	Galois::Graph::detail::EdgeSortIterator< GraphNode, EdgeIndex, EdgeDst, EdgeData >
	Iterator to facilitate sorting of CSR-like graphs. More...
class	Galois::Graph::detail::IntrusiveId< IdTy >
class	Galois::Graph::detail::IntrusiveId< void >
class	Galois::Graph::detail::NoLockable
	Empty class for HasLockable optimization. More...
struct	Galois::Graph::detail::NodeInfoBaseTypes< NodeTy, HasLockable >
	Separate types from definitions to allow incomplete types as NodeTy. More...
struct	Galois::Graph::detail::NodeInfoBaseTypes< void, HasLockable >
class	Galois::Graph::detail::NodeInfoBase< NodeTy, HasLockable >
	Specializations for void node data. More...
struct	Galois::Graph::detail::NodeInfoBase< void, HasLockable >
class	Galois::Graph::detail::OutOfLineLockableFeature< Enable >
struct	Galois::Graph::detail::OutOfLineLockableFeature< Enable >::size_of_out_of_line
class	Galois::Graph::detail::OutOfLineLockableFeature< false >
struct	Galois::Graph::detail::OutOfLineLockableFeature< false >::size_of_out_of_line
struct	Galois::Graph::detail::EdgeInfoBase< NodeInfoPtrTy, EdgeTy >
	Edge specialization for void edge data. More...
class	Galois::Graph::detail::EdgesIterator< GraphTy >
	Convenience wrapper around Graph.edge_begin and Graph.edge_end to allow C++11 foreach iteration of edges. More...
class	Galois::Graph::detail::InEdgesIterator< GraphTy >
	Convenience wrapper around Graph.in_edge_begin and Graph.in_edge_end to allow C++11 foreach iteration of in edges. More...
class	Galois::Graph::detail::EdgesWithNoFlagIterator< GraphTy >
Namespaces
namespace	Galois
	Main Galois namespace.
namespace	Galois::Graph
	Parallel graph data structures.
namespace	Galois::Graph::detail
	Implementation details for graphs.
Functions
template<typename GN , typename EI , typename EdgeData , typename Data >
void	Galois::Graph::detail::swap (EdgeSortReference< GN, EI, EdgeData, Data > a, EdgeSortReference< GN, EI, EdgeData, Data > b)

---

Detailed Description

Implementation details for implementing graphs -*- C++ -*-.

License

Galois, a framework to exploit amorphous data-parallelism in irregular programs.

Copyright (C) 2013, The University of Texas at Austin. All rights reserved. UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS SOFTWARE AND DOCUMENTATION, INCLUDING ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR ANY PARTICULAR PURPOSE, NON-INFRINGEMENT AND WARRANTIES OF PERFORMANCE, AND ANY WARRANTY THAT MIGHT OTHERWISE ARISE FROM COURSE OF DEALING OR USAGE OF TRADE. NO WARRANTY IS EITHER EXPRESS OR IMPLIED WITH RESPECT TO THE USE OF THE SOFTWARE OR DOCUMENTATION. Under no circumstances shall University be liable for incidental, special, indirect, direct or consequential damages or loss of profits, interruption of business, or related expenses which may arise from use of Software or Documentation, including but not limited to those resulting from defects in Software and/or Documentation, or loss or inaccuracy of data of any kind.

Description

Implementation details for various graphs.

Author:

Donald Nguyen <ddn@cs.utexas.edu>