diff options
| author | schmidt <douglascraigschmidt@users.noreply.github.com> | 1999-07-04 18:23:12 +0000 |
|---|---|---|
| committer | schmidt <douglascraigschmidt@users.noreply.github.com> | 1999-07-04 18:23:12 +0000 |
| commit | 523aa4a484f446b3ebd1334849f4af26a7371e3f (patch) | |
| tree | fc711a38bc92e1e0b95734bc2ef616d189508177 /ace/RB_Tree.cpp | |
| parent | 82b367d03acf1087f5cdfa93d9b057bbf81a1d80 (diff) | |
| download | ATCD-523aa4a484f446b3ebd1334849f4af26a7371e3f.tar.gz | |
ChangeLogTag:Sun Jul 4 12:34:24 1999 Douglas C. Schmidt <schmidt@tango.cs.wustl.edu>
Diffstat (limited to 'ace/RB_Tree.cpp')
| -rw-r--r-- | ace/RB_Tree.cpp | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/ace/RB_Tree.cpp b/ace/RB_Tree.cpp index cd58d7829e6..e1dcc5a859e 100644 --- a/ace/RB_Tree.cpp +++ b/ace/RB_Tree.cpp @@ -591,7 +591,7 @@ ACE_RB_Tree<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK>::insert_i (const EXT_ID &k, ACE_RB_Tree_Node<EXT_ID, INT_ID> *tmp = 0; ACE_NEW_RETURN (tmp, - (ACE_RB_Tree_Node<EXT_ID, INT_ID> (k, t)), + (ACE_RB_Tree_Node<EXT_ID, INT_ID>) (k, t), 0); current->right (tmp); @@ -622,7 +622,7 @@ ACE_RB_Tree<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK>::insert_i (const EXT_ID &k, // The left subtree is empty: insert new node there. ACE_RB_Tree_Node<EXT_ID, INT_ID> *tmp = 0; ACE_NEW_RETURN (tmp, - (ACE_RB_Tree_Node<EXT_ID, INT_ID> (k, t)), + (ACE_RB_Tree_Node<EXT_ID, INT_ID>) (k, t), 0); current->left (tmp); @@ -643,7 +643,7 @@ ACE_RB_Tree<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK>::insert_i (const EXT_ID &k, // The tree is empty: insert at the root and color the root // black. ACE_NEW_RETURN (root_, - (ACE_RB_Tree_Node<EXT_ID, INT_ID> (k, t)), + (ACE_RB_Tree_Node<EXT_ID, INT_ID>) (k, t), 0); if (root_) { @@ -702,7 +702,7 @@ ACE_RB_Tree<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK>::insert_i (const EXT_ID &k, // The right subtree is empty: insert new node there. ACE_RB_Tree_Node<EXT_ID, INT_ID> *tmp = 0; ACE_NEW_RETURN (tmp, - (ACE_RB_Tree_Node<EXT_ID, INT_ID> (k, t)), + (ACE_RB_Tree_Node<EXT_ID, INT_ID>) (k, t), -1); current->right (tmp); @@ -733,7 +733,7 @@ ACE_RB_Tree<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK>::insert_i (const EXT_ID &k, // The left subtree is empty: insert new node there. ACE_RB_Tree_Node<EXT_ID, INT_ID> *tmp = 0; ACE_NEW_RETURN (tmp, - (ACE_RB_Tree_Node<EXT_ID, INT_ID> (k, t)), + (ACE_RB_Tree_Node<EXT_ID, INT_ID>) (k, t), -1); current->left (tmp); // If the node was successfully inserted, set its @@ -752,7 +752,7 @@ ACE_RB_Tree<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK>::insert_i (const EXT_ID &k, { // The tree is empty: insert at the root and color the root black. ACE_NEW_RETURN (root_, - (ACE_RB_Tree_Node<EXT_ID, INT_ID> (k, t)), + (ACE_RB_Tree_Node<EXT_ID, INT_ID>) (k, t), -1); root_->color (ACE_RB_Tree_Node_Base::BLACK); ++current_size_; |