Skip to content

[libc++][test] Clean up code in GenerateInput.h for benchmark testing #115560

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Nov 11, 2024
Merged

[libc++][test] Clean up code in GenerateInput.h for benchmark testing #115560

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
44 changes: 20 additions & 24 deletions libcxx/test/benchmarks/GenerateInput.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -45,38 +45,37 @@ inline std::string getRandomString(std::size_t Len) {
}

template <class IntT>
inline std::vector<IntT> getDuplicateIntegerInputs(size_t N) {
inline std::vector<IntT> getDuplicateIntegerInputs(std::size_t N) {
std::vector<IntT> inputs(N, static_cast<IntT>(-1));
return inputs;
}

template <class IntT>
inline std::vector<IntT> getSortedIntegerInputs(size_t N) {
inline std::vector<IntT> getSortedIntegerInputs(std::size_t N) {
std::vector<IntT> inputs;
for (size_t i = 0; i < N; i += 1)
for (std::size_t i = 0; i < N; i += 1)
inputs.push_back(i);
return inputs;
}

template <class IntT>
std::vector<IntT> getSortedLargeIntegerInputs(size_t N) {
std::vector<IntT> getSortedLargeIntegerInputs(std::size_t N) {
std::vector<IntT> inputs;
for (size_t i = 0; i < N; ++i) {
for (std::size_t i = 0; i < N; ++i)
inputs.push_back(i + N);
}
return inputs;
}

template <class IntT>
std::vector<IntT> getSortedTopBitsIntegerInputs(size_t N) {
std::vector<IntT> getSortedTopBitsIntegerInputs(std::size_t N) {
std::vector<IntT> inputs = getSortedIntegerInputs<IntT>(N);
for (auto& E : inputs)
E <<= ((sizeof(IntT) / 2) * CHAR_BIT);
return inputs;
}

template <class IntT>
inline std::vector<IntT> getReverseSortedIntegerInputs(size_t N) {
inline std::vector<IntT> getReverseSortedIntegerInputs(std::size_t N) {
std::vector<IntT> inputs;
std::size_t i = N;
while (i > 0) {
Expand All @@ -87,61 +86,58 @@ inline std::vector<IntT> getReverseSortedIntegerInputs(size_t N) {
}

template <class IntT>
std::vector<IntT> getPipeOrganIntegerInputs(size_t N) {
std::vector<IntT> getPipeOrganIntegerInputs(std::size_t N) {
std::vector<IntT> v;
v.reserve(N);
for (size_t i = 0; i < N / 2; ++i)
for (std::size_t i = 0; i < N / 2; ++i)
v.push_back(i);
for (size_t i = N / 2; i < N; ++i)
for (std::size_t i = N / 2; i < N; ++i)
v.push_back(N - i);
return v;
}

template <class IntT>
std::vector<IntT> getRandomIntegerInputs(size_t N) {
std::vector<IntT> getRandomIntegerInputs(std::size_t N) {
std::vector<IntT> inputs;
for (size_t i = 0; i < N; ++i) {
for (std::size_t i = 0; i < N; ++i)
inputs.push_back(getRandomInteger<IntT>(0, std::numeric_limits<IntT>::max()));
}
return inputs;
}

inline std::vector<std::string> getDuplicateStringInputs(size_t N) {
inline std::vector<std::string> getDuplicateStringInputs(std::size_t N) {
std::vector<std::string> inputs(N, getRandomString(1024));
return inputs;
}

inline std::vector<std::string> getRandomStringInputs(size_t N) {
inline std::vector<std::string> getRandomStringInputs(std::size_t N) {
std::vector<std::string> inputs;
for (size_t i = 0; i < N; ++i) {
for (std::size_t i = 0; i < N; ++i)
inputs.push_back(getRandomString(1024));
}
return inputs;
}

inline std::vector<std::string> getPrefixedRandomStringInputs(size_t N) {
inline std::vector<std::string> getPrefixedRandomStringInputs(std::size_t N) {
std::vector<std::string> inputs;
constexpr int kSuffixLength = 32;
const std::string prefix = getRandomString(1024 - kSuffixLength);
for (size_t i = 0; i < N; ++i) {
for (std::size_t i = 0; i < N; ++i)
inputs.push_back(prefix + getRandomString(kSuffixLength));
}
return inputs;
}

inline std::vector<std::string> getSortedStringInputs(size_t N) {
inline std::vector<std::string> getSortedStringInputs(std::size_t N) {
std::vector<std::string> inputs = getRandomStringInputs(N);
std::sort(inputs.begin(), inputs.end());
return inputs;
}

inline std::vector<std::string> getReverseSortedStringInputs(size_t N) {
inline std::vector<std::string> getReverseSortedStringInputs(std::size_t N) {
std::vector<std::string> inputs = getSortedStringInputs(N);
std::reverse(inputs.begin(), inputs.end());
return inputs;
}

inline std::vector<const char*> getRandomCStringInputs(size_t N) {
inline std::vector<const char*> getRandomCStringInputs(std::size_t N) {
static std::vector<std::string> inputs = getRandomStringInputs(N);
std::vector<const char*> cinputs;
for (auto const& str : inputs)
Expand Down
Loading