switch to new MPL based Fraunhofer FOKUS Public License

[senf.git] / senf / Utils / Termlib / Terminfo.cc

diff --git a/senf/Utils/Termlib/Terminfo.cc b/senf/Utils/Termlib/Terminfo.cc
index 44bdb6f..2b39754 100644 (file)
--- a/senf/Utils/Termlib/Terminfo.cc
+++ b/senf/Utils/Termlib/Terminfo.cc
@@ -1,24 +1,29 @@
 // $Id$
 //
-// Copyright (C) 2009 
+// Copyright (C) 2009
 // Fraunhofer Institute for Open Communication Systems (FOKUS)
-// Competence Center NETwork research (NET), St. Augustin, GERMANY
-//     Stefan Bund <g0dil@berlios.de>
 //
-// This program is free software; you can redistribute it and/or modify
-// it under the terms of the GNU General Public License as published by
-// the Free Software Foundation; either version 2 of the License, or
-// (at your option) any later version.
+// The contents of this file are subject to the Fraunhofer FOKUS Public License
+// Version 1.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://senf.berlios.de/license.html
 //
-// This program 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 General Public License for more details.
+// The Fraunhofer FOKUS Public License Version 1.0 is based on, 
+// but modifies the Mozilla Public License Version 1.1.
+// See the full license text for the amendments.
 //
-// You should have received a copy of the GNU General Public License
-// along with this program; if not, write to the
-// Free Software Foundation, Inc.,
-// 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
+// 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 Fraunhofer FOKUS code.
+//
+// The Initial Developer of the Original Code is Fraunhofer-Gesellschaft e.V. 
+// (registered association), Hansastraße 27 c, 80686 Munich, Germany.
+// All Rights Reserved.
+//
+// Contributor(s):
+//   Stefan Bund <g0dil@berlios.de>
 
 /** \file
     \brief Terminfo non-inline non-template implementation */
@@ -37,7 +42,7 @@
 
 //#include "Terminfo.mpp"
 #define prefix_
-///////////////////////////////cc.p////////////////////////////////////////
+//-/////////////////////////////////////////////////////////////////////////////////////////////////
 
 char const * const senf::term::Terminfo::properties::BooleanNames [] = {
     "AutoLeftMargin", "AutoRightMargin", "NoEscCtlc", "CeolStandoutGlitch", "EatNewlineGlitch",
@@ -126,7 +131,7 @@ char const * const senf::term::Terminfo::properties::StringNames[] = {
      "AcsUlcorner", "AcsLlcorner", "AcsUrcorner", "AcsLrcorner", "AcsLtee", "AcsRtee", "AcsBtee",
      "AcsTtee", "AcsHline", "AcsVline", "AcsPlus", "MemoryLock", "MemoryUnlock", "BoxChars1" };
 
-///////////////////////////////////////////////////////////////////////////
+//-/////////////////////////////////////////////////////////////////////////////////////////////////
 // senf::term::Terminfo
 
 prefix_ senf::term::Terminfo::Terminfo()
@@ -194,13 +199,13 @@ namespace {
     {
         std::vector<senf::term::Terminfo::number_t> stack;
 
-        void push(senf::term::Terminfo::number_t v) 
+        void push(senf::term::Terminfo::number_t v)
             {
                 stack.push_back(v);
             }
 
-        senf::term::Terminfo::number_t pop() 
-            { 
+        senf::term::Terminfo::number_t pop()
+            {
                 if (stack.empty())
                     return 0;
                 else {
@@ -282,11 +287,11 @@ prefix_ std::string senf::term::Terminfo::formatString(properties::String p,
         case '~': stack.push(~stack.pop()); break;
         case 't': bCondValue = stack.pop();
         case 'e': if ((bCondValue = !bCondValue)) // this also supports elsif
-            --(i = prgstr.begin() + std::min (prgstr.find ("%e", i-prgstr.begin()), 
+            --(i = prgstr.begin() + std::min (prgstr.find ("%e", i-prgstr.begin()),
                                               prgstr.find ("%;", i-prgstr.begin())));
         case '?':
         case ';': break;
-        case 'p': 
+        case 'p':
             switch (*++i) {
             case '1': stack.push(arg1); break;
             case '2': stack.push(arg2); break;
@@ -338,7 +343,7 @@ prefix_ std::string senf::term::Terminfo::formatString(properties::String p,
          NumberVec::const_iterator i (numbers_.begin());
          NumberVec::const_iterator const i_end (numbers_.end());
          for (; i != i_end; ++i, ++n)
-             if (*i != NoValue 
+             if (*i != NoValue
                  && n < sizeof(properties::NumericNames)/sizeof(properties::NumericNames[0]))
                  os << "    " << properties::NumericNames[n] << " = " << *i << "\n";
      }
@@ -424,7 +429,7 @@ prefix_ void senf::term::Terminfo::load(std::istream & is)
     }
     if (booleans_.size() & 1)
         is.ignore(1u);
-    
+
     numbers_.resize(h.nNumbers);
     for (NumberVec::iterator i (numbers_.begin()); i != numbers_.end(); ++i) {
         number_t v;
@@ -442,7 +447,7 @@ prefix_ void senf::term::Terminfo::load(std::istream & is)
         if (!is) throw InvalidTerminfoException();
         *i = v;
     }
-    
+
     stringPool_.resize(h.stringPoolSz);
     is.read(&(stringPool_[0]), stringPool_.size());
     if (!is) throw InvalidTerminfoException();
@@ -456,7 +461,7 @@ prefix_ void senf::term::Terminfo::load(std::istream & is)
             *j = 0;
 }
 
-///////////////////////////////////////////////////////////////////////////
+//-/////////////////////////////////////////////////////////////////////////////////////////////////
 // senf::term::KeyParser
 
 char const * const senf::term::KeyParser::KeyNames[] = {
@@ -561,7 +566,7 @@ senf::term::KeyParser::lookup(std::string const & key)
     if (key.empty())
         return std::make_pair(KeyCode(0), 0);
 
-    // There are several cases: 
+    // There are several cases:
     // a) 'key' is an incomplete key sequence. In this case, 'key' will precede all completions in
     //    the key table. The first possible completion is found by 'upper_bound'
     // b) 'key' is a complete key sequence. This is the key sequence *preceding* the 'upper_bound'
@@ -605,7 +610,7 @@ prefix_ void senf::term::KeyParser::dump(std::ostream & os)
     }
 }
 
-///////////////////////////////cc.e////////////////////////////////////////
+//-/////////////////////////////////////////////////////////////////////////////////////////////////
 #undef prefix_
 //#include "Terminfo.mpp"