Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

bugfix-832 #833

Merged
merged 1 commit into from
Jul 20, 2021
Merged

bugfix-832 #833

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion Os/Pthreads/docs/sdd.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -29,7 +29,7 @@ implemented using a stable maximum binary heap with *O(log(n))* enqueue and dequ
has the property that items pulled off the queue are in order of decreasing priority. Items of equal priority are pulled off
in FIFO order.

NOTE: [POSIX queues](http://lxr.free-electrons.com/source/ipc/mqueue.c) use a dynamically sized [red-black tree](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree) for the message queue data structure. This data structure also has an *O(log(n))* enqueue and dequeue time.
NOTE: [POSIX queues](https://elixir.bootlin.com/linux/latest/source/ipc/mqueue.c) use a dynamically sized [red-black tree](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree) for the message queue data structure. This data structure also has an *O(log(n))* enqueue and dequeue time.

## 2 Requirements

Expand Down