mirror of
https://github.com/apple/swift-collections
synced 2026-11-22 04:20:40 +00:00
337 lines
11 KiB
JSON
337 lines
11 KiB
JSON
{
|
|
"kind": "group",
|
|
"title": "Deque Benchmarks",
|
|
"directory": "Deque",
|
|
"contents": [
|
|
{
|
|
"kind": "group",
|
|
"title": "Operations",
|
|
"directory": "operations",
|
|
"contents": [
|
|
{
|
|
"kind": "chart",
|
|
"title": "operations",
|
|
"tasks": [
|
|
"Deque<Int> init from unsafe buffer",
|
|
"Deque<Int> sequential iteration (contiguous, iterator)",
|
|
"Deque<Int> subscript get, random offsets (contiguous)",
|
|
"Deque<Int> append",
|
|
"Deque<Int> append, reserving capacity",
|
|
"Deque<Int> prepend",
|
|
"Deque<Int> prepend, reserving capacity",
|
|
"Deque<Int> removeFirst (contiguous)",
|
|
"Deque<Int> removeLast (contiguous)",
|
|
"Deque<Int> sort (contiguous)",
|
|
"Deque<Int> sort (discontiguous)"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "iteration",
|
|
"tasks": [
|
|
"Deque<Int> sequential iteration (contiguous, iterator)",
|
|
"Deque<Int> sequential iteration (discontiguous, iterator)",
|
|
"Deque<Int> sequential iteration (contiguous, indices)",
|
|
"Deque<Int> sequential iteration (discontiguous, indices)"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "access",
|
|
"tasks": [
|
|
"Deque<Int> subscript get, random offsets (contiguous)",
|
|
"Deque<Int> subscript get, random offsets (discontiguous)",
|
|
"Deque<Int> mutate through subscript (contiguous)",
|
|
"Deque<Int> mutate through subscript (discontiguous)"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "mutate",
|
|
"tasks": [
|
|
"Deque<Int> mutate through subscript (contiguous)",
|
|
"Deque<Int> mutate through subscript (discontiguous)",
|
|
"Deque<Int> random swaps (contiguous)",
|
|
"Deque<Int> random swaps (discontiguous)",
|
|
"Deque<Int> partitioning around middle (contiguous)",
|
|
"Deque<Int> partitioning around middle (discontiguous)",
|
|
"Deque<Int> sort (contiguous)",
|
|
"Deque<Int> sort (discontiguous)"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "push",
|
|
"tasks": [
|
|
"Deque<Int> append",
|
|
"Deque<Int> append, reserving capacity",
|
|
"Deque<Int> prepend",
|
|
"Deque<Int> prepend, reserving capacity"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "pop",
|
|
"tasks": [
|
|
"Deque<Int> removeFirst (contiguous)",
|
|
"Deque<Int> removeFirst (discontiguous)",
|
|
"Deque<Int> removeLast (contiguous)",
|
|
"Deque<Int> removeLast (discontiguous)"
|
|
]
|
|
}
|
|
]
|
|
},
|
|
{
|
|
"kind": "group",
|
|
"title": "Deque vs Array",
|
|
"directory": "versus Array",
|
|
"contents": [
|
|
{
|
|
"kind": "chart",
|
|
"title": "init from buffer of integers",
|
|
"tasks": [
|
|
"Deque<Int> init from unsafe buffer",
|
|
"Array<Int> init from unsafe buffer"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "sequential iteration",
|
|
"tasks": [
|
|
"Deque<Int> sequential iteration (contiguous, iterator)",
|
|
"Deque<Int> sequential iteration (contiguous, indices)",
|
|
"Deque<Int> sequential iteration (discontiguous, iterator)",
|
|
"Deque<Int> sequential iteration (discontiguous, indices)",
|
|
"Array<Int> sequential iteration"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "random-access offset lookups",
|
|
"tasks": [
|
|
"Deque<Int> subscript get, random offsets (contiguous)",
|
|
"Deque<Int> subscript get, random offsets (discontiguous)",
|
|
"Array<Int> subscript get, random offsets"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "mutate through subscript",
|
|
"tasks": [
|
|
"Deque<Int> mutate through subscript (contiguous)",
|
|
"Deque<Int> mutate through subscript (discontiguous)",
|
|
"Array<Int> mutate through subscript"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "random swaps",
|
|
"tasks": [
|
|
"Deque<Int> random swaps (contiguous)",
|
|
"Deque<Int> random swaps (discontiguous)",
|
|
"Array<Int> random swaps"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "partitioning around middle",
|
|
"tasks": [
|
|
"Deque<Int> partitioning around middle (contiguous)",
|
|
"Deque<Int> partitioning around middle (discontiguous)",
|
|
"Array<Int> partitioning around middle"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "sort",
|
|
"tasks": [
|
|
"Deque<Int> sort (contiguous)",
|
|
"Deque<Int> sort (discontiguous)",
|
|
"Array<Int> sort"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "append individual integers",
|
|
"tasks": [
|
|
"Deque<Int> append",
|
|
"Deque<Int> append, reserving capacity",
|
|
"Array<Int> append",
|
|
"Array<Int> append, reserving capacity"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "prepend individual integers",
|
|
"tasks": [
|
|
"Deque<Int> prepend",
|
|
"Deque<Int> prepend, reserving capacity",
|
|
"Array<Int> prepend",
|
|
"Array<Int> prepend, reserving capacity"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "random insertions",
|
|
"tasks": [
|
|
"Deque<Int> random insertions",
|
|
"Array<Int> random insertions"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "removeFirst",
|
|
"tasks": [
|
|
"Deque<Int> removeFirst (contiguous)",
|
|
"Deque<Int> removeFirst (discontiguous)",
|
|
"Array<Int> removeFirst"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "removeLast",
|
|
"tasks": [
|
|
"Deque<Int> removeLast (contiguous)",
|
|
"Deque<Int> removeLast (discontiguous)",
|
|
"Array<Int> removeLast"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "random removals",
|
|
"tasks": [
|
|
"Deque<Int> random removals (contiguous)",
|
|
"Deque<Int> random removals (discontiguous)",
|
|
"Array<Int> random removals"
|
|
]
|
|
}
|
|
]
|
|
},
|
|
{
|
|
"kind": "group",
|
|
"title": "Deque vs std::deque vs VecDeque vs RigidDeque vs UniqueDeque",
|
|
"directory": "versus other deques",
|
|
"contents": [
|
|
{
|
|
"kind": "chart",
|
|
"title": "init from buffer of integers",
|
|
"tasks": [
|
|
"std::deque<intptr_t> constructor from buffer",
|
|
"VecDeque<isize> constructor from buffer",
|
|
"Deque<Int> init from unsafe buffer"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "sequential iteration",
|
|
"tasks": [
|
|
"std::deque<intptr_t> sequential iteration",
|
|
"VecDeque<isize> sequential iteration",
|
|
"Deque<Int> sequential iteration (contiguous, iterator)",
|
|
"Deque<Int> sequential iteration (contiguous, indices)",
|
|
"Deque<Int> sequential iteration (discontiguous, iterator)",
|
|
"Deque<Int> sequential iteration (discontiguous, indices)",
|
|
"UniqueDeque<Int> sequential iteration"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "random-access offset lookups",
|
|
"tasks": [
|
|
"std::deque<intptr_t> random-access offset lookups (operator [])",
|
|
"std::deque<intptr_t> at, random offsets",
|
|
"Deque<Int> subscript get, random offsets (contiguous)",
|
|
"Deque<Int> subscript get, random offsets (discontiguous)"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "append individual integers",
|
|
"tasks": [
|
|
"std::deque<intptr_t> push_back",
|
|
"VecDeque<isize> push_back",
|
|
"Deque<Int> append",
|
|
"UniqueDeque<Int> append"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "append individual integers, reserving capacity",
|
|
"tasks": [
|
|
"VecDeque<isize> push_back, reserving capacity",
|
|
"Deque<Int> append, reserving capacity",
|
|
"RigidDeque<Int> append, reserving capacity",
|
|
"UniqueDeque<Int> append, reserving capacity"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "prepend individual integers",
|
|
"tasks": [
|
|
"std::deque<intptr_t> push_front",
|
|
"VecDeque<isize> push_front",
|
|
"Deque<Int> prepend",
|
|
"UniqueDeque<Int> prepend"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "prepend individual integers, reserving capacity",
|
|
"tasks": [
|
|
"VecDeque<isize> push_front, reserving capacity",
|
|
"Deque<Int> prepend, reserving capacity",
|
|
"RigidDeque<Int> prepend, reserving capacity",
|
|
"UniqueDeque<Int> prepend, reserving capacity"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "random insertions",
|
|
"tasks": [
|
|
"std::deque<intptr_t> random insertions",
|
|
"VecDeque<isize> random insertions",
|
|
"Deque<Int> random insertions",
|
|
"UniqueDeque<Int> random insertions"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "removeFirst",
|
|
"tasks": [
|
|
"std::deque<intptr_t> pop_front",
|
|
"Deque<Int> removeFirst (contiguous)",
|
|
"Deque<Int> removeFirst (discontiguous)"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "removeLast",
|
|
"tasks": [
|
|
"std::deque<intptr_t> pop_back",
|
|
"Deque<Int> removeLast (contiguous)",
|
|
"Deque<Int> removeLast (discontiguous)"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "random removals",
|
|
"tasks": [
|
|
"std::deque<intptr_t> random removals",
|
|
"Deque<Int> random removals (contiguous)",
|
|
"Deque<Int> random removals (discontiguous)"
|
|
]
|
|
},
|
|
{
|
|
"kind": "chart",
|
|
"title": "sort",
|
|
"tasks": [
|
|
"std::deque<intptr_t> sort",
|
|
"Deque<Int> sort (contiguous)",
|
|
"Deque<Int> sort (discontiguous)"
|
|
]
|
|
}
|
|
]
|
|
}
|
|
]
|
|
}
|