1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
/*
Copyright (C) 2001 Maciej Stachowiak
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2 of the
License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public
License along with this program; if not, see <http://www.gnu.org/licenses/>.
Author: Maciej Stachowiak <mjs@noisehavoc.org>
*/
#pragma once
#include "nautilus-types.h"
#include <glib.h>
/** Function to create a hashable key from an item. */
typedef gpointer (* KeyCreateFunc) (gpointer item);
typedef struct NautilusHashQueue NautilusHashQueue;
NautilusHashQueue * nautilus_hash_queue_new (GHashFunc hash_func,
GEqualFunc equal_func,
GDestroyNotify key_destroy_func,
GDestroyNotify value_destroy_func);
void nautilus_hash_queue_destroy (NautilusHashQueue *queue);
gboolean nautilus_hash_queue_enqueue (NautilusHashQueue *queue,
gpointer key,
gpointer value);
gboolean nautilus_hash_queue_reenqueue (NautilusHashQueue *queue,
gpointer key,
gpointer value);
void nautilus_hash_queue_remove (NautilusHashQueue *queue,
gconstpointer key);
gpointer nautilus_hash_queue_find_item (NautilusHashQueue *queue,
gconstpointer key);
void nautilus_hash_queue_move_existing_to_head (NautilusHashQueue *queue,
gconstpointer key);
void nautilus_hash_queue_move_existing_to_tail (NautilusHashQueue *queue,
gconstpointer key);
void nautilus_hash_queue_remove_head (NautilusHashQueue *queue);
/* Get the file at the head of the queue without removing or unrefing it. */
#define nautilus_hash_queue_peek_head(queue) (g_queue_peek_head ((GQueue *) (queue)))
#define nautilus_hash_queue_is_empty(queue) (g_queue_is_empty ((GQueue *) (queue)))
#define nautilus_hash_queue_get_length(queue) (g_queue_get_length ((GQueue *) (queue)))
|