Class List
Here are the classes, structs, unions and interfaces with brief descriptions:

claw | This is the main namespace
pattern | Here are the design patterns
basic_singleton | A (really) basic implementation of the singleton design pattern
bad_type_identifier | Exception thrown when an incorrect identifier is given to a type
factory | The design pattern of the factory allow to dynamically instanciate classes of various types given an identifier of this type
non_copyable | Inherit from this class to forbid construction of your class by copy
net | Network communications
basic_socket | Common interface for claw::net::basic_socketbuf and claw::net::socket_server
basic_socketbuf | Socket buffer to be used with std::basic_stream, for easy socket reading and writing
basic_isocket_stream | A class to use any socket as a classic standard input stream
basic_osocket_stream | A class to use any socket as a classic standard output stream
socket_server | Class used to receive incoming connections
basic_socket_stream | A class to use any socket as a classic standard stream
graphic | Everything about image structures and processing
bitmap | A class for bitmap images
reader | This class read data from a bitmap file and store it in an image
writer | This class write an image in a bitmap file
color_palette | A palette of colors, for palettized images
gif | A class for gif pictures
frame | One frame in the animation
reader | This class reads data from a gif file. The image is resized to the size of the screen (as defined in the gif file) and the frames are stored in a list of frames passed as parameter
image | A class to deal with images
scanline | One line in the image
base_iterator | Base class for iterators on an image
jpeg | A class for jpeg pictures
error_manager | Error handler that throw an exception instead of exiting the program
reader | This class read data from a jpeg file and store it in an image
source_manager | Source manager that allow us to read from a std::istream
writer | This class write an image in a jpeg file
options | Parameters of the writing algorithm
destination_manager | Destination manager that allow us to write in a std::ostream
pcx | A class for pcx pictures
reader | This class read data from a pcx file and store it in an image
writer | This class write an image in a pcx file
file_output_buffer | The type of the output buffer associated with the file when encoding RLE data
rgb_pixel | RGB pixel
rgba_pixel | RGBA pixel
png | A class for png pictures
reader | This class read data from a png file and store it in an image
source_manager | Source manager that allow us to read from a std::istream
writer | This class write an image in a png file
options | Parameters of the writing algorithm
target_manager | Target manager that allow us to write in a std::ostream
targa | A class for targa pictures
reader | This class read data from a targa file and store it in an image
writer | This class write an image in a targa file
file_output_buffer | The type of the output buffer associated with the file when encoding RLE data
rle_targa_encoder | RLE encoder for targa format
xbm | A class for xbm pictures
reader | This class read data from a xbm file and store it in an image
writer | This class write an image in a xbm file
options | Parameters of the writing algorithm
math | Manipulation of mathematic, geometric, etc. items
rectangle | A class representing a rectangle by his x,y coordinates, width and height
box_2d | A rectangle represented by two points in a 2D space
coordinate_2d | Coordinates in a two dimensional space
coordinate_traits | The coordinate traits provide an access to the members of the structures representing a coordinate in a 2D space
coordinate_traits< claw::math::coordinate_2d< T > > | Specialization of the coordinate_traits for claw::math::coordinate_2d
coordinate_traits< claw::math::vector_2d< T > > | Specialization of the coordinate_traits for claw::math::vector_2d
curve | Implementation of the Bézier curve
control_point | Describes a control point of the curve, with the direction of the curve before and after the point
section | A section is a part of the curve between two control points
resolved_point | The resolved point class is a point found on a section
line_2d | A straight line in a two dimensional space
ordered_set | A class to manage sets of ordered items
vector_2d | Two dimensional vector
ai | Everything about artificial intelligence
game | Everything about artificial intelligence related game algorithms
game_state | A state of a game
action_eval | A score associated with an action
min_max | Find an action with the MinMax algorithm
alpha_beta | Find an action with the alpha-beta algorithm
select_action | Select an action using a given method (min_max, alpha_beta)
select_random_action | Select a random action among the best ones
memory | Memory management
smart_ptr | A pointer with a reference counter
meta | Structures for meta-programmation
if_then_else | This structure allows to do conditional typing
if_then_else< true, ThenPart, ElsePart > | Specialization for the case where the condition evaluates to true
if_then_else< false, ThenPart, ElsePart > | Specialization for the case where the condition evaluates to false
is_base_of | This predicate tells if a class is derived from an other class
no_type | Empty type
same_type | This predicate tells if two types are the sames
same_type< T, T > |
type_list | Use this class to make a list of types
split_type_list_at | Split a type_list according to the first instance of a given type
split_type_list_at< Delimiter, no_type > | Specialisation of split_type_list_at for an empty list or the case where the delimiter is no_type
type_list_maker_1 | A type list with a single type, more readable than an imbricated type_list
type_list_maker_2 | A type list with two types, more readable than an imbricated type_list
type_list_maker_3 | A type list with three types, more readable than an imbricated type_list
type_list_maker_4 | A type list with four types, more readable than an imbricated type_list
type_list_maker_5 | A type list with five types, more readable than an imbricated type_list
type_list_maker_6 | A type list with six types, more readable than an imbricated type_list
type_list_maker_7 | A type list with seven types, more readable than an imbricated type_list
type_list_maker_8 | A type list with height types, more readable than an imbricated type_list
type_list_maker_9 | A type list with nine types, more readable than an imbricated type_list
type_list_maker_10 | A type list with ten types, more readable than an imbricated type_list
type_list_maker_11 | A type list with eleven types, more readable than an imbricated type_list
type_list_maker_12 | A type list with twelve types, more readable than an imbricated type_list
type_list_maker_13 | A type list with thirteen types, more readable than an imbricated type_list
type_list_maker_14 | A type list with fourteen types, more readable than an imbricated type_list
type_list_maker_15 | A type list with fifteen types, more readable than an imbricated type_list
type_list_maker | A type list with up to six types, more readable than an imbricated type_list, more readable than type_list_maker_1 and others
type_list_find | Check if a type is present in a type_list
type_list_find< T, no_type > |
type_list_is_a_set | This class checks if each type in a type_list<> is present only once
type_list_is_a_set< no_type > |
type_list_length | This class computes the length of a list of types
type_list_length< no_type > |
type_list_contains | Tell if a given type list contains a given type
type_list_contains< T, type_list< T, Tail > > |
type_list_contains< T, no_type > |
type_list_contains< T, type_list< Head, Tail > > |
text | Everything about text processing
kmp | Exact pattern finding with the Knuth-Morris-Pratt's algorithm
tween | Tweeners interpolate the intermediate values between two given reference values using various equations
base_tweener | Common interface for all tweeners
easing_none | Easing functions for the tweener. Those functions do nothing
symmetric_easing | Easing functions for the tweener
single_tweener | A single_tweener makes a value to evolve through time from a initial value to an end value according to a given function
tweener | A tweener makes a value to evolve through time from a initial value to an end value according to a given function
tweener_group | The tweener group manages several tweeners and remove them when they are over
tweener_sequence | The tweener sequence manages several tweeners in a common timeline
application | A class to represent the application
arguments | A class to manage the arguments of your program
arguments_table | A class to manage the arguments of your program, with automatic management of short/long arguments and help message
automaton | Basic automaton structure
avl | Binary search tree AVL implementation
avl_base | Binary search tree base AVL implementation
avl_iterator | AVL iterator
avl_const_iterator | AVL iterator
binary_node | Basic binary node
bit_istream | This class is made to help reading datas of custom bit length
bit_ostream | This class is made to help writing datas of custom bit length
buffered_istream | This class is made to help reading istreams with a buffer
buffered_ostream | This class is made to help writing in ostreams with a buffer
configuration_file | A class to get the content of a configuration file
syntax_description | This class tells us how to parse the input file
const_field_iterator | This class is an iterator on the values set for a same field name
dynamic_library | A class to use dynamic libraries
dynamic_library_traits_unix | Unix interface for using dynamic libraries
dynamic_library_traits_win32 | Microsoft Windows interface for using dynamic libraries
exception | A simple class to use as exception with string message
bad_format | Exception thrown when accessing bad formated data
first | Fuction object to get the first element of a std::pair
const_first | Fuction object to get the first element of a std::pair
pair_first | Fuction object to get the first element of a std::pair
const_pair_first | Fuction object to get the first element of a std::pair
second | Fuction object to get the second element of a std::pair
const_second | Fuction object to get the second element of a std::pair
pair_second | Fuction object to get the second element of a std::pair
const_pair_second | Fuction object to get the second element of a std::pair
unary_true | Always true unary predicate
binary_true | Always true binary predicate
unary_compose | Function object that compose two function objects
delete_function | Function object that deletes a pointer
clone | Function object that clones a pointer
dereference | Function object that dereferences a pointer
const_dereference | Function object that dereferences a constant pointer
graph_exception | The exceptions thrown by the graphs
graph | A class to represent a graph
graph_vertex_iterator | Iterator on the graph's vertices
graph_edge_iterator | Iterator on the graph's edges
edge | Value pointed by the iterator
scan_events | Different stages of graph scanning
breadth_scan | This class performs a depth scan of a graph. Only reachables vertices from a given vertex are proceeded
depth_scan | This class performs a depth scan of a graph. All nodes are proceeded
topological_sort | Pass this class as the "Envents" template parameter of the depth scan class to sort the vertices of a graph with the topological sort algorithm
it_index | A class to manage an index and an iterator easily
wrapped_iterator_by_category | Base class for wrapped iterators
wrapped_iterator_by_category< std::forward_iterator_tag, Value, Iterator, Function > | Base class for wrapped iterators, specialized for forward iterators
wrapped_iterator_by_category< std::bidirectional_iterator_tag, Value, Iterator, Function > | Base class for wrapped iterators, specialized for bidirectional iterators
wrapped_iterator_by_category< std::random_access_iterator_tag, Value, Iterator, Function > | Base class for wrapped iterators, specialized for random iterators
wrapped_iterator | This class defines an iterator resulting of the appliance of a function to an effective iterator
log_level | Set the level of the next message for logger_system::operator<<()
log_stream | Base class for streams accepting log output
console_logger | This class write log messages in std::clog
file_logger | This class write log messages in a file
log_stream_concise | A log stream that does not output a message that have been recently output
log_stream_uniq | A log stream that does not output successively the same message
log_system | A class implementing a logging system
lzw_decoder | A class to help decoding a stream encoded with Lempel-Ziv-Welch (LZW) compression algorithm
lzw_encoder | A class to help encoding a stream with Lempel-Ziv-Welch (LZW) compression algorithm
max_vector | Fill a container with some values, keeping only all the "maximum" inserted values
multi_type_map_wrapper | This class provides types and methods to allow the call of methods for a given type in the inheritance of a multi_type_map
multi_type_map_helper | This class provides types and methods to allow the call of methods recursively along the inherintance hierarchy
multi_type_map | This class can associate values of different types to a key
multi_type_map< Key, meta::no_type > | Partial specialization, to stop the inheritance recursivity
multi_type_map< Key, meta::type_list< Head, Tail > > | This class can associate values of different types to a key
iterator | This structure is used to create an iterator on the values of a given type
multi_type_map_visitor | This class goes through all entries in a multi_type_map and apply a function to them
real_number | Custom precision real numbers
make_epsilon | This class generates an epsilon value of a given precision
rle_decoder | A class to help decoding run-length encoded (RLE) streams
rle_encoder | A class to help run-length encoding (RLE) streams
socket_traits_unix | Unix interface for using sockets
socket_traits_win32 | Win32 interface for using sockets
system_info | A class to get some informations about the system in which your program runs
tree | A tree structure with any number of children
trie | This class is a trie tree
find_type_by_size | This meta class finds, in a list of types, the first type stored exactly with a given number of bits
find_type_by_size< Size, meta::no_type > | End of the recursion of the find_type_by_size class
integer_of_size | Define the type of a signed integer stored with a given number of bits. Template parameters
unsigned_integer_of_size | Define the type of an unsigned integer stored with a given number of bits. Template parameters
std |
numeric_limits< claw::real_number< T > > |
dynamic_library_traits | Common interface for platform specific methods needed for using dynamic library
socket_traits | Common interface for platform specific methods needed for using sockets