PLearn 0.1
ConcatRowsVMatrix.h
Go to the documentation of this file.
00001 // -*- C++ -*-
00002 
00003 // PLearn (A C++ Machine Learning Library)
00004 // Copyright (C) 1998 Pascal Vincent
00005 // Copyright (C) 1999-2001 Pascal Vincent, Yoshua Bengio, Rejean Ducharme and University of Montreal
00006 // Copyright (C) 2002 Pascal Vincent, Julien Keable, Xavier Saint-Mleux
00007 //
00008 // Redistribution and use in source and binary forms, with or without
00009 // modification, are permitted provided that the following conditions are met:
00010 //
00011 //  1. Redistributions of source code must retain the above copyright
00012 //     notice, this list of conditions and the following disclaimer.
00013 //
00014 //  2. Redistributions in binary form must reproduce the above copyright
00015 //     notice, this list of conditions and the following disclaimer in the
00016 //     documentation and/or other materials provided with the distribution.
00017 //
00018 //  3. The name of the authors may not be used to endorse or promote
00019 //     products derived from this software without specific prior written
00020 //     permission.
00021 //
00022 // THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
00023 // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
00024 // OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN
00025 // NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
00026 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
00027 // TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
00028 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
00029 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00030 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00031 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00032 //
00033 // This file is part of the PLearn library. For more information on the PLearn
00034 // library, go to the PLearn Web site at www.plearn.org
00035 
00036 
00037 /* *******************************************************
00038  * $Id: ConcatRowsVMatrix.h 6351 2006-10-25 19:05:45Z chapados $
00039  ******************************************************* */
00040 
00041 
00044 #ifndef ConcatRowsVMatrix_INC
00045 #define ConcatRowsVMatrix_INC
00046 
00047 #include "VMat.h"
00048 
00049 namespace PLearn {
00050 using namespace std;
00051 
00052 class ConcatRowsVMatrix: public VMatrix
00053 {
00054     typedef VMatrix inherited;
00055 
00056 protected:
00058     TVec<VMat> sources;
00059 
00063     TVec<VMat> to_concat;
00064 
00068     bool need_fix_mappings;
00069 
00074     TMat< map<real, real> > fixed_mappings;
00075 
00076 public:
00077 
00078     bool fill_missing;
00079     bool fully_check_mappings;
00080     bool only_common_fields;
00081 
00084     ConcatRowsVMatrix(TVec<VMat> the_sources = TVec<VMat>());
00085     ConcatRowsVMatrix(VMat d1, VMat d2, bool fully_check_mappings = false);
00086 
00087     virtual real get(int i, int j) const;
00088     virtual void getSubRow(int i, int j, Vec v) const;
00089 
00090     virtual void reset_dimensions();
00091 
00092     virtual real dot(int i1, int i2, int inputsize) const;
00093     virtual real dot(int i, const Vec& v) const;
00094     virtual void putMat(int i, int j, Mat m);
00095 
00096     PLEARN_DECLARE_OBJECT(ConcatRowsVMatrix);
00097     virtual void build();
00098 
00100     virtual void makeDeepCopyFromShallowCopy(CopiesMap& copies);
00101 
00102 protected:
00107     inline void getpositions(int i, int& whichvm, int& rowofvm) const;
00108 
00109     static void declareOptions(OptionList &ol);
00110 
00111 private:
00112 
00113     void build_();
00114 
00118     void ensureMappingsConsistency();
00119 
00122     void fullyCheckMappings(bool report_progress = true);
00123 
00125     void findAllFields();
00126 
00129     void findCommonFields();
00130 
00133     void recomputeDimensions();
00134 
00136     void getPositionsAux(int i, int& whichvm, int& rowofvm) const;
00137 
00138 private:
00140     mutable int m_last_vmat_index;
00141 
00144     mutable int m_last_vmat_startrow;
00145 
00148     mutable int m_last_vmat_lastrow;
00149 };
00150 
00151 DECLARE_OBJECT_PTR(ConcatRowsVMatrix);
00152 
00153 inline VMat vconcat(VMat d1, VMat d2)
00154 { return new ConcatRowsVMatrix(d1,d2); }
00155 
00156 inline VMat vconcat(TVec<VMat> ds) {
00157     if (ds.size() == 1) {
00158         // Only one matrix: no need to use a ConcatRowsVMatrix.
00159         return ds[0];
00160     } else {
00161         return new ConcatRowsVMatrix(ds);
00162     }
00163 }
00164 
00166 // getpositions //
00168 inline void ConcatRowsVMatrix::getpositions(int i, int& whichvm, int& rowofvm) const
00169 {
00170 #ifdef BOUNDCHECK
00171     if(i<0 || i>=length())
00172         PLERROR("In ConcatRowsVMatrix::getpositions OUT OF BOUNDS");
00173 #endif
00174 
00175     // Start by looking if i belongs to the most-recently-used VMat. If so, no
00176     // need to search for it
00177     if (i >= m_last_vmat_startrow && i <= m_last_vmat_lastrow) {
00178         PLASSERT( m_last_vmat_index >= 0 );
00179         whichvm = m_last_vmat_index;
00180         rowofvm = i - m_last_vmat_startrow;
00181         return;
00182     }
00183 
00184     // Now in cache: perform linear search out-of-line
00185     getPositionsAux(i, whichvm, rowofvm);
00186 }
00187 
00188 
00189 
00190 } // end of namespace PLearn
00191 #endif
00192 
00193 
00194 /*
00195   Local Variables:
00196   mode:c++
00197   c-basic-offset:4
00198   c-file-style:"stroustrup"
00199   c-file-offsets:((innamespace . 0)(inline-open . 0))
00200   indent-tabs-mode:nil
00201   fill-column:79
00202   End:
00203 */
00204 // vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=8:softtabstop=4:encoding=utf-8:textwidth=79 :
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines