这是本文档旧的修订版！
Keywords
- 字符串匹配 Boyer-Moore algorithm
- 伪随机数:线性同余生成器 LCG(linear congruential generator) The generator is defined by the recurrence relation: Xn+1=(aXn+c) mod mXn+1=(aXn+c) mod m where XX is the sequence of pseudorandom values, and
- m,0<mm,0<m – the “modulus”
- a,0<a<ma,0<a<m – the “multiplier”
- c,0≤c<mc,0≤c<m – the “increment”
- X0,0≤X0<mX0,0≤X0<m – the “seed” or “start value”
- 伪随机数生成:xorshift+
oakfire