3 #include "testing/testing.h"
17 float *array_pt = array_tar + (
size - 1);
20 *(array_pt--) = (
float)i;
37 const char *in =
"test";
52 const int items_total =
SIZE;
54 for (
int in = 0; in < items_total; in++) {
57 for (
int out_test = 0; out_test < items_total; out_test++) {
66 const int items_total =
SIZE;
68 for (
int in = 0; in < items_total; in++) {
71 for (
int out_test = items_total - 1; out_test >= 0; out_test--) {
80 const int items_total =
SIZE;
83 for (
int in = 0; in < items_total; in++) {
86 for (
int i = 0; i < items_total; i += 2) {
90 for (
int out_test = 1; out_test < items_total; out_test += 2) {
100 const int items_total =
SIZE;
102 for (
int in = 0; in < items_total; in++) {
105 for (
int out_test = 0; out_test < items_total; out_test++) {
115 float *values = (
float *)
MEM_mallocN(
sizeof(
float) * items_total, __func__);
118 for (
int i = 0; i < items_total; i++) {
121 for (
int out_test = 0; out_test < items_total; out_test++) {
144 const int items_total =
SIZE;
147 for (
int in = 0; in < items_total; in++) {
150 for (
int i = 0; i < items_total; i++) {
154 for (
int out_test = 0; out_test < items_total; out_test++) {
167 for (
int in = 0; in < items_total; in++) {
171 for (
int i = 0; i < items_total; i++) {
176 for (
int out_test = 0; out_test < items_total; out_test++) {
EXPECT_EQ(BLI_expr_pylike_eval(expr, nullptr, 0, &result), EXPR_PYLIKE_INVALID)
A min-heap / priority queue ADT.
bool BLI_heap_is_valid(const Heap *heap)
void BLI_heap_free(Heap *heap, HeapFreeFP ptrfreefp) ATTR_NONNULL(1)
void void float BLI_heap_node_value(const HeapNode *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
void void bool BLI_heap_is_empty(const Heap *heap) ATTR_NONNULL(1)
void * BLI_heap_pop_min(Heap *heap) ATTR_NONNULL(1)
unsigned int BLI_heap_len(const Heap *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
float BLI_heap_top_value(const Heap *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
void BLI_heap_node_value_update(Heap *heap, HeapNode *node, float value) ATTR_NONNULL(1
HeapNode * BLI_heap_insert(Heap *heap, float value, void *ptr) ATTR_NONNULL(1)
HeapNode * BLI_heap_top(const Heap *heap) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
Heap * BLI_heap_new(void) ATTR_WARN_UNUSED_RESULT
void void BLI_heap_remove(Heap *heap, HeapNode *node) ATTR_NONNULL(1
static void random_heap_helper(const int items_total, const int random_seed)
static void random_heap_reinsert_helper(const int items_total, const int random_seed)
static void range_fl(float *array_tar, const int size)
void BLI_array_randomize(void *data, unsigned int elem_size, unsigned int elem_num, unsigned int seed)
#define POINTER_FROM_INT(i)
#define POINTER_AS_INT(i)
Read Guarded memory(de)allocation.
static DBVT_INLINE btScalar size(const btDbvtVolume &a)
void(* MEM_freeN)(void *vmemh)
void *(* MEM_mallocN)(size_t len, const char *str)
static const pxr::TfToken out("out", pxr::TfToken::Immortal)