Handle initial_capacity = 0 in mju_arrayListCreate.
Add const to ArrayList function arguments where appropriate. PiperOrigin-RevId: 559064386 Change-Id: I8763974a60a05f34dadd56e953cefa40fe78df42
This commit is contained in:
committed by
Copybara-Service
parent
1d36b57d83
commit
dae74030fe
@@ -23,6 +23,7 @@
|
|||||||
// stack allocate and initialize new mjArrayList
|
// stack allocate and initialize new mjArrayList
|
||||||
mjArrayList* mju_arrayListCreate(mjData* d, size_t element_size, size_t initial_capacity) {
|
mjArrayList* mju_arrayListCreate(mjData* d, size_t element_size, size_t initial_capacity) {
|
||||||
mjArrayList* array_list = (mjArrayList*) mj_stackAllocBytes(d, sizeof(mjArrayList));
|
mjArrayList* array_list = (mjArrayList*) mj_stackAllocBytes(d, sizeof(mjArrayList));
|
||||||
|
initial_capacity = mjMAX(1, initial_capacity);
|
||||||
array_list->d = d;
|
array_list->d = d;
|
||||||
array_list->element_size = element_size;
|
array_list->element_size = element_size;
|
||||||
array_list->capacity = initial_capacity;
|
array_list->capacity = initial_capacity;
|
||||||
@@ -37,8 +38,8 @@ mjArrayList* mju_arrayListCreate(mjData* d, size_t element_size, size_t initial_
|
|||||||
|
|
||||||
|
|
||||||
// returns total number of elements in mjArrayList
|
// returns total number of elements in mjArrayList
|
||||||
size_t mju_arrayListSize(mjArrayList* array_list) {
|
size_t mju_arrayListSize(const mjArrayList* array_list) {
|
||||||
mjArrayList* cursor = array_list;
|
const mjArrayList* cursor = array_list;
|
||||||
size_t array_list_size = 0;
|
size_t array_list_size = 0;
|
||||||
while (cursor) {
|
while (cursor) {
|
||||||
array_list_size += cursor->size;
|
array_list_size += cursor->size;
|
||||||
@@ -70,9 +71,9 @@ void mju_arrayListAdd(mjArrayList* array_list, void* element) {
|
|||||||
|
|
||||||
|
|
||||||
// returns pointer to element at index, NULL if out of bounds
|
// returns pointer to element at index, NULL if out of bounds
|
||||||
void* mju_arrayListAt(mjArrayList* array_list, size_t index) {
|
void* mju_arrayListAt(const mjArrayList* array_list, size_t index) {
|
||||||
// if the index is larger than the current capacity, then it is in a later segment
|
// if the index is larger than the current capacity, then it is in a later segment
|
||||||
mjArrayList* cursor = array_list;
|
const mjArrayList* cursor = array_list;
|
||||||
size_t total_capacity = 0;
|
size_t total_capacity = 0;
|
||||||
while (cursor != NULL && index >= total_capacity + cursor->capacity) {
|
while (cursor != NULL && index >= total_capacity + cursor->capacity) {
|
||||||
total_capacity += cursor->capacity;
|
total_capacity += cursor->capacity;
|
||||||
|
|||||||
@@ -15,6 +15,8 @@
|
|||||||
#ifndef MUJOCO_SRC_ENGINE_ENGINE_UTIL_CONTAINER_H_
|
#ifndef MUJOCO_SRC_ENGINE_ENGINE_UTIL_CONTAINER_H_
|
||||||
#define MUJOCO_SRC_ENGINE_ENGINE_UTIL_CONTAINER_H_
|
#define MUJOCO_SRC_ENGINE_ENGINE_UTIL_CONTAINER_H_
|
||||||
|
|
||||||
|
#include <stddef.h>
|
||||||
|
|
||||||
#include <mujoco/mjdata.h>
|
#include <mujoco/mjdata.h>
|
||||||
|
|
||||||
#ifdef __cplusplus
|
#ifdef __cplusplus
|
||||||
@@ -47,14 +49,14 @@ typedef struct mjArrayList_ mjArrayList;
|
|||||||
mjArrayList* mju_arrayListCreate(mjData* d, size_t element_size, size_t initial_capacity);
|
mjArrayList* mju_arrayListCreate(mjData* d, size_t element_size, size_t initial_capacity);
|
||||||
|
|
||||||
// returns total number of elements in mjArrayList
|
// returns total number of elements in mjArrayList
|
||||||
size_t mju_arrayListSize(mjArrayList* array_list);
|
size_t mju_arrayListSize(const mjArrayList* array_list);
|
||||||
|
|
||||||
// copies an element into an mjArrayList
|
// copies an element into an mjArrayList
|
||||||
void mju_arrayListAdd(mjArrayList* array_list, void* element);
|
void mju_arrayListAdd(mjArrayList* array_list, void* element);
|
||||||
|
|
||||||
// returns a pointer to the element at the specified location of the arraylist
|
// returns a pointer to the element at the specified location of the arraylist
|
||||||
// NULL returned if index is not in the mjArrayList
|
// NULL returned if index is not in the mjArrayList
|
||||||
void* mju_arrayListAt(mjArrayList* array_list, size_t index);
|
void* mju_arrayListAt(const mjArrayList* array_list, size_t index);
|
||||||
|
|
||||||
#ifdef __cplusplus
|
#ifdef __cplusplus
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -24,13 +24,12 @@
|
|||||||
namespace mujoco {
|
namespace mujoco {
|
||||||
namespace {
|
namespace {
|
||||||
|
|
||||||
TEST(TestMjArrayList, TestMjArrayListSingleThreaded) {
|
using testing::NotNull;
|
||||||
constexpr char xml[] = "<mujoco/>";
|
|
||||||
|
|
||||||
|
TEST(TestMjArrayList, TestMjArrayListSingleThreaded) {
|
||||||
std::array<char, 1024> error;
|
std::array<char, 1024> error;
|
||||||
mjModel* m = LoadModelFromString(xml, error.data(), error.size());
|
mjModel* m = LoadModelFromString("<mujoco/>", error.data(), error.size());
|
||||||
ASSERT_THAT(m, testing::NotNull()) << "Failed to load model: "
|
ASSERT_THAT(m, NotNull()) << "Failed to load model: " << error.data();
|
||||||
<< error.data();
|
|
||||||
mjData* d = mj_makeData(m);
|
mjData* d = mj_makeData(m);
|
||||||
mjMARKSTACK;
|
mjMARKSTACK;
|
||||||
mjArrayList* array_list = mju_arrayListCreate(d, sizeof(int), 10);
|
mjArrayList* array_list = mju_arrayListCreate(d, sizeof(int), 10);
|
||||||
@@ -48,8 +47,33 @@ TEST(TestMjArrayList, TestMjArrayListSingleThreaded) {
|
|||||||
EXPECT_EQ(*(int*)mju_arrayListAt(array_list, i), i);
|
EXPECT_EQ(*(int*)mju_arrayListAt(array_list, i), i);
|
||||||
}
|
}
|
||||||
|
|
||||||
EXPECT_TRUE(mju_arrayListAt(array_list, 100) == NULL);
|
EXPECT_EQ(mju_arrayListAt(array_list, 35), nullptr);
|
||||||
|
EXPECT_EQ(mju_arrayListAt(array_list, 100), nullptr);
|
||||||
|
|
||||||
|
mjFREESTACK;
|
||||||
|
mj_deleteData(d);
|
||||||
|
mj_deleteModel(m);
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST(TestMjArrayList, ZeroInitialCapacity) {
|
||||||
|
mjModel* m = LoadModelFromString("<mujoco/>", nullptr, 0);
|
||||||
|
ASSERT_THAT(m, NotNull()) << "Failed to load model";
|
||||||
|
mjData* d = mj_makeData(m);
|
||||||
|
mjMARKSTACK;
|
||||||
|
mjArrayList* array_list =
|
||||||
|
mju_arrayListCreate(d, sizeof(double), /*initial_capacity=*/0);
|
||||||
|
EXPECT_EQ(mju_arrayListSize(array_list), 0);
|
||||||
|
|
||||||
|
for (int i = 0; i < 35; ++i) {
|
||||||
|
double value = i;
|
||||||
|
mju_arrayListAdd(array_list, &value);
|
||||||
|
}
|
||||||
|
EXPECT_EQ(mju_arrayListSize(array_list), 35);
|
||||||
|
|
||||||
|
for (int i = 0; i < 35; ++i) {
|
||||||
|
EXPECT_EQ(*(double*)mju_arrayListAt(array_list, i), i);
|
||||||
|
}
|
||||||
|
EXPECT_EQ(mju_arrayListAt(array_list, 35), nullptr);
|
||||||
|
|
||||||
mjFREESTACK;
|
mjFREESTACK;
|
||||||
mj_deleteData(d);
|
mj_deleteData(d);
|
||||||
|
|||||||
Reference in New Issue
Block a user