aboutsummaryrefslogtreecommitdiffstats
path: root/libparc/parc/algol/parc_Deque.h
blob: 3e11e84513ab16ddaa1b2be49eb4fa7129a78ae8 (plain)
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
/*
 * Copyright (c) 2017 Cisco and/or its affiliates.
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at:
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

/**
 * @file parc_Deque.h
 * @ingroup datastructures
 * @brief PARC Double-ended Queue (Deque)
 *
 *
 */
#ifndef libparc_parc_Deque_h
#define libparc_parc_Deque_h
#include <stdbool.h>
#include <stdint.h>

#include <parc/algol/parc_List.h>
#include <parc/algol/parc_Object.h>
#include <parc/algol/parc_Iterator.h>

struct parc_deque;
/**
 * A double-ended queue.
 *
 * @see {@link parcDeque_Create}
 * @see {@link parcDeque_CreateCustom}
 */
typedef struct parc_deque PARCDeque;

/**
 * Create a `PARCDeque` instance with the default element equality and copy functions.
 *
 * The queue is created with no elements.
 *
 * The default element equals function is used by the `{@link parcDeque_Equals} function and
 * simply compares the values using the `==` operator.
 * Users that need more sophisticated comparisons of the elements need to supply their own
 * function via the {@link parcDeque_CreateCustom} function.
 *
 * @return non-NULL A pointer to a `PARCDeque` instance.
 *
 * Example:
 * @code
 * <#example#>
 * @endcode
 *
 */
PARCDeque *parcDeque_Create(void);

PARCIterator *parcDeque_Iterator(PARCDeque *deque);

/**
 * Create a PARCDeque instance that uses the {@link PARCObjectDescriptor} providing functions for element equality and copy function.
 *
 * The queue is created with no elements.
 *
 * @param [in] interface A pointer to a `PARCObjectDescriptor` instance.
 *
 * @return non-NULL A pointer to a `PARCDeque` instance.
 *
 * Example:
 * @code
 * <#example#>
 * @endcode
 */
PARCDeque *parcDeque_CreateObjectInterface(const PARCObjectDescriptor *interface);

/**
 * Create a `PARCDeque` instance with a custom element equality and copy function.
 *
 * The queue is created with no elements.
 *
 * The supplied element equals function is used by the `parcDeque_Equals`
 * function which must return `true` if the elements are equal, and `false` if unequal.
 *
 * @param [in] elementEquals The function to be used for equals
 * @param [in] elementCopy The function to be used for copy
 *
 * @return non-NULL A pointer to a `PARCDeque` instance.
 *
 * Example:
 * @code
 * <#example#>
 * @endcode
 *
 * @see {@link parcDeque_CreateObjectInterface}
 */
PARCDeque *parcDeque_CreateCustom(bool (*elementEquals)(const void *, const void *), void *(*elementCopy)(const void *));

/**
 * Acquire a new reference to an instance of `PARCDeque`.
 *
 * The reference count to the instance is incremented.
 *
 * @param [in] deque The instance of `PARCDeque` to which to refer.
 *
 * @return The same value as the input parameter @p deque
 *
 * Example:
 * @code
 * <#example#>
 * @endcode
 */
PARCDeque *parcDeque_Acquire(const PARCDeque *deque);

/**
 * Release a previously acquired reference to the specified instance,
 * decrementing the reference count for the instance.
 *
 * The pointer to the instance is set to NULL as a side-effect of this function.
 *
 * If the invocation causes the last reference to the instance to be released,
 * the instance is deallocated and the instance's interface will perform
 * additional cleanup and release other privately held references.
 *
 * @param [in,out] dequePtr A pointer to a pointer to the instance of `PARCDeque` to release.
 *
 *
 * Example:
 * @code
 * {
 *     PARCDeque *buffer = parcDeque_Create(10);
 *
 *     parcDeque_Release(&buffer);
 * }
 * @endcode
 */
void parcDeque_Release(PARCDeque **dequePtr);

/**
 * Copy a a `PARCDeque` to another.
 *
 * @param [in] deque A pointer to an instance of `PARCDeque`
 *
 * @return A pointer to a copy of the original instance of `PARCDeque`
 *
 * Example:
 * @code
 * {
 *     <#example#>
 * }
 * @endcode
 */
PARCDeque *parcDeque_Copy(const PARCDeque *deque);

