Topic: The chetvergovyj registrar
Dima, the Owl, Ilya, Ivan-FHC, -128, Ehp98, Barlon, to Zjama and other forgive whom forgot.
I set a subject.
Experiments with , Numeration systems, codecs and archivers . Breadboard models. Proo-of-conept. Working
Application. Here we will run in our ideas in the form of implementation.
1) Base type . For the formal proof of our hypotheses, bits are not necessary to us.
Lines suffices us. std:: string, String, e.t.c. An example:
string s = "00101010010101010";
Any can easily do on them the Boolean
Operations also that the main thing - concatenation and a scrap. Storages suffices us. The overhead projector makes
The order of 8-16 times well and .
And bits go then. When the hypothesis flies up.
2) Visualization. . I am the big fan of a scientific drawing and visualization of ideas. Frequently
Happens that given presented by a picture carry more than valuable convergence than a heap
Clever verbal theses. Therefore black-and-white (bi-tonal) the picture gives more
Visualization for entropy and dominance of any properties in a binary file.
For those to whom laziness graphic codecs - take format PPM. It is a matrix in the text.
Or draw in the browser on . Examples - are trivial.
4) Sortsy. . As always I lift . here.
5) Indirect libraries . It is desirable that were to understand idea.
Theorists - smoke aside.