5#include "testing/testing.h"
19static void range_fl(
float *array_tar,
const int size)
21 float *array_pt = array_tar + (size - 1);
24 *(array_pt--) =
float(i);
41 const char *
in =
"test";
56 const int items_total =
SIZE;
58 for (
int in = 0;
in < items_total;
in++) {
61 for (
int out_test = 0; out_test < items_total; out_test++) {
70 const int items_total =
SIZE;
72 for (
int in = 0;
in < items_total;
in++) {
75 for (
int out_test = items_total - 1; out_test >= 0; out_test--) {
84 const int items_total =
SIZE;
87 for (
int in = 0;
in < items_total;
in++) {
90 for (
int i = 0; i < items_total; i += 2) {
94 for (
int out_test = 1; out_test < items_total; out_test += 2) {
104 const int items_total =
SIZE;
106 for (
int in = 0;
in < items_total;
in++) {
109 for (
int out_test = 0; out_test < items_total; out_test++) {
122 for (
int i = 0; i < items_total; i++) {
125 for (
int out_test = 0; out_test < items_total; out_test++) {
148 const int items_total =
SIZE;
151 for (
int in = 0;
in < items_total;
in++) {
154 for (
int i = 0; i < items_total; i++) {
158 for (
int out_test = 0; out_test < items_total; out_test++) {
171 for (
int in = 0;
in < items_total;
in++) {
175 for (
int i = 0; i < items_total; i++) {
180 for (
int out_test = 0; out_test < items_total; out_test++) {
A min-heap / priority queue ADT.
Read Blender memory allocation and freeing.
#define POINTER_FROM_INT(i)
#define POINTER_AS_INT(i)
#define EXPECT_FALSE(result)
#define EXPECT_TRUE(result)
void void bool BLI_heap_is_empty(const Heap *heap) ATTR_NONNULL(1)
unsigned int BLI_heap_len(const Heap *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
HeapNode * BLI_heap_top(const Heap *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
void * MEM_new_array_uninitialized(size_t len, size_t size, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1
void void BLI_heap_remove(Heap *heap, HeapNode *node) ATTR_NONNULL(1
void BLI_heap_free(Heap *heap, HeapFreeFP ptrfreefp) ATTR_NONNULL(1)
void * BLI_heap_pop_min(Heap *heap) ATTR_NONNULL(1)
void BLI_array_randomize(void *data, unsigned int elem_size, unsigned int elem_num, unsigned int seed)
float BLI_heap_top_value(const Heap *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
HeapNode * BLI_heap_insert(Heap *heap, float value, void *ptr) ATTR_NONNULL(1)
static void random_heap_helper(const int items_total, const int random_seed)
EXPECT_EQ(BLI_expr_pylike_eval(expr, nullptr, 0, &result), EXPR_PYLIKE_INVALID)
void BLI_heap_node_value_update(Heap *heap, HeapNode *node, float value) ATTR_NONNULL(1
static void range_fl(float *array_tar, const int size)
Heap * BLI_heap_new() ATTR_WARN_UNUSED_RESULT
bool BLI_heap_is_valid(const Heap *heap)
static void random_heap_reinsert_helper(const int items_total, const int random_seed)
void void float BLI_heap_node_value(const HeapNode *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)