Make a histogram of number pairs received
anal takes number pairs and reports how many times they've been received. The output list is designed to serve as input to the prob object, to create a probability matrix of transitions from one number to another (known as a first-order Markov chain).
|| Sets a maximum limit for the values that can be input into anal. Input values are clipped between zero and this value. The default value, when no argument is present, is 128. By supplying an argument, you can change the maximum input value that anal will accept, up to a maximum of 16384. The number of different transition probabilities that anal can keep track of is the square of this maximum input value. A maximum input value of 128 represents a table consisting of 16,384 different pairs; when the maximum limit is set to the maximum input value possible of 16384, anal can keep track of a whopping 268,435,456 unique numerical pairs!
|| Reports how many times this number and the previously received number have occurred in immediate succession. (The first time a number is received, there has been no previous number, so nothing happens.)
|| Erases the memory of the anal object entirely, but retains the most recently received number to use as the next "previous" value.
|| Erases the most recently received number from the memory of the anal object. The next number to be received gets stored in its place, to serve as the next "previous" value (but nothing else happens).
Keep track of number pairs and their relative frequency of occurrence pass the information to prob to generate similar transitions
Make a histogram of the numbers received
Make a weighted random series of numbers