Comments (3)
The order is arbitrary but deterministic, in the sense that you can repeat the exact same experiment with the same results, but equal element inserted in a certain order can be extracted in reverse order. It does not depend on the hasher, but only on the heap algorithm.
I will properly update the documentation with this information.
Thank you.
from priority-queue.
To clarify, is this test guaranteed to succeed?
let mut a = PriorityQueue::new();
let mut b = PriorityQueue::new();
a.push("Apples", 1);
b.push("Apples", 1);
a.push("Oranges", 1);
b.push("Oranges", 1);
a.push("Pears", 2);
b.push("Pears", 2);
a.push("Lemons", 1);
b.push("Lemons", 1);
// note, we don't care if "Apples" get popped before "Oranges"
// we only care that queues 'a' and 'b' will pop them in the same (arbitrary) order
// if we performed the same operations in the same order on queues 'a' and 'b'
assert_eq!(a.pop(), b.pop());
assert_eq!(a.pop(), b.pop());
assert_eq!(a.pop(), b.pop());
assert_eq!(a.pop(), b.pop());
In other words, if I have two queues and apply the same operations in the same order, are they guaranteed to remain synchronized?
from priority-queue.
Yes. And also
use priority_queue::PriorityQueue;
use hashbrown::hash_map::DefaultHashBuilder;
fn main() {
let mut a = PriorityQueue::new();
let mut b = PriorityQueue::<_, _, DefaultHashBuilder>::with_default_hasher();
a.push("Apples", 1);
b.push("Apples", 1);
a.push("Oranges", 1);
b.push("Oranges", 1);
a.push("Pears", 2);
b.push("Pears", 2);
a.push("Lemons", 1);
b.push("Lemons", 1);
// note, we don't care if "Apples" get popped before "Oranges"
// we only care that queues 'a' and 'b' will pop them in the same (arbitrary) order
// if we performed the same operations in the same order on queues 'a' and 'b'
assert_eq!(a.pop(), b.pop());
assert_eq!(a.pop(), b.pop());
assert_eq!(a.pop(), b.pop());
assert_eq!(a.pop(), b.pop());
}
does not fail
from priority-queue.
Related Issues (20)
- changing priorities via `iter_mut` doesn't work as I expected HOT 4
- Float as Priority HOT 2
- Bug in PriorityQueue::remove() HOT 3
- Function to remove item with least priority HOT 7
- Remove Sized bound for some functions HOT 1
- Implement a DoublePriorityQueue HOT 1
- DoublePriorityQueue panicked at 'called `Option::unwrap()` on a `None` value' HOT 7
- clear_over(priority) and clear_under(priority) HOT 3
- iter_over(priority) and iter_under(priority) HOT 2
- Add a pop_lowest_priority API HOT 3
- Bug in DoublePriorityQueue.peek_min() HOT 6
- "error: could not compile 'priority-queue'" on nightly rust build HOT 2
- Add option for duplicate/unhashable Items HOT 2
- Feature Suggestion: DoublePriorityQueue with multiple priorities
- Difference between `push` and `change_priority` unclear HOT 1
- Feature request: `drain_filter` method HOT 1
- Use complex data structure as Priority HOT 1
- `shrink_to_fit` does not shrink the internal IndexMap
- ahash < 0.8.7 broken on nightly HOT 3
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from priority-queue.