/**
 * Append an element to the tail end of the specified `PARCDeque`
 *
 * @param [in,out] deque A pointer to the instance of `PARCDeque` to which the element will be appended
 * @param [in] element A pointer to the element to be appended to the instance of `PARCDeque`
 *
 * @return  non NULL A pointer to the specific instance of `PARCDeque`
 *
 * Example:
 * @code
 * <#example#>
 * @endcode
 */
PARCDeque *parcDeque_Append(PARCDeque *deque, void *element);

/**
 * Prepend an element to the head end of the specified `PARCDeque`
 *
 *
 * @param [in,out] deque A pointer to the instance of `PARCDeque` to which the element will be prepended
 * @param [in] element A pointer to the element to be appended to the instance of `PARCDeque`
 *
 * @return  non NULL A pointer to the specific instance of `PARCDeque`
 *
 *
 * Example:
 * @code
 * <#example#>
 * @endcode
 */
PARCDeque *parcDeque_Prepend(PARCDeque *deque, void *element);

/**
 * Return the first element of the specified `PARCDeque` and remove it from the queue
 *
 * @param [in,out] deque A pointer to the instance of `PARCDeque` from which the first element will be returned and removed
 *
 * @return  non NULL A pointer to the element removed
 *
 * Example:
 * @code
 * <#example#>
 * @endcode
 *
 */
void *parcDeque_RemoveFirst(PARCDeque *deque);

/**
 * Return the last element of the specified `PARCDeque` and remove it from the queue
 *
 * @param [in,out] deque A pointer to the instance of `PARCDeque` from which the last element will be returned and removed
 *
 * @return  non NULL A pointer to the element removed
 *
 * Example:
 * @code
 * <#example#>
 * @endcode
 *
 */
void *parcDeque_RemoveLast(PARCDeque *deque);

/**
 * Return the first element of the specified `PARCDeque` but do NOT remove it from the queue
 *
 * @param [in] deque A pointer to the instance of `PARCDeque` from which the first element will be returned
 *
 * @return  non NULL A pointer to the first element
 *
 * Example:
 * @code
 * <#example#>
 * @endcode
 *
 */
void *parcDeque_PeekFirst(const PARCDeque *deque);

/**
 * Return the last element of the specified `PARCDeque` but do NOT remove it from the queue
 *
 * @param [in] deque A pointer to the instance of `PARCDeque` from which the last element will be returned
 *
 * @return  non NULL A pointer to the last element
 *
 * Example:
 * @code
 * <#example#>
 * @endcode
 *
 */
void *parcDeque_PeekLast(const PARCDeque *deque);

/**
 * Return the size of the specified queue
 *
 * @param [in] deque A pointer to the instance of `PARCDeque`
 *
 * @return `size_t` The size of the queue
 *
 * Example:
 * @code
 * <#example#>
 * @endcode
 *
 */
size_t parcDeque_Size(const PARCDeque *deque);

/**
 * Return True if the `PARCDeque` is empty or False if not.
 *
 * @param [in] deque A pointer to the instance of `PARCDeque`
 *
 * @return bool True if the `PARCDeque` is empty or False if not.
 *
 * Example:
 * @code
 * <#example#>
 * @endcode
 *
 */
bool parcDeque_IsEmpty(const PARCDeque *deque);

/**
 * Get a pointer to the specified element.
 *
 * @param [in] deque A pointer to a `PARCDeque` instance.
 * @param [in] index The index of the element to be retrieved.
 *
 * @throws `trapOutOfBounds`
 *
 * Example:
 * @code
 * <#example#>
 * @endcode
 *
 */
void *parcDeque_GetAtIndex(const PARCDeque *deque, size_t index);

/**
 * Determine if two `PARCDeque` instances are equal.
 *
 * This function implements the following equivalence relations on non-null `PARCDeque` instances:
 *
 *   * It is reflexive: for any non-null reference value x, `parcDeque_Equals(x, x)` must return true.
 *
 *   * It is symmetric: for any non-null reference values x and y, `parcDeque_Equals(x, y)` must return true if and only if
 *        `parcDeque_Equals(y x)` returns true.
 *
 *   * It is transitive: for any non-null reference values x, y, and z, if
 *        `parcDeque_Equals(x, y)` returns true and
 *        `parcDeque_Equals(y, z)` returns true,
 *        then `parcDeque_Equals(x, z)` must return true.
 *
 *   * It is consistent: for any non-null reference values x and y, multiple invocations of `parcDeque_Equals(x, y)`
 *         consistently return true or consistently return false.
 *
 *   * For any non-null reference value x, `parcDeque_Equals(x, NULL)` must return false.
 *
 * Two `PARCDeque` instances with different element equality functions are always unequal.
 *
 * @param [in] x A pointer to a `PARCDeque` instance.
 * @param [in] y A pointer to a `PARCDeque` instance.
 *
 * @return true `PARCDeque` x and y are equal.
 * @return false `PARCDeque` x and y are not equal.
 *
 * Example:
 * @code
 * <#example#>
 * @endcode
 */
