iframe-proxy | Sunbelt Computer Software

History

186 lines (167 loc) · 6.84 KB

Raw

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

* The MIT License (MIT)

* Permission is hereby granted, free of charge, to any person obtaining a copy

* of this software and associated documentation files (the "Software"), to deal

* in the Software without restriction, including without limitation the rights

* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell

* copies of the Software, and to permit persons to whom the Software is

* furnished to do so, subject to the following conditions:

* The above copyright notice and this permission notice shall be included in

* all copies or substantial portions of the Software.

* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR

* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,

* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE

* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER

* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,

* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN

* THE SOFTWARE.

#include <migraphx/algorithm.hpp>

#include <forward_list>

#include <list>

#include <functional>

#include <test.hpp>

// NOLINTNEXTLINE

#define MIGRAPHX_FORWARD_CONTAINER_TEST_CASE(name, type) \

template <class Container> \

static void name(); \

TEST_CASE_REGISTER(name<std::vector<type>>); \

TEST_CASE_REGISTER(name<std::list<type>>); \

TEST_CASE_REGISTER(name<std::forward_list<type>>); \

template <class Container> \

void name()

template <class Container, class Iterator>

static auto

erase_iterator(Container& c, Iterator pos, Iterator last) -> decltype(c.erase_after(pos, last))

{

auto n = std::distance(c.begin(), pos);

auto it = n == 0 ? c.before_begin() : std::next(c.begin(), n - 1);

return c.erase_after(it, last);

}

template <class Container, class Iterator>

static auto erase_iterator(Container& c, Iterator pos, Iterator last) -> decltype(c.erase(pos,

last))

{

return c.erase(pos, last);

}

MIGRAPHX_FORWARD_CONTAINER_TEST_CASE(adjacent_remove_if1, int)

{

Container v = {0, 1, 1, 1, 4, 2, 2, 4, 2};

erase_iterator(v, migraphx::adjacent_remove_if(v.begin(), v.end(), std::equal_to<>{}), v.end());

EXPECT(v == Container{0, 1, 4, 2, 4, 2});

}

MIGRAPHX_FORWARD_CONTAINER_TEST_CASE(adjacent_remove_if2, int)

{

Container v = {0, 1, 1, 1, 4, 2, 2, 4, 2, 5, 5};

erase_iterator(v, migraphx::adjacent_remove_if(v.begin(), v.end(), std::equal_to<>{}), v.end());

EXPECT(v == Container{0, 1, 4, 2, 4, 2, 5});

}

MIGRAPHX_FORWARD_CONTAINER_TEST_CASE(adjacent_remove_if3, int)

{

Container v = {0, 1, 1, 1, 4, 2, 2, 4, 2, 5, 5, 6};

erase_iterator(v, migraphx::adjacent_remove_if(v.begin(), v.end(), std::equal_to<>{}), v.end());

EXPECT(v == Container{0, 1, 4, 2, 4, 2, 5, 6});

}

MIGRAPHX_FORWARD_CONTAINER_TEST_CASE(adjacent_remove_if_non_equivalence, int)

{

Container v = {0, 1, 1, 1, 4, 2, 2, 3, 4, 2, 5, 5, 6};

auto pred = [](int a, int b) { return (b - a) == 1; };

erase_iterator(v, migraphx::adjacent_remove_if(v.begin(), v.end(), pred), v.end());

EXPECT(v == Container{1, 1, 1, 4, 2, 4, 2, 5, 6});

}

MIGRAPHX_FORWARD_CONTAINER_TEST_CASE(adjacent_transform_basic, int)

{

Container v = {1, 3, 6, 10, 15};

std::vector<int> result;

migraphx::adjacent_transform(

v.begin(), v.end(), std::back_inserter(result), [](int a, int b) { return b - a; });

EXPECT(result == std::vector<int>{2, 3, 4, 5});

}

// Unlike std::adjacent_difference the output can have a different type than the input

MIGRAPHX_FORWARD_CONTAINER_TEST_CASE(adjacent_transform_different_type, int)

