| 摘要 |
<p>A method for managing a queue, such as for example a FIFO queue (30), and executing a look-ahead function on the data contained in the queue (30) includes associating to the data in the queue respective state variables (C1, C2,... CK), the value of each of which represents the number of times a datum is present in the queue (30). The look-ahead function is then executed on the respective state variables, preferentially using a number of state variables (C1, C2,... CK) equal to the number of different values that may be assumed by the data in the queue (30). The look-ahead function can involve identification of the presence of a given datum in said queue (30) and is, in that case, executed by verifying whether among the state variables (C1, C2,... CK) there exists a corresponding state variable with non-nil value. It is also possible to organize the state variables in a monotonically ordered sequence in which the position of each state variable corresponds to the datum to which it is associated. The look-ahead function that involves identification of the datum in the queue having maximum value or minimum value can in this case be executed by identifying said datum as the one corresponding to the state variable of non-nil value occupying one of the end positions in said ordered sequence.</p> |
