liborigin 2.0.0

Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 1 2 3]

▼N Origin |
C Bitmap |
C Color |
C ColorMap |
C ColorMapLevel |
C ColorScale |
C Excel |
C Figure |
C Function |
C Graph |
C GraphAxis |
C GraphAxisBreak |
C GraphAxisFormat |
C GraphAxisTick |
C GraphCurve |
C GraphGrid |
C GraphLayer |
C GraphLayerRange |
C Line |
C LineVertex |
C Matrix |
C Note |
C PercentileProperties |
C PieProperties |
C ProjectNode |
C Rect |
C SpreadColumn |
C SpreadSheet |
▼C SurfaceProperties |
C SurfaceColoration |
C TextBox |
C TextProperties |
C VectorProperties |
C Window |
▼N std |
C iendianfstream |
C Origin600Parser |
C Origin610Parser |
C Origin700Parser |
C Origin750Parser |
C Origin800Parser |
C Origin810Parser |
C OriginDefaultParser |
C OriginFile |
C OriginParser |
▼C tree |
C breadth_first_queued_iterator | Breadth-first iterator, using a queue
C compare_nodes | Comparator class for two nodes of a tree (used for sorting and searching)
C fixed_depth_iterator | Iterator which traverses only the nodes at a given depth from the root
C iterator_base | Base class for iterators, only pointers stored, no traversal logic
C iterator_base_less | Comparator class for iterators (compares pointer values; why doesn't this work automatically?)
C leaf_iterator | Iterator which traverses only the leaves
C post_order_iterator | Depth-first iterator, first accessing the children, then the node itself
C pre_order_iterator | Depth-first iterator, first accessing the node, then its children
C sibling_iterator | Iterator which traverses only the nodes which are siblings of each other
C tree_node_ | A node in the tree, combining links to other nodes as well as the actual data