1 files changed, 143 insertions, 0 deletions
diff --git a/include/comphelper/InlineContainer.hxx b/include/comphelper/InlineContainer.hxx
new file mode 100644
index 000000000000..b23574bbad58
--- /dev/null
+++ b/include/comphelper/InlineContainer.hxx
@@ -0,0 +1,143 @@
+/* -*- 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 INCLUDED_COMPHELPER_INLINE_CONTAINER_HXX
+#define INCLUDED_COMPHELPER_INLINE_CONTAINER_HXX
+
+#include <com/sun/star/uno/Sequence.hxx>
+
+#include <vector>
+#include <map>
+#include <set>
+
+namespace comphelper
+{
+
+/** Creates a UNO-Sequence which contains an arbitrary number of elements.
+    Notice, that every call of the operator() issues a realloc, so this is not
+    suitable to create very large sequences.
+
+    usage:
+
+    uno::Sequence< t >( MakeSequence< t >( t_1 )( t_2 )...( t_n ) );
+ */
+template < typename T >
+class MakeSequence : public ::com::sun::star::uno::Sequence< T >
+{
+public:
+    explicit MakeSequence(const T &a)
+        : ::com::sun::star::uno::Sequence< T >( 1 )
+    {
+        this->operator[](0) = a;
+    }
+    MakeSequence& operator()(const T &a)
+    {
+        this->realloc( this->getLength() + 1 );
+        this->operator[]( this->getLength() - 1 ) = a;
+        return *this;
+    }
+};
+
+// ----------------------------------------
+
+/** Creates a vector which contains an arbitrary number of elements.
+
+    usage:
+
+    vector< t > aVec( MakeVector< t >( t_1 )( t_2 )...( t_n ) );
+ */
+template < typename T >
+class MakeVector : public ::std::vector< T >
+{
+public:
+    explicit MakeVector(const T &a)
+        : ::std::vector< T >(1, a)
+    {
+    }
+    MakeVector &operator()(const T &a)
+    {
+        this->push_back(a);
+        return *this;
+    }
+};
+
+// ----------------------------------------
+
+/** Creates a set which contains an arbitrary number of elements.
+
+    usage:
+
+    set< t > aSet( MakeSet< t >( t_1 )( t_2 )...( t_n ) );
+ */
+template < typename T >
+class MakeSet : public ::std::set< T >
+{
+public:
+    explicit MakeSet(const T &a)
+        : ::std::set< T >()
+    {
+        this->insert(this->end(), a);
+    }
+    MakeSet &operator()(const T &a)
+    {
+        this->insert(this->end(), a);
+        return *this;
+    }
+};
+
+// ----------------------------------------
+
+/** usage:
+
+    map< k, v > aMap( MakeMap< k, v >
+    ( key_1, value_1 )
+    ( key_2, value_2 )
+    ( key_3, value_3 )
+    ...
+    ( key_n, value_n )
+    );
+ */
+template < typename Key, typename Value >
+class MakeMap : public ::std::map< Key, Value >
+{
+private:
+    typedef typename ::std::map< Key, Value >::value_type value_type;
+public:
+    explicit MakeMap( const Key &k, const Value &v )
+    {
+        this->insert( value_type( k, v ) );
+    }
+    MakeMap &operator()( const Key &k, const Value &v )
+    {
+        this->insert( value_type( k, v ) );
+        return *this;
+    }
+
+    MakeMap &operator()( const MakeMap& rSource )
+    {
+        this->insert(rSource.begin(),rSource.end());
+        return *this;
+    }
+};
+
+} // namespace comphelper
+
+#endif
+// INCLUDED_COMPHELPER_INLINE_CONTAINER_HXX
+
+/* vim:set shiftwidth=4 softtabstop=4 expandtab: */