{

Container v = {1, 2, 4, 4};

std::vector<bool> result;

migraphx::adjacent_transform(v.begin(), v.end(), std::back_inserter(result), std::less<>{});

EXPECT(result == std::vector<bool>{true, true, false});

}

MIGRAPHX_FORWARD_CONTAINER_TEST_CASE(adjacent_transform_single, int)

{

Container v = {1};

std::vector<int> result;

migraphx::adjacent_transform(

v.begin(), v.end(), std::back_inserter(result), [](int a, int b) { return b - a; });

EXPECT(result.empty());

}

MIGRAPHX_FORWARD_CONTAINER_TEST_CASE(adjacent_transform_empty, int)

{

Container v;

std::vector<int> result;

migraphx::adjacent_transform(

v.begin(), v.end(), std::back_inserter(result), [](int a, int b) { return b - a; });

EXPECT(result.empty());

}

MIGRAPHX_FORWARD_CONTAINER_TEST_CASE(min_element_if_basic, int)

{

Container v = {5, 3, 7, 1, 9, 2};

auto is_even = [](int x) { return x % 2 == 0; };

auto it = migraphx::min_element_if(v.begin(), v.end(), is_even, std::less<>{});

EXPECT(it != v.end());

EXPECT(*it == 2);

}

MIGRAPHX_FORWARD_CONTAINER_TEST_CASE(min_element_if_no_valid, int)

{

Container v = {5, 3, 7, 1, 9};

auto is_even = [](int x) { return x % 2 == 0; };

auto it = migraphx::min_element_if(v.begin(), v.end(), is_even, std::less<>{});

EXPECT(it == v.end());

}

MIGRAPHX_FORWARD_CONTAINER_TEST_CASE(min_element_if_all_valid, int)

{

Container v = {6, 2, 8, 4, 10};

auto is_even = [](int x) { return x % 2 == 0; };

auto it = migraphx::min_element_if(v.begin(), v.end(), is_even, std::less<>{});

EXPECT(it != v.end());

EXPECT(*it == 2);

}

MIGRAPHX_FORWARD_CONTAINER_TEST_CASE(min_element_if_custom_compare, int)

{

Container v = {5, 3, 7, 1, 9, 2, 8};

auto is_even = [](int x) { return x % 2 == 0; };

// Find the largest even number

auto it = migraphx::min_element_if(v.begin(), v.end(), is_even, std::greater<>{});

EXPECT(it != v.end());

EXPECT(*it == 8);

}

MIGRAPHX_FORWARD_CONTAINER_TEST_CASE(min_element_if_empty, int)

{

Container v;

auto is_even = [](int x) { return x % 2 == 0; };

auto it = migraphx::min_element_if(v.begin(), v.end(), is_even, std::less<>{});

EXPECT(it == v.end());

}

MIGRAPHX_FORWARD_CONTAINER_TEST_CASE(min_element_if_first_element, int)

{

Container v = {2, 5, 3, 7, 1, 9};

auto is_even = [](int x) { return x % 2 == 0; };

auto it = migraphx::min_element_if(v.begin(), v.end(), is_even, std::less<>{});

EXPECT(it != v.end());

EXPECT(*it == 2);

EXPECT(it == v.begin());

}

MIGRAPHX_FORWARD_CONTAINER_TEST_CASE(min_element_if_complex_predicate, int)

{

Container v = {15, 3, 20, 1, 9, 25, 8, 12};

// Find the smallest number greater than 10

auto greater_than_10 = [](int x) { return x > 10; };

auto it = migraphx::min_element_if(v.begin(), v.end(), greater_than_10, std::less<>{});

EXPECT(it != v.end());

EXPECT(*it == 12);

}

int main(int argc, const char* argv[]) { test::run(argc, argv); }

Sunbelt Computer Software

PL/B Language Development and Support

Navigation Menu

Uh oh!

Sunbelt Computer Software

PL/B Language Development and Support

Uh oh!

FilesExpand file tree

algorithm.cpp

Latest commit

History

algorithm.cpp

File metadata and controls