/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ /* * The contents of this file are subject to the Mozilla Public * License Version 1.1 (the "License"); you may not use this file * except in compliance with the License. You may obtain a copy of * the License at http://www.mozilla.org/MPL/ * * Software distributed under the License is distributed on an "AS * IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or * implied. See the License for the specific language governing * rights and limitations under the License. * * The Original Code is Mozilla. * * The Initial Developer of the Original Code is Netscape * Communications. Portions created by Netscape Communications are * Copyright (C) 2001 by Netscape Communications. All * Rights Reserved. * * Contributor(s): * Scott Collins (original author) */ #ifndef nsStringIterator_h___ #define nsStringIterator_h___ #ifndef nsStringFragment_h___ #include "nsStringFragment.h" #endif #ifndef nsCharTraits_h___ #include "nsCharTraits.h" #endif #ifndef nsStringTraits_h___ #include "nsStringTraits.h" #endif #ifndef nsAlgorithm_h___ #include "nsAlgorithm.h" // for |NS_MIN|, |NS_MAX|, and |NS_COUNT|... #endif /** * * @see nsReadableFragment * @see nsAString */ template class nsReadingIterator // : public bidirectional_iterator_tag { public: typedef ptrdiff_t difference_type; typedef CharT value_type; typedef const CharT* pointer; typedef const CharT& reference; // typedef bidirectional_iterator_tag iterator_category; private: friend class nsAString; friend class nsACString; typedef typename nsStringTraits::abstract_string_type string_type; nsReadableFragment mFragment; const CharT* mPosition; const string_type* mOwningString; public: nsReadingIterator() { } // nsReadingIterator( const nsReadingIterator& ); // auto-generated copy-constructor OK // nsReadingIterator& operator=( const nsReadingIterator& ); // auto-generated copy-assignment operator OK inline void normalize_forward(); inline void normalize_backward(); pointer get() const { return mPosition; } CharT operator*() const { return *get(); } #if 0 // An iterator really deserves this, but some compilers (notably IBM VisualAge for OS/2) // don't like this when |CharT| is a type without members. pointer operator->() const { return get(); } #endif nsReadingIterator& operator++() { ++mPosition; normalize_forward(); return *this; } nsReadingIterator operator++( int ) { nsReadingIterator result(*this); ++mPosition; normalize_forward(); return result; } nsReadingIterator& operator--() { normalize_backward(); --mPosition; return *this; } nsReadingIterator operator--( int ) { nsReadingIterator result(*this); normalize_backward(); --mPosition; return result; } const nsReadableFragment& fragment() const { return mFragment; } const string_type& string() const { NS_ASSERTION(mOwningString, "iterator not attached to a string (|mOwningString| == 0)"); return *mOwningString; } difference_type size_forward() const { return mFragment.mEnd - mPosition; } difference_type size_backward() const { return mPosition - mFragment.mStart; } nsReadingIterator& advance( difference_type n ) { while ( n > 0 ) { difference_type one_hop = NS_MIN(n, size_forward()); NS_ASSERTION(one_hop>0, "Infinite loop: can't advance a reading iterator beyond the end of a string"); // perhaps I should |break| if |!one_hop|? mPosition += one_hop; normalize_forward(); n -= one_hop; } while ( n < 0 ) { normalize_backward(); difference_type one_hop = NS_MAX(n, -size_backward()); NS_ASSERTION(one_hop<0, "Infinite loop: can't advance (backward) a reading iterator beyond the end of a string"); // perhaps I should |break| if |!one_hop|? mPosition += one_hop; n -= one_hop; } return *this; } }; template class nsWritingIterator // : public nsReadingIterator { public: typedef ptrdiff_t difference_type; typedef CharT value_type; typedef CharT* pointer; typedef CharT& reference; // typedef bidirectional_iterator_tag iterator_category; private: friend class nsAString; friend class nsACString; typedef typename nsStringTraits::abstract_string_type string_type; nsWritableFragment mFragment; CharT* mPosition; string_type* mOwningString; public: nsWritingIterator() { } // nsWritingIterator( const nsWritingIterator& ); // auto-generated copy-constructor OK // nsWritingIterator& operator=( const nsWritingIterator& ); // auto-generated copy-assignment operator OK inline void normalize_forward(); inline void normalize_backward(); pointer get() const { return mPosition; } reference operator*() const { return *get(); } #if 0 // An iterator really deserves this, but some compilers (notably IBM VisualAge for OS/2) // don't like this when |CharT| is a type without members. pointer operator->() const { return get(); } #endif nsWritingIterator& operator++() { ++mPosition; normalize_forward(); return *this; } nsWritingIterator operator++( int ) { nsWritingIterator result(*this); ++mPosition; normalize_forward(); return result; } nsWritingIterator& operator--() { normalize_backward(); --mPosition; return *this; } nsWritingIterator operator--( int ) { nsWritingIterator result(*this); normalize_backward(); --mPosition; return result; } const nsWritableFragment& fragment() const { return mFragment; } nsWritableFragment& fragment() { return mFragment; } const string_type& string() const { NS_ASSERTION(mOwningString, "iterator not attached to a string (|mOwningString| == 0)"); return *mOwningString; } string_type& string() { NS_ASSERTION(mOwningString, "iterator not attached to a string (|mOwningString| == 0)"); return *mOwningString; } difference_type size_forward() const { return mFragment.mEnd - mPosition; } difference_type size_backward() const { return mPosition - mFragment.mStart; } nsWritingIterator& advance( difference_type n ) { while ( n > 0 ) { difference_type one_hop = NS_MIN(n, size_forward()); NS_ASSERTION(one_hop>0, "Infinite loop: can't advance a writing iterator beyond the end of a string"); // perhaps I should |break| if |!one_hop|? mPosition += one_hop; normalize_forward(); n -= one_hop; } while ( n < 0 ) { normalize_backward(); difference_type one_hop = NS_MAX(n, -size_backward()); NS_ASSERTION(one_hop<0, "Infinite loop: can't advance (backward) a writing iterator beyond the end of a string"); // perhaps I should |break| if |!one_hop|? mPosition += one_hop; n -= one_hop; } return *this; } PRUint32 write( const value_type* s, PRUint32 n ) { NS_ASSERTION(size_forward() > 0, "You can't |write| into an |nsWritingIterator| with no space!"); n = NS_MIN(n, PRUint32(size_forward())); nsCharTraits::move(mPosition, s, n); advance( difference_type(n) ); return n; } }; template inline void nsReadingIterator::normalize_forward() { while ( mPosition == mFragment.mEnd && mOwningString->GetReadableFragment(mFragment, kNextFragment) ) mPosition = mFragment.mStart; } template inline void nsReadingIterator::normalize_backward() { while ( mPosition == mFragment.mStart && mOwningString->GetReadableFragment(mFragment, kPrevFragment) ) mPosition = mFragment.mEnd; } template inline PRBool operator==( const nsReadingIterator& lhs, const nsReadingIterator& rhs ) { return lhs.get() == rhs.get(); } template inline PRBool operator!=( const nsReadingIterator& lhs, const nsReadingIterator& rhs ) { return lhs.get() != rhs.get(); } // // |nsWritingIterator|s // template inline void nsWritingIterator::normalize_forward() { while ( mPosition == mFragment.mEnd && mOwningString->GetWritableFragment(mFragment, kNextFragment) ) mPosition = mFragment.mStart; } template inline void nsWritingIterator::normalize_backward() { while ( mPosition == mFragment.mStart && mOwningString->GetWritableFragment(mFragment, kPrevFragment) ) mPosition = mFragment.mEnd; } template inline PRBool operator==( const nsWritingIterator& lhs, const nsWritingIterator& rhs ) { return lhs.get() == rhs.get(); } template inline PRBool operator!=( const nsWritingIterator& lhs, const nsWritingIterator& rhs ) { return lhs.get() != rhs.get(); } #endif /* !defined(nsStringIterator_h___) */