summaryrefslogtreecommitdiff
path: root/chromium/content/browser/sms/sms_queue.h
blob: 223139a8e5073ce28a7e4efb3ec590b28b9911c0 (plain)
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
// Copyright 2019 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#ifndef CONTENT_BROWSER_SMS_SMS_QUEUE_H_
#define CONTENT_BROWSER_SMS_SMS_QUEUE_H_

#include <map>

#include "base/observer_list.h"
#include "content/public/browser/sms_fetcher.h"
#include "url/origin.h"

namespace content {

// SmsQueue manages the queue of pending requests for each origin.
class SmsQueue {
 public:
  SmsQueue();

  SmsQueue(const SmsQueue&) = delete;
  SmsQueue& operator=(const SmsQueue&) = delete;

  ~SmsQueue();

  using FailureType = SmsFetchFailureType;
  using Subscriber = SmsFetcher::Subscriber;

  void Push(const OriginList& origin_list, Subscriber* subscriber);
  Subscriber* Pop(const OriginList& origin_list);
  void Remove(const OriginList& origin_list, Subscriber* subscriber);
  bool HasSubscribers();
  bool HasSubscriber(const OriginList& origin_list,
                     const Subscriber* subscriber);
  // Pops and notifies the first subscriber of an origin iff there's one origin
  // in the |subscribers_| map. Returns true if the failure is handled.
  bool NotifyFailure(FailureType failure_type);

 private:
  std::map<OriginList, base::ObserverList<Subscriber>> subscribers_;
};

}  // namespace content

#endif  // CONTENT_BROWSER_SMS_SMS_QUEUE_H_