A Concise Introduction to Data Structures Using Java

1. Listing 5.1: Resize Circular Array (Pseudocode)
   
2. 1  j = front
   
3. 2  for i = 0 to size - 1
   
4. 3         newData[i] = data[j]
   
5. 4         j = (j + 1) % capacity
   
6. 5  Update front, rear, capacity, data

复制代码

1. Listing 5.2: Fixed-Length Queue
   
2. 1  public class FixedLengthQueue<E> extends ArrayQueue<E> {
   
3. 2         private int drops;
   
4. 3
   
5. 4         public FixedLengthQueue(int capacity) {
   
6. 5         super(capacity);
   
7. 6         }
   
8. 7
   
9. 8         @Override
   
10. 9         public void enqueue(E item) {
    
11. 10         if (size == capacity) {
    
12. 11         drops++;
    
13. 12         } else {
    
14. 13         super.enqueue(item);
    
15. 14         }
    
16. 15         }
    
17. 16
    
18. 17         public int drops() {
    
19. 18         return drops;
    
20. 19         }
    
21. 20  }

复制代码

1. Listing 5.3: Clock-Based Simulation (Pseudocode)
   
2. 1  t = 0
   
3. 2  while (t < minTime or processor is busy)
   
4. 3         if (t < minTime) randomly add new task to processor
   
5. 4         simulate one time step on processor
   
6. 5         t++

复制代码