File: PriorityQueueBenchmarks.h

package info (click to toggle)
swiftlang 6.0.3-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 2,519,992 kB
  • sloc: cpp: 9,107,863; ansic: 2,040,022; asm: 1,135,751; python: 296,500; objc: 82,456; f90: 60,502; lisp: 34,951; pascal: 19,946; sh: 18,133; perl: 7,482; ml: 4,937; javascript: 4,117; makefile: 3,840; awk: 3,535; xml: 914; fortran: 619; cs: 573; ruby: 573
file content (47 lines) | stat: -rw-r--r-- 1,605 bytes parent folder | download
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
//===----------------------------------------------------------------------===//
//
// This source file is part of the Swift Collections open source project
//
// Copyright (c) 2021 - 2024 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
//
//===----------------------------------------------------------------------===//

#ifndef CPPBENCHMARKS_PRIORITY_QUEUE_BENCHMARKS_H
#define CPPBENCHMARKS_PRIORITY_QUEUE_BENCHMARKS_H

#include <stdint.h>
#include <stddef.h>
#include <stdbool.h>

#ifdef __cplusplus
extern "C" {
#endif

/// Create a `std::priority_queue<intptr_t>`, populating it with data from the
/// supplied buffer. Returns an opaque pointer to the created instance.
extern void *cpp_priority_queue_create(const intptr_t *start, size_t count);

/// Destroys a priority queue previously returned by `cpp_priority_queue_create`.
extern void cpp_priority_queue_destroy(void *ptr);

/// Push a value to a priority queue.
extern void cpp_priority_queue_push(void *ptr, intptr_t value);

/// Loop through the supplied buffer, pushing each value to the queue.
extern void cpp_priority_queue_push_loop(void *ptr, const intptr_t *start, size_t count);

/// Remove and return the top value off of a priority queue.
extern intptr_t cpp_priority_queue_pop(void *ptr);

/// Remove and discard all values in a priority queue one by one in a loop.
extern void cpp_priority_queue_pop_all(void *ptr);

#ifdef __cplusplus
}
#endif


#endif /* CPPBENCHMARKS_PRIORITY_QUEUE_BENCHMARKS_H */