mirror of
https://github.com/zeek/zeek.git
synced 2025-10-02 06:38:20 +00:00

Hash key construction of nested sets depended on the order in which their elements are iterated, which varied even between sets containing equivalent elements. The iteration order is now sorted by each element's hash value (or, on collision, by full key) such that equivalent sets no longer hash differently.
27 lines
245 B
Text
27 lines
245 B
Text
{
|
|
[1.2.3.4] = {
|
|
[a=4, tags_v=[0, 1], tags_t={
|
|
[two] = 2,
|
|
[one] = 1
|
|
}, tags_s={
|
|
b,
|
|
a
|
|
}]
|
|
}
|
|
}
|
|
{
|
|
[a=13, tags_v=[, , 2, 3], tags_t={
|
|
[five] = 5,
|
|
[four] = 4
|
|
}, tags_s={
|
|
c,
|
|
d
|
|
}],
|
|
[a=4, tags_v=[0, 1], tags_t={
|
|
[two] = 2,
|
|
[one] = 1
|
|
}, tags_s={
|
|
b,
|
|
a
|
|
}]
|
|
}
|