PartitionTable.h
Go to the documentation of this file.
34 Iterator find(Partition::Type type = Partition::Type::any, uint8_t subType = Partition::SubType::any) const
65 return *std::find_if(begin(), end(), [address](Partition part) { return part.contains(address); });
bool contains(uint32_t addr) const
Determine if given address contained within this partition.
Definition: Partition.h:342
Partition find(uint32_t address) const
Find partition containing the given address.
Definition: PartitionTable.h:63
Partition find(const String &name) const
Find partition by name.
Definition: PartitionTable.h:53
Definition: Iterator.h:18
Partition findOta(uint8_t index)
Find the n'th OTA partition.
Definition: PartitionTable.h:71
PartitionTable(Device &device)
Definition: PartitionTable.h:21
Internal structure describing the binary layout of a partition table entry.
Definition: partition_info.h:18
Represents a storage device (e.g. flash memory)
Definition: Components/Storage/src/include/Storage/Device.h:32
void load(const esp_partition_info_t *entry, unsigned count)
Partition operator[](unsigned index) const
Definition: PartitionTable.h:98
Iterator find(Partition::Type type=Partition::Type::any, uint8_t subType=Partition::SubType::any) const
Definition: PartitionTable.h:34
std::unique_ptr< Partition::Info[]> mEntries
Definition: PartitionTable.h:108
Definition: FileDevice.h:23
Definition: PartitionTable.h:18