#include <stdio.h>#include <stdlib.h>#include "coocurence.h"#include "tools.h"#include "queue.h"#include "global_vars.h"Klassen | |
| struct | queueCDT |
Funktionen | |
| void | QueueReset (queueADT queue) |
| queueADT | QueueCreate (void) |
| void | QueueDestroy (queueADT queue) |
| void | QueueEnter (queueADT queue, queueElementT element) |
| void | QueuePermuteWithPhrase (Entries_with_friends *actual_entry, queueADT queue, int word_no_from, int word_no_to, int num_of_elements) |
| void | QueuePermute (queueADT queue, int key, int num_of_elements) |
| void | QueueOnlyRightFriends (queueADT queue, int num_of_elements) |
| void | QueueOnlyRightFriends_Bigram (queueADT queue, int num_of_elements) |
| queueElementT | QueueDelete (queueADT queue) |
| int | QueueIsEmpty (queueADT queue) |
| int | QueueIsFull (queueADT queue) |
|
|
|
|
|
|
|
|
|
|
||||||||||||
|
|
|
|
|
|
|
|
|
||||||||||||
|
|
|
||||||||||||
|
Definition: Die Funktion QueueOnlyRightFriends bildet Wortpaare aus dem key und seinen rechten Nachbarn. Bei QueueOnlyRightFriends_Bigram werden jedoch nur unmitelbare rechte-Friends in den Hash reingetan |
|
||||||||||||||||
|
|
|
||||||||||||||||||||||||
|
|
|
|
|
1.4.6