bool parcDeque_Equals(const PARCDeque *x, const PARCDeque *y);

/**
 * Print a human readable representation of the given `PARCDeque`.
 *
 * @param [in] indentation The level of indentation to use to pretty-print the output.
 * @param [in] deque A pointer to the instance to display.
 *
 * Example:
 * @code
 * {
 *     PARCDeque *instance = parcDeque_Create();
 *
 *     parcDeque_Display(instance, 0);
 *
 *     parcDeque_Release(&instance);
 * }
 * @endcode
 *
 */
void parcDeque_Display(const PARCDeque *deque, int indentation);

/**
 * Wakes up a single thread that is waiting on this object (see `parcDeque_Wait)`.
 * If any threads are waiting on this object, one of them is chosen to be awakened.
 * The choice is arbitrary and occurs at the discretion of the underlying implementation.
 *
 * The awakened thread will not be able to proceed until the current thread relinquishes the lock on this object.
 * The awakened thread will compete in the usual manner with any other threads that might be actively
 * competing to synchronize on this object;
 * for example, the awakened thread enjoys no reliable privilege or disadvantage in being the next thread to lock this object.
 *
 * @param [in] object A pointer to a valid PARCDeque instance.
 *
 * Example:
 * @code
 * {
 *
 *     parcDeque_Notify(object);
 * }
 * @endcode
 */
parcObject_ImplementNotify(parcDeque, PARCDeque);

/**
 * Causes the calling thread to wait until either another thread invokes the parcDeque_Notify() function on the same object.
 *  *
 * @param [in] object A pointer to a valid `PARCDeque` instance.
 *
 * Example:
 * @code
 * {
 *
 *     parcDeque_Wait(object);
 * }
 * @endcode
 */
parcObject_ImplementWait(parcDeque, PARCDeque);

/**
 * Obtain the lock on the given `PARCDeque` instance.
 *
 * If the lock is already held by another thread, this function will block.
 * If the lock is aleady held by the current thread, this function will return `false`.
 *
 * Implementors must avoid deadlock by attempting to lock the object a second time within the same calling thread.
 *
 * @param [in] object A pointer to a valid `PARCDeque` instance.
 *
 * @return true The lock was obtained successfully.
 * @return false The lock is already held by the current thread, or the `PARCDeque` is invalid.
 *
 * Example:
 * @code
 * {
 *     if (parcDeque_Lock(object)) {
 *
 *     }
 * }
 * @endcode
 */
parcObject_ImplementLock(parcDeque, PARCDeque);

/**
 * Try to obtain the advisory lock on the given PARCDeque instance.
 *
 * Once the lock is obtained, the caller must release the lock as soon as possible.
 *
 * @param [in] object A pointer to a valid PARCDeque instance.
 *
 * @return true The PARCDeque is locked.
 * @return false The PARCDeque is unlocked.
 *
 * Example:
 * @code
 * {
 *     parcDeque_TryLock(object);
 * }
 * @endcode
 */
parcObject_ImplementTryLock(parcDeque, PARCDeque);

/**
 * Try to unlock the advisory lock on the given `PARCDeque` instance.
 *
 * @param [in] object A pointer to a valid `PARCDeque` instance.
 *
 * @return true The `PARCDeque` was locked and now is unlocked.
 * @return false The `PARCDeque` was not locked and remains unlocked.
 *
 * Example:
 * @code
 * {
 *     parcDeque_Unlock(object);
 * }
 * @endcode
 */
parcObject_ImplementUnlock(parcDeque, PARCDeque);

/**
 * Determine if the advisory lock on the given `PARCDeque` instance is locked.
 *
 * @param [in] object A pointer to a valid `PARCDeque` instance.
 *
 * @return true The `PARCDeque` is locked.
 * @return false The `PARCDeque` is unlocked.
 * Example:
 * @code
 * {
 *     if (parcDeque_IsLocked(object)) {
 *         ...
 *     }
 * }
 * @endcode
 */
parcObject_ImplementIsLocked(parcDeque, PARCDeque);

#endif // libparc_parc_Deque_h