PartitionTable.h
Go to the documentation of this file.
42 Iterator find(Partition::Type type = Partition::Type::any, uint8_t subType = Partition::SubType::any) const
73 return *std::find_if(begin(), end(), [address](Partition part) { return part.contains(address); });
107 {
111 template <typename... Args> Partition add(const String& name, Partition::FullType type, Args... args)
112 {
Internal structure describing the binary layout of a partition table entry.
Definition: partition_info.h:26
Partition::Info::OwnedList mEntries
Definition: PartitionTable.h:144
void load(const esp_partition_info_t *entry, unsigned count)
Partition findOta(uint8_t index) const
Find the n'th OTA partition.
Definition: PartitionTable.h:95
Definition: FileDevice.h:25
Express both partition type and subtype together.
Definition: Partition.h:139
Partition add(const Partition::Info *info)
Add new partition using given Info.
Definition: PartitionTable.h:122
Definition: Iterator.h:26
Represents a storage device (e.g. flash memory)
Definition: Components/Storage/src/include/Storage/Device.h:33
bool contains(storage_size_t addr) const
Determine if given address contained within this partition.
Definition: Partition.h:416
PartitionTable(Device &device)
Definition: PartitionTable.h:37
Iterator find(Partition::Type type=Partition::Type::any, uint8_t subType=Partition::SubType::any) const
Find partitions based on one or more parameters.
Definition: PartitionTable.h:58