Skip to content

Commit c85e02e

Browse files
committed
Adds math_utils.hpp with complex comparison functions
1 parent 79994c1 commit c85e02e

File tree

1 file changed

+103
-0
lines changed

1 file changed

+103
-0
lines changed
Lines changed: 103 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,103 @@
1+
//===------- math_utils.hpp - Implementation of math utils -------*-C++-*/===//
2+
//
3+
// Data Parallel Control (dpctl)
4+
//
5+
// Copyright 2020-2023 Intel Corporation
6+
//
7+
// Licensed under the Apache License, Version 2.0 (the "License");
8+
// you may not use this file except in compliance with the License.
9+
// You may obtain a copy of the License at
10+
//
11+
// http://www.apache.org/licenses/LICENSE-2.0
12+
//
13+
// Unless required by applicable law or agreed to in writing, software
14+
// distributed under the License is distributed on an "AS IS" BASIS,
15+
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
16+
// See the License for the specific language governing permissions and
17+
// limitations under the License.
18+
//
19+
//===----------------------------------------------------------------------===//
20+
///
21+
/// \file
22+
/// This file defines math utility functions.
23+
//===----------------------------------------------------------------------===//
24+
25+
#pragma once
26+
#include <cmath>
27+
#include <complex>
28+
29+
namespace dpctl
30+
{
31+
namespace tensor
32+
{
33+
namespace func_utils
34+
{
35+
36+
template <T>
37+
bool less_complex(const std::complex<T> &x1, const std::complex<T> &x2)
38+
{
39+
T real1 = std::real(x1);
40+
T real2 = std::real(x2);
41+
T imag1 = std::imag(x1);
42+
43+
return (real1 == real2) ? (imag1 < std::imag(x2)) : real1 < real2;
44+
}
45+
46+
template <T>
47+
bool greater_complex(const std::complex<T> &x1, const std::complex<T> &x2)
48+
{
49+
T real1 = std::real(x1);
50+
T real2 = std::real(x2);
51+
T imag1 = std::imag(x1);
52+
53+
return (real1 == real2) ? (imag1 > std::imag(x2)) : real1 > real2;
54+
}
55+
56+
template <T>
57+
bool less_equal_complex(const std::complex<T> &x1, const std::complex<T> &x2)
58+
{
59+
T real1 = std::real(x1);
60+
T real2 = std::real(x2);
61+
T imag1 = std::imag(x1);
62+
63+
return (real1 == real2) ? (imag1 <= std::imag(x2)) : real1 <= real2;
64+
}
65+
66+
template <T>
67+
bool greater_equal_complex(const std::complex<T> &x1, const std::complex<T> &x2)
68+
{
69+
T real1 = std::real(x1);
70+
T real2 = std::real(x2);
71+
T imag1 = std::imag(x1);
72+
73+
return (real1 == real2) ? (imag1 >= std::imag(x2)) : real1 >= real2;
74+
}
75+
76+
template <T>
77+
std::complex<T> max_complex(const std::complex<T> &x1,
78+
const std::complex<T> &x2)
79+
{
80+
T real1 = std::real(x1);
81+
T real2 = std::real(x2);
82+
T imag1 = std::imag(x1);
83+
84+
bool is_greater =
85+
(real1 == real2) ? (imag1 > std::imag(x2)) : real1 > real2;
86+
return (std::isnan(real1) || std::isnan(imag1) || is_greater) ? x1 : x2;
87+
}
88+
89+
template <T>
90+
std::complex<T> min_complex(const std::complex<T> &x1,
91+
const std::complex<T> &x2)
92+
{
93+
T real1 = std::real(x1);
94+
T real2 = std::real(x2);
95+
T imag1 = std::imag(x1);
96+
97+
bool is_less = (real1 == real2) ? (imag1 < std::imag(x2)) : real1 < real2;
98+
return (std::isnan(real1) || std::isnan(imag1) || is_less) ? x1 : x2;
99+
}
100+
101+
} // namespace func_utils
102+
} // namespace tensor
103+
} // namespace dpctl

0 commit comments

Comments
 (0)