Skip to content

fix comment typos #614

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

Merged
merged 2 commits into from
Dec 17, 2015
Merged

fix comment typos #614

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
1a42043
Fix minor typos
tracicot Dec 17, 2015
270e018
Whoops, undo unnecessary correction
tracicot Dec 17, 2015
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
4 changes: 2 additions & 2 deletions include/swift/Runtime/Concurrent.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -145,7 +145,7 @@ template <class KeyTy, class ValueTy> struct ConcurrentMapNode {
/// The method findOrAllocateNode searches the binary tree in search of the
/// exact Key value. If it finds an edge that points to NULL that should
/// contain the value then it tries to compare and swap the new node into
/// place. If it looses the race to a different thread it de-allocates
/// place. If it loses the race to a different thread it de-allocates
/// the node and starts the search again since the new node should
/// be placed (or found) on the new link. See findOrAllocateNode for more
/// details.
Expand All @@ -164,7 +164,7 @@ template <class KeyTy, class ValueTy> class ConcurrentMap {
/// accelerating the search of the same value again and again.
std::atomic<NodeTy *> LastSearch;

/// Search a for a node with key value \p. If the node does not exist then
/// Search for a node with key value \p. If the node does not exist then
/// allocate a new bucket and add it to the tree.
ConcurrentList<ValueTy> &findOrAllocateNode(KeyTy Key) {
// Try looking at the last node we searched.
Expand Down