Repository navigation
Expand file tree
/
Copy pathalgorithm.h
More file actions
51 lines (42 loc) · 1.52 KB
/
Copy pathalgorithm.h
File metadata and controls
51 lines (42 loc) · 1.52 KB
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
// Copyright 2018 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef CC_ALGORITHM_H_
#define CC_ALGORITHM_H_
#include <algorithm>
#include <utility>
#include "cc/check.h"
namespace minigo {
template <typename T>
inline int ArgMax(const T& container) {
MG_CHECK(!container.empty());
return std::distance(
std::begin(container),
std::max_element(std::begin(container), std::end(container)));
}
template <typename T, typename Compare>
inline int ArgMax(const T& container, Compare cmp) {
MG_CHECK(!container.empty());
return std::distance(std::begin(container),
std::max_element(std::begin(container),
std::end(container), std::move(cmp)));
}
template <typename T, typename U>
inline int SearchSorted(const T& container, const U& value) {
MG_CHECK(!container.empty());
return std::distance(
container.begin(),
std::lower_bound(container.begin(), container.end(), value));
}
} // namespace minigo
#endif // CC_ALGORITHM_H_