boost/statechart
2
0
Fork 0
mirror of https://github.com/boostorg/statechart.git synced 2026-01-27 07:22:10 +00:00
Code Issues Projects Releases Wiki Activity

- Added the state type information facility to simple_state

Browse Source 
- Added the function templates simple_state::clear_shallow_history() and simple_state::clear_deep_history()


[SVN r22199]
This commit is contained in:
Andreas Huber
2004-02-09 00:32:32 +00:00
parent 20e4589e85
commit 8bfb694aa6
7 changed files with 215 additions and 48 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
example/BitMachine/BitMachine.cpp
View File

@@ -16,7 +16,7 @@ const unsigned int noOfBits = 6;
// of the complexity (e.g. in separate .cpp file) of a boost::fsm state
// machine once a certain size is reached.
// For this purpose, a state machine with exactly 2^noOfBits states (i.e.
// BitState< 0 > .. BitState< 2^noOfBits - 1 >) is generated . For the events
// BitState< 0 > .. BitState< 2^noOfBits - 1 >) is generated. For the events
// EvFlipBit< 0 > .. EvFlipBit< noOfBits - 1 > there is a transition from each
// state to the state with the corresponding bit toggled. That is, there is a
// total of 2^noOfBits * noOfBits transitions.
@@ -39,10 +39,7 @@ const unsigned int noOfBits = 6;
// MSVC 7.1 | b < 7 | 64 < s < 128 | 384 < t < 896
// GCC 3.2 * | b < 8 | 128 < s < 256 | 896 < t < 2048
//
// * These are practical rather than hard limits, caused by a compiler memory
// footprint that was substantially larger than the 1GB physical memory
// installed on the test machine. The resulting frequent swapping caused
// overly long build-times (hours rather than minutes).
// * ICE for b = 8
//////////////////////////////////////////////////////////////////////////////