6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-05-22 19:38:40 +00:00
Code Issues Projects Releases Wiki Activity

* Fixed spelling of "sentinel"

Browse Source 
* Removed trailing whitespace


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@61907 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Misha Brukman 2009-01-08 02:21:23 +00:00
parent 5539a1ecda
commit e21a6bae80
1 changed files with 23 additions and 23 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
include/llvm/ADT/ilist.h
View File

@ -257,15 +257,15 @@ template<typename NodeTy> struct simplify_type<const ilist_iterator<NodeTy> > {
/// 1. The list may be completely unconstructed. In this case, the head /// 1. The list may be completely unconstructed. In this case, the head
/// pointer is null. When in this form, any query for an iterator (e.g. /// pointer is null. When in this form, any query for an iterator (e.g.
/// begin() or end()) causes the list to transparently change to state #2. /// begin() or end()) causes the list to transparently change to state #2.
/// 2. The list may be empty, but contain a sentinal for the end iterator. This /// 2. The list may be empty, but contain a sentinel for the end iterator. This
/// sentinal is created by the Traits::createSentinel method and is a link /// sentinel is created by the Traits::createSentinel method and is a link
/// in the list. When the list is empty, the pointer in the iplist points /// in the list. When the list is empty, the pointer in the iplist points
/// to the sentinal. Once the sentinal is constructed, it /// to the sentinel. Once the sentinel is constructed, it
/// is not destroyed until the list is. /// is not destroyed until the list is.
/// 3. The list may contain actual objects in it, which are stored as a doubly /// 3. The list may contain actual objects in it, which are stored as a doubly
/// linked list of nodes. One invariant of the list is that the predecessor /// linked list of nodes. One invariant of the list is that the predecessor
/// of the first node in the list always points to the last node in the list, /// of the first node in the list always points to the last node in the list,
/// and the successor pointer for the sentinal (which always stays at the /// and the successor pointer for the sentinel (which always stays at the
/// end of the list) is always null. /// end of the list) is always null.
/// ///
template<typename NodeTy, typename Traits=ilist_traits<NodeTy> > template<typename NodeTy, typename Traits=ilist_traits<NodeTy> >
@ -280,9 +280,9 @@ class iplist : public Traits {
const NodeTy *getTail() const { return this->getPrev(Head); } const NodeTy *getTail() const { return this->getPrev(Head); }
void setTail(NodeTy *N) const { this->setPrev(Head, N); } void setTail(NodeTy *N) const { this->setPrev(Head, N); }
/// CreateLazySentinal - This method verifies whether the sentinal for the /// CreateLazySentinel - This method verifies whether the sentinel for the
/// list has been created and lazily makes it if not. /// list has been created and lazily makes it if not.
void CreateLazySentinal() const { void CreateLazySentinel() const {
if (Head != 0) return; if (Head != 0) return;
Head = Traits::createSentinel(); Head = Traits::createSentinel();
this->setNext(Head, 0); this->setNext(Head, 0);
@ -319,19 +319,19 @@ public:
// Iterator creation methods. // Iterator creation methods.
iterator begin() { iterator begin() {
CreateLazySentinal(); CreateLazySentinel();
return iterator(Head); return iterator(Head);
} }
const_iterator begin() const { const_iterator begin() const {
CreateLazySentinal(); CreateLazySentinel();
return const_iterator(Head); return const_iterator(Head);
} }
iterator end() { iterator end() {
CreateLazySentinal(); CreateLazySentinel();
return iterator(getTail()); return iterator(getTail());
} }
const_iterator end() const { const_iterator end() const {
CreateLazySentinal(); CreateLazySentinel();
return const_iterator(getTail()); return const_iterator(getTail());
} }
@ -461,7 +461,7 @@ private:
transferNodesFromList(L2, First, PosNext); transferNodesFromList(L2, First, PosNext);
// Now that everything is set, restore the pointers to the list sentinals. // Now that everything is set, restore the pointers to the list sentinels.
L2.setTail(L2Sentinel); L2.setTail(L2Sentinel);
setTail(ThisSentinel); setTail(ThisSentinel);
} }
@ -474,7 +474,7 @@ public:
// //
size_type size() const { size_type size() const {
if (Head == 0) return 0; // Don't require construction of sentinal if empty. if (Head == 0) return 0; // Don't require construction of sentinel if empty.
#if __GNUC__ == 2 #if __GNUC__ == 2
// GCC 2.95 has a broken std::distance // GCC 2.95 has a broken std::distance
size_type Result = 0; size_type Result = 0;