File: maths.h

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm-proposed-updates
  • size: 1,998,492 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (68 lines) | stat: -rw-r--r-- 1,955 bytes parent folder | download | duplicates (8)
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//

// Implementations of well-known functions in mathematics that are useful for
// testing algorithms.

#ifndef LIBCXX_TEST_MATHS_H
#define LIBCXX_TEST_MATHS_H

#include <algorithm>
#include <cassert>
#include <concepts>
#include <ranges>
#include <vector>

template <std::ranges::forward_range R>
constexpr std::ranges::range_value_t<R> triangular_sum(R& input) {
  assert(not std::ranges::empty(input));
  auto [min, max] = std::ranges::minmax_element(input);
  return static_cast<std::ranges::range_value_t<R>>(
      (static_cast<double>(std::ranges::distance(input)) / 2) * (*min + *max));
}

template <std::integral I>
constexpr I factorial(I const n) {
  assert(n >= 0);
  auto result = I(1);
  for (auto i = I(1); i <= n; ++i) {
    result *= i;
  }

  return result;
}
static_assert(factorial(0) == 1);
static_assert(factorial(1) == 1);
static_assert(factorial(2) == 2);
static_assert(factorial(3) == 6);
static_assert(factorial(4) == 24);
static_assert(factorial(5) == 120);

template <std::integral I>
constexpr I fibonacci(I const n) {
  assert(n >= 0);

  auto result = I(0);
  auto prev   = I(1);
  for (auto i = I(0); i < n; ++i) {
    result += std::exchange(prev, result);
  }
  return result;
}
static_assert(fibonacci(0) == 0);
static_assert(fibonacci(1) == 1);
static_assert(fibonacci(2) == 1);
static_assert(fibonacci(3) == 2);
static_assert(fibonacci(4) == 3);
static_assert(fibonacci(5) == 5);
static_assert(fibonacci(6) == 8);
static_assert(fibonacci(7) == 13);
static_assert(fibonacci(8) == 21);
static_assert(fibonacci(9) == 34);

#endif // LIBCXX_TEST_MATHS_H