size
value specified for it with value N
, it is recommended that a compiler should choose a data plane implementation that is capable of storing N
table entries. This does not guarantee that an arbitrary set of N
entries can always be inserted in such a table, only that there is some set of N
entries that can be inserted. For example, attempts to add some combinations of N
entries may fail because the compiler selected a hash table with O(1)
guaranteed search time. See “Size property of P4 tables and parser value sets” P4SizeProperty for further discussion on some P4 table implementations and what they are able to guarantee.