summaryrefslogtreecommitdiff
path: root/sfx2/inc
diff options
context:
space:
mode:
authorNoel Grandin <noel@peralex.com>2013-04-15 11:26:43 +0200
committerMichael Stahl <mstahl@redhat.com>2013-04-16 20:05:27 +0000
commit187a592df9bc9c1ef4b53fe6dce40a3c74f6bb67 (patch)
treeb2eb6da66f831b199d2d78ae5e39e3f17950ff10 /sfx2/inc
parent7e4db91a3900fd0bbce0f0592a045458a37862b3 (diff)
remove dead code minstack.hxx
Change-Id: I67a7a4c51188187c1ab234f8e9d2634eb018badf Reviewed-on: https://gerrit.libreoffice.org/3397 Reviewed-by: Thomas Arnhold <thomas@arnhold.org> Reviewed-by: Michael Stahl <mstahl@redhat.com> Tested-by: Michael Stahl <mstahl@redhat.com>
Diffstat (limited to 'sfx2/inc')
-rw-r--r--sfx2/inc/sfx2/minstack.hxx56
1 files changed, 0 insertions, 56 deletions
diff --git a/sfx2/inc/sfx2/minstack.hxx b/sfx2/inc/sfx2/minstack.hxx
deleted file mode 100644
index d4de0da74ff7..000000000000
--- a/sfx2/inc/sfx2/minstack.hxx
+++ /dev/null
@@ -1,56 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
-/*
- * This file is part of the LibreOffice project.
- *
- * This Source Code Form is subject to the terms of the Mozilla Public
- * License, v. 2.0. If a copy of the MPL was not distributed with this
- * file, You can obtain one at http://mozilla.org/MPL/2.0/.
- *
- * This file incorporates work covered by the following license notice:
- *
- * Licensed to the Apache Software Foundation (ASF) under one or more
- * contributor license agreements. See the NOTICE file distributed
- * with this work for additional information regarding copyright
- * ownership. The ASF licenses this file to you under the Apache
- * License, Version 2.0 (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.apache.org/licenses/LICENSE-2.0 .
- */
-#ifndef _SFXMINSTACK_HXX
-#define _SFXMINSTACK_HXX
-
-#include <sfx2/minarray.hxx>
-
-#define DECL_PTRSTACK( ARR, T, nI, nG ) \
-DECL_PTRARRAY( ARR##arr_, T, nI, nG ) \
-class ARR: private ARR##arr_ \
-{ \
-public: \
- ARR( sal_uInt8 nInitSize = nI, sal_uInt8 nGrowSize = nG ): \
- ARR##arr_( nInitSize, nGrowSize ) \
- {} \
-\
- ARR( const ARR& rOrig ): \
- ARR##arr_( rOrig ) \
- {} \
-\
- sal_uInt16 Count() const { return ARR##arr_::Count(); } \
- void Push( T rElem ) { Append( rElem ); } \
- T Top( sal_uInt16 nLevel = 0 ) const \
- { return (*this)[Count()-nLevel-1]; } \
- T Bottom() const { return (*this)[0]; } \
- T Pop() \
- { T aRet = (*this)[Count()-1]; \
- Remove( Count()-1, 1 ); \
- return aRet; \
- } \
- T* operator*() \
- { return &(*this)[Count()-1]; } \
- void Clear() { ARR##arr_::Clear(); } \
- sal_Bool Contains( const T pItem ) const \
- { return ARR##arr_::Contains( pItem ); } \
-}
-
-#endif
-
-/* vim:set shiftwidth=4 softtabstop=4 expandtab: */