pw_containers#

Generic collections of objects for embedded devices

Stable C++ Code Size Impact: 200 to 3300 bytes

Familiar: Pigweed containers resemble standard library containers.
Comprehensive: You can pick containers for speed, size, or in-between.
Embedded-friendly: No dynamic allocation needed!

class Publisher {
 public:
  using Subscriber = pw::Function<void(const Message&)>;
  static constexpr size_t kMaxSubscribers = 10;

  pw::Status Subscribe(Subscriber&& subscriber) {
    // Check if the vector's fixed capacity has been exhausted.
    if (subscribers_.full()) {
      return pw::Status::ResourceExhausted();
    }

    // Add the subscriber to the vector.
    subscribers_.emplace_back(std::move(subscriber));
    return pw::OkStatus();
  }

  void Publish(const Message& message) {
    // Iterate over the vector.
    for (auto& subscriber : subscribers_) {
      subscriber(message);
    }
  }

 private:
  pw::Vector<Subscriber, kMaxSubscribers> subscribers_;
};

Much like the standard containers library, the pw_containers module provides embedded-friendly container class templates and algorithms. These allow developers to implement data structures for embedded devices that are more resource-constrained than conventional applications. These containers include:

Lists

Intrusive singly and doubly linked lists, and intrusive queues.

Lists

Maps

Key-value stores with constant or logarithmic performance.

Maps

Queues

Uni- and bidirectional FIFOs.

Queues

Sets

Unordered collections with fast lookup, insertion, and deletion.

Sets