File: to_value_list.h

package info (click to toggle)
chromium 138.0.7204.157-1
  • links: PTS, VCS
  • area: main
  • in suites: sid, trixie
  • size: 6,071,864 kB
  • sloc: cpp: 34,936,859; ansic: 7,176,967; javascript: 4,110,704; python: 1,419,953; asm: 946,768; xml: 739,967; pascal: 187,324; sh: 89,623; perl: 88,663; objc: 79,944; sql: 50,304; cs: 41,786; fortran: 24,137; makefile: 21,806; php: 13,980; tcl: 13,166; yacc: 8,925; ruby: 7,485; awk: 3,720; lisp: 3,096; lex: 1,327; ada: 727; jsp: 228; sed: 36
file content (47 lines) | stat: -rw-r--r-- 1,595 bytes parent folder | download | duplicates (3)
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
// Copyright 2024 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#ifndef BASE_CONTAINERS_TO_VALUE_LIST_H_
#define BASE_CONTAINERS_TO_VALUE_LIST_H_

#include <algorithm>
#include <concepts>
#include <functional>
#include <iterator>
#include <ranges>
#include <type_traits>
#include <utility>

#include "base/values.h"

namespace base {

namespace internal {
template <typename T>
concept AppendableToValueList =
    requires(T&& value) { Value::List().Append(std::forward<T>(value)); };
}  // namespace internal

// Maps a container to a Value::List with respect to the provided projection.
//
// Complexity: Exactly `size(range)` applications of `proj`.
template <typename Range, typename Proj = std::identity>
  requires std::ranges::sized_range<Range> && std::ranges::input_range<Range> &&
           std::indirectly_unary_invocable<Proj,
                                           std::ranges::iterator_t<Range>> &&
           internal::AppendableToValueList<
               std::indirect_result_t<Proj, std::ranges::iterator_t<Range>>>
Value::List ToValueList(Range&& range, Proj proj = {}) {
  auto container = Value::List::with_capacity(std::ranges::size(range));
  auto first = std::ranges::begin(range);
  auto last = std::ranges::end(range);
  auto f = [&]<typename T>(T&& value) { container.Append(std::forward<T>(value)); };
  for (; first != last; ++first)
    std::invoke(f, std::invoke(std::move(proj), *first));
  return container;
}

}  // namespace base

#endif  // BASE_CONTAINERS_TO_VALUE_LIST_H_