singleton.h 1.8 KB
Newer Older
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
/* Copyright (c) 2018 PaddlePaddle Authors. All Rights Reserved.

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. */

#pragma once

#include <unordered_map>
#include "paddle/fluid/platform/enforce.h"

namespace paddle {
namespace inference {

// NOTE not thread-safe.
template <typename T>
struct Singleton {
  static T& Global() {
    static T* x = new T;
    return *x;
  }

  Singleton() = delete;
  Singleton& operator=(const Singleton&) = delete;
};

/*
 * An registor for any type.
 * NOTE not thread-safe.
 */
template <typename ItemParent>
struct Registry {
  static Registry& Global() {
    static auto* x = new Registry<ItemParent>;
    return *x;
  }

  template <typename ItemChild>
  static void Register(const std::string& name) {
    PADDLE_ENFORCE_EQ(items_.count(name), 0);
    items_[name] = new ItemChild;
  }

  static ItemParent* Lookup(const std::string& name) {
    auto it = items_.find(name);
    if (it == items_.end()) return nullptr;
    return it->second;
  }

  ~Registry() {
    for (auto& item : items_) {
      delete item.second;
    }
  }

 private:
  Registry() = default;
  static std::unordered_map<std::string, ItemParent*> items_;
};

template <typename ItemParent>
std::unordered_map<std::string, ItemParent*> Registry<ItemParent>::items_;

}  // namespace inference
}  // namespace paddle