File: browser_app_instance_map.h

package info (click to toggle)
chromium 138.0.7204.183-1~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm-proposed-updates
  • size: 6,080,960 kB
  • sloc: cpp: 34,937,079; ansic: 7,176,967; javascript: 4,110,704; python: 1,419,954; asm: 946,768; xml: 739,971; pascal: 187,324; sh: 89,623; perl: 88,663; objc: 79,944; sql: 50,304; cs: 41,786; fortran: 24,137; makefile: 21,811; 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 (78 lines) | stat: -rw-r--r-- 2,404 bytes parent folder | download | duplicates (5)
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
// Copyright 2021 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#ifndef CHROME_BROWSER_APPS_BROWSER_INSTANCE_BROWSER_APP_INSTANCE_MAP_H_
#define CHROME_BROWSER_APPS_BROWSER_INSTANCE_BROWSER_APP_INSTANCE_MAP_H_

#include <algorithm>
#include <map>
#include <memory>
#include <set>
#include <utility>

#include "base/check.h"
#include "base/containers/contains.h"

namespace apps {

template <typename KeyT, typename ValueT>
using BrowserAppInstanceMap = std::map<KeyT, std::unique_ptr<ValueT>>;

template <typename KeyT, typename ValueT>
ValueT& AddInstance(BrowserAppInstanceMap<KeyT, ValueT>& instances,
                    const KeyT& key,
                    std::unique_ptr<ValueT> instance) {
  DCHECK(!base::Contains(instances, key));
  auto it = instances.insert(std::make_pair(key, std::move(instance)));
  return *it.first->second;
}

template <typename KeyT, typename ValueT>
std::unique_ptr<ValueT> PopInstanceIfExists(
    BrowserAppInstanceMap<KeyT, ValueT>& instances,
    const KeyT& key) {
  auto it = instances.find(key);
  if (it == instances.end()) {
    return nullptr;
  }
  auto instance = std::move(it->second);
  instances.erase(it);
  return instance;
}

template <typename KeyT, typename ValueT>
ValueT* GetInstance(const BrowserAppInstanceMap<KeyT, ValueT>& instances,
                    const KeyT& key) {
  auto it = instances.find(key);
  return (it == instances.end()) ? nullptr : it->second.get();
}

template <typename KeyT, typename ValueT, typename PredicateT>
void SelectInstances(std::set<const ValueT*>& result,
                     const BrowserAppInstanceMap<KeyT, ValueT>& instances,
                     PredicateT predicate) {
  for (const auto& pair : instances) {
    const ValueT& instance = *pair.second;
    if (predicate(instance)) {
      result.insert(&instance);
    }
  }
}

template <typename KeyT, typename ValueT, typename PredicateT>
const ValueT* FindInstanceIf(
    const BrowserAppInstanceMap<KeyT, ValueT>& instances,
    PredicateT predicate) {
  auto it = std::ranges::find_if(
      instances, predicate,
      [](const auto& pair) -> const ValueT& { return *pair.second; });
  if (it == instances.end()) {
    return nullptr;
  }
  return it->second.get();
}

}  // namespace apps

#endif  // CHROME_BROWSER_APPS_BROWSER_INSTANCE_BROWSER_APP_INSTANCE_MAP_H_