summaryrefslogtreecommitdiff
path: root/autodoc/source/ary/inc/sci_impl.hxx
diff options
context:
space:
mode:
Diffstat (limited to 'autodoc/source/ary/inc/sci_impl.hxx')
-rw-r--r--autodoc/source/ary/inc/sci_impl.hxx416
1 files changed, 0 insertions, 416 deletions
diff --git a/autodoc/source/ary/inc/sci_impl.hxx b/autodoc/source/ary/inc/sci_impl.hxx
deleted file mode 100644
index 92aa1512..00000000
--- a/autodoc/source/ary/inc/sci_impl.hxx
+++ /dev/null
@@ -1,416 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
-/*************************************************************************
- *
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * Copyright 2000, 2010 Oracle and/or its affiliates.
- *
- * OpenOffice.org - a multi-platform office productivity suite
- *
- * This file is part of OpenOffice.org.
- *
- * OpenOffice.org is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License version 3
- * only, as published by the Free Software Foundation.
- *
- * OpenOffice.org is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU Lesser General Public License version 3 for more details
- * (a copy is included in the LICENSE file that accompanied this code).
- *
- * You should have received a copy of the GNU Lesser General Public License
- * version 3 along with OpenOffice.org. If not, see
- * <http://www.openoffice.org/license.html>
- * for a copy of the LGPLv3 License.
- *
- ************************************************************************/
-
-#ifndef ARY_SCI_IMPL_HXX
-#define ARY_SCI_IMPL_HXX
-
-
-
-// USED SERVICES
- // BASE CLASSES
-#include <ary/stdconstiter.hxx>
- // COMPONENTS
- // PARAMETERS
-
-
-namespace ary
-{
-
-
-//************************* SCI_Vector **********************************//
-
-template <class ELEM>
-class SCI_Vector : public StdConstIterator<ELEM>
-{
- public:
- typedef std::vector<ELEM> source;
- typedef typename source::const_iterator source_iterator;
-
- SCI_Vector(
- const source & i_rSource );
- virtual ~SCI_Vector();
-
- private:
- // Interface StdConstIterator<>:
- virtual void do_Advance();
- virtual const ELEM *
- inq_CurElement() const;
- virtual bool inq_IsSorted() const;
-
- // DATA
- source_iterator itRun;
- source_iterator itEnd;
-};
-
-
-
-//************************* SCI_Map **********************************//
-
-template <class KEY, class VALUE>
-class SCI_Map : public StdConstIterator< typename std::map<KEY,VALUE>::value_type >
-{
- public:
- typedef std::map<KEY,VALUE> source;
- typedef typename source::const_iterator source_iterator;
-
- SCI_Map(
- const source & i_rSource );
- virtual ~SCI_Map();
-
- private:
- // Interface StdConstIterator<>:
- virtual void do_Advance();
- virtual const typename std::map<KEY,VALUE>::value_type *
- inq_CurElement() const;
- virtual bool inq_IsSorted() const;
-
- // DATA
- source_iterator itRun;
- source_iterator itEnd;
-};
-
-
-//************************* SCI_MultiMap **********************************//
-
-template <class KEY, class VALUE>
-class SCI_MultiMap : public StdConstIterator< typename std::multimap<KEY,VALUE>::value_type >
-{
- public:
- typedef std::multimap<KEY,VALUE> source;
- typedef typename source::const_iterator source_iterator;
-
- SCI_MultiMap(
- const source & i_rSource );
- SCI_MultiMap(
- source_iterator i_begin,
- source_iterator i_end );
- virtual ~SCI_MultiMap();
-
- private:
- // Interface StdConstIterator<>:
- virtual void do_Advance();
- virtual const typename std::multimap<KEY,VALUE>::value_type *
- inq_CurElement() const;
- virtual bool inq_IsSorted() const;
-
- // DATA
- source_iterator itRun;
- source_iterator itEnd;
-};
-
-
-
-//************************* SCI_Set **********************************//
-
-
-template <class TYPES>
-class SCI_Set : public StdConstIterator<typename TYPES::element_type>
-{
- public:
- typedef typename TYPES::element_type element;
- typedef typename TYPES::sort_type sorter;
- typedef std::set<element, sorter> source;
- typedef typename source::const_iterator source_iterator;
-
- SCI_Set(
- const source & i_rSource );
- virtual ~SCI_Set();
-
- private:
- // Interface StdConstIterator<>:
- virtual void do_Advance();
- virtual const element *
- inq_CurElement() const;
- virtual bool inq_IsSorted() const;
-
- // DATA
- source_iterator itRun;
- source_iterator itEnd;
-};
-
-//************************* SCI_DataInMap **********************************//
-
-template <class KEY, class VALUE>
-class SCI_DataInMap : public StdConstIterator<VALUE>
-{
- public:
- typedef std::map<KEY,VALUE> source;
- typedef typename source::const_iterator source_iterator;
-
- SCI_DataInMap(
- const source & i_rSource );
- virtual ~SCI_DataInMap();
-
- private:
- // Interface StdConstIterator<>:
- virtual void do_Advance();
- virtual const VALUE *
- inq_CurElement() const;
- virtual bool inq_IsSorted() const;
-
- // DATA
- source_iterator itRun;
- source_iterator itEnd;
-};
-
-
-
-
-
-//********************************************************************//
-
-
-// IMPLEMENTATION
-
-template <class ELEM>
-SCI_Vector<ELEM>::SCI_Vector( const source & i_rSource )
- : itRun(i_rSource.begin()),
- itEnd(i_rSource.end())
-{
-}
-
-template <class ELEM>
-SCI_Vector<ELEM>::~SCI_Vector()
-{
-}
-
-
-template <class ELEM>
-void
-SCI_Vector<ELEM>::do_Advance()
-{
- if (itRun != itEnd)
- ++itRun;
-}
-
-template <class ELEM>
-const ELEM *
-SCI_Vector<ELEM>::inq_CurElement() const
-{
- if (itRun != itEnd)
- return &(*itRun);
- return 0;
-}
-
-template <class ELEM>
-bool
-SCI_Vector<ELEM>::inq_IsSorted() const
-{
- return false;
-}
-
-
-
-
-template <class KEY, class VALUE>
-SCI_Map<KEY,VALUE>::SCI_Map( const source & i_rSource )
- : itRun(i_rSource.begin()),
- itEnd(i_rSource.end())
-{
-}
-
-template <class KEY, class VALUE>
-SCI_Map<KEY,VALUE>::~SCI_Map()
-{
-}
-
-template <class KEY, class VALUE>
-void
-SCI_Map<KEY,VALUE>::do_Advance()
-{
- if (itRun != itEnd)
- ++itRun;
-}
-
-template <class KEY, class VALUE>
-const typename std::map<KEY,VALUE>::value_type *
-SCI_Map<KEY,VALUE>::inq_CurElement() const
-{
- if (itRun != itEnd)
- return &(*itRun);
- return 0;
-}
-
-
-template <class KEY, class VALUE>
-bool
-SCI_Map<KEY,VALUE>::inq_IsSorted() const
-{
- return true;
-}
-
-
-
-
-
-
-
-template <class KEY, class VALUE>
-SCI_MultiMap<KEY,VALUE>::SCI_MultiMap( const source & i_rSource )
- : itRun(i_rSource.begin()),
- itEnd(i_rSource.end())
-{
-}
-
-template <class KEY, class VALUE>
-SCI_MultiMap<KEY,VALUE>::SCI_MultiMap( source_iterator i_begin,
- source_iterator i_end )
- : itRun(i_begin),
- itEnd(i_end)
-{
-}
-
-template <class KEY, class VALUE>
-SCI_MultiMap<KEY,VALUE>::~SCI_MultiMap()
-{
-}
-
-template <class KEY, class VALUE>
-void
-SCI_MultiMap<KEY,VALUE>::do_Advance()
-{
- if (itRun != itEnd)
- ++itRun;
-}
-
-template <class KEY, class VALUE>
-const typename std::multimap<KEY,VALUE>::value_type *
-SCI_MultiMap<KEY,VALUE>::inq_CurElement() const
-{
- if (itRun != itEnd)
- return &(*itRun);
- return 0;
-}
-
-
-template <class KEY, class VALUE>
-bool
-SCI_MultiMap<KEY,VALUE>::inq_IsSorted() const
-{
- return true;
-}
-
-
-
-
-
-
-
-
-template <class ELEM>
-SCI_Set<ELEM>::SCI_Set( const source & i_rSource )
- : itRun(i_rSource.begin()),
- itEnd(i_rSource.end())
-{
-}
-
-template <class ELEM>
-SCI_Set<ELEM>::~SCI_Set()
-{
-}
-
-
-template <class ELEM>
-void
-SCI_Set<ELEM>::do_Advance()
-{
- if (itRun != itEnd)
- ++itRun;
-}
-
-template <class ELEM>
-const typename SCI_Set<ELEM>::element *
-SCI_Set<ELEM>::inq_CurElement() const
-{
- if (itRun != itEnd)
- return &(*itRun);
- return 0;
-}
-
-template <class ELEM>
-bool
-SCI_Set<ELEM>::inq_IsSorted() const
-{
- return true;
-}
-
-
-
-
-
-
-
-template <class KEY, class VALUE>
-SCI_DataInMap<KEY,VALUE>::SCI_DataInMap( const source & i_rSource )
- : itRun(i_rSource.begin()),
- itEnd(i_rSource.end())
-{
-}
-
-template <class KEY, class VALUE>
-SCI_DataInMap<KEY,VALUE>::~SCI_DataInMap()
-{
-}
-
-template <class KEY, class VALUE>
-void
-SCI_DataInMap<KEY,VALUE>::do_Advance()
-{
- if (itRun != itEnd)
- ++itRun;
-}
-
-template <class KEY, class VALUE>
-const VALUE *
-SCI_DataInMap<KEY,VALUE>::inq_CurElement() const
-{
- if (itRun != itEnd)
- return &(*itRun).second;
- return 0;
-}
-
-
-template <class KEY, class VALUE>
-bool
-SCI_DataInMap<KEY,VALUE>::inq_IsSorted() const
-{
- return true;
-}
-
-
-
-
-
-
-
-} // namespace ary
-
-
-#endif
-
-/* vim:set shiftwidth=4 softtabstop=4 expandtab: */