blob: b3710722ab8e285fc3eb1f3279056a2999a8c195 (
plain) (
blame)
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
69
70
71
72
73
74
75
76
77
78
79
|
/*
* This source code is released into the public domain.
*/
module;
#include <cassert>
#include <compare>
#include <cstdlib>
#include <string>
#include <ucl.h>
module nihil.ucl;
namespace nihil::ucl {
real::real(ref_t, ::ucl_object_t const *uobj)
: object(nihil::ucl::ref, uobj)
{
if (type() != ucl_type)
throw type_mismatch(ucl_type, type());
}
real::real(noref_t, ::ucl_object_t *uobj)
: object(noref, uobj)
{
if (type() != ucl_type)
throw type_mismatch(ucl_type, type());
}
real::real()
: real(0)
{
}
real::real(contained_type value)
: object(noref, ::ucl_object_fromdouble(value))
{
if (_object == nullptr)
throw error("failed to create UCL object");
}
auto real::value(this real const &self) -> contained_type
{
auto v = contained_type{};
auto const *uobj = self.get_ucl_object();
if (::ucl_object_todouble_safe(uobj, &v))
return v;
std::abort();
}
auto operator== (real const &a, real const &b)
-> bool
{
return a.value() == b.value();
}
auto operator<=> (real const &a, real const &b)
-> std::partial_ordering
{
return a.value() <=> b.value();
}
auto operator== (real const &a, real::contained_type b)
-> bool
{
return a.value() == b;
}
auto operator<=> (real const &a, real::contained_type b)
-> std::partial_ordering
{
return a.value() <=> b;
}
} // namespace nihil::ucl
|
