| Package | Description |
|---|---|
| net.seninp.gi.repair |
Provides a sequential and parallel RePair implementations.
|
| Modifier and Type | Method and Description |
|---|---|
RepairDigramRecord |
RepairPriorityQueue.dequeue()
Returns the most frequently seen element -- the head of the queue.
|
RepairDigramRecord |
RepairPriorityQueue.dequeue()
Returns the most frequently seen element -- the head of the queue.
|
RepairDigramRecord |
RepairPriorityQueue.get(String key)
Gets an element in the queue given its key.
|
RepairDigramRecord |
RepairPriorityQueue.get(String key)
Gets an element in the queue given its key.
|
RepairDigramRecord |
RepairPriorityQueue.peek()
Peaks onto the head element (doesn't remove it).
|
RepairDigramRecord |
RepairPriorityQueue.peek()
Peaks onto the head element (doesn't remove it).
|
RepairDigramRecord |
RepairPriorityQueue.updateDigramFrequency(String digram,
int newFreq)
Updates the priority queue according to the change...
|
RepairDigramRecord |
RepairPriorityQueue.updateDigramFrequency(String digram,
int newFreq)
Updates the priority queue according to the change...
|
| Modifier and Type | Method and Description |
|---|---|
ArrayList<RepairDigramRecord> |
RepairPriorityQueue.toList()
Needed this for debug purpose -- translates the doubly linked list into an array list.
|
ArrayList<RepairDigramRecord> |
RepairPriorityQueue.toList()
Needed this for debug purpose -- translates the doubly linked list into an array list.
|
| Modifier and Type | Method and Description |
|---|---|
int |
RepairDigramRecord.compareTo(RepairDigramRecord o)
A comparator built upon occurrence frequency only.
|
int |
RepairDigramRecord.compareTo(RepairDigramRecord o)
A comparator built upon occurrence frequency only.
|
void |
RepairPriorityQueue.enqueue(RepairDigramRecord digramRecord)
Places an element in the queue at the place based on its frequency.
|
void |
RepairPriorityQueue.enqueue(RepairDigramRecord digramRecord)
Places an element in the queue at the place based on its frequency.
|
Copyright © 2021 JMotif. All rights reserved.