Ekdohibs
/
ocaml
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Lorsque la queue des caractere est pleine, eliminer l'entree la plus ancienne au lieu de la plus recente 

git-svn-id: http://caml.inria.fr/svn/ocaml/trunk@5269 f963ae5c-01c2-4b8c-9fe0-0dff7051ff02
master
Xavier Leroy 2002-11-17 16:29:47 +00:00
parent 14b7683557
commit 8858f731f9
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
otherlibs/graph/events.c
View File

@ -37,14 +37,12 @@ static unsigned int gr_head = 0; /* position of next read */
static unsigned int gr_tail = 0; /* position of next write */
#define QueueIsEmpty (gr_tail == gr_head)
#define QueueIsFull ((gr_tail + 1) % SIZE_QUEUE == gr_head)
static void gr_enqueue_event(int kind, int mouse_x, int mouse_y,
int button, int key)
{
struct event_data * ev;
if (QueueIsFull) return;
ev = &(gr_queue[gr_tail]);
ev->kind = kind;
ev->mouse_x = mouse_x;
@ -52,6 +50,8 @@ static void gr_enqueue_event(int kind, int mouse_x, int mouse_y,
ev->button = (button != 0);
ev->key = key;
gr_tail = (gr_tail + 1) % SIZE_QUEUE;
/* If queue was full, it now appears empty; drop oldest entry from queue. */
if (QueueIsEmpty) gr_head = (gr_head + 1) % SIZE_QUEUE;
}
#define BUTTON_STATE(state) \