Searched refs:a_root (Results 1 - 4 of 4) sorted by relevance
/haiku-buildtools/binutils/libiberty/ |
H A D | fibheap.c | 147 fibnode_t a_root, b_root, temp; 150 if ((a_root = heapa->root) == NULL) 162 a_root->left->right = b_root; 163 b_root->left->right = a_root; 164 temp = a_root->left; 165 a_root->left = b_root->left; 146 fibnode_t a_root, b_root, temp; local
|
/haiku-buildtools/gcc/libiberty/ |
H A D | fibheap.c | 147 fibnode_t a_root, b_root, temp; 150 if ((a_root = heapa->root) == NULL) 162 a_root->left->right = b_root; 163 b_root->left->right = a_root; 164 temp = a_root->left; 165 a_root->left = b_root->left; 146 fibnode_t a_root, b_root, temp; local
|
/haiku-buildtools/legacy/binutils/libiberty/ |
H A D | fibheap.c | 147 fibnode_t a_root, b_root, temp; 150 if ((a_root = heapa->root) == NULL) 162 a_root->left->right = b_root; 163 b_root->left->right = a_root; 164 temp = a_root->left; 165 a_root->left = b_root->left; 146 fibnode_t a_root, b_root, temp; local
|
/haiku-buildtools/gcc/gcc/ |
H A D | fibonacci_heap.h | 460 fibonacci_node<K,V> *a_root, *b_root, *temp; local 463 if ((a_root = heapa->m_root) == NULL) 475 a_root->m_left->m_right = b_root; 476 b_root->m_left->m_right = a_root; 477 temp = a_root->m_left; 478 a_root->m_left = b_root->m_left;
|
Completed in 43 milliseconds