Generated on Thu Mar 22 10:39:42 2012 for Gecode by doxygen 1.6.3

archive.cpp

Go to the documentation of this file.
00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
00002 /*
00003  *  Main authors:
00004  *     Guido Tack <tack@gecode.org>
00005  *
00006  *  Copyright:
00007  *     Guido Tack, 2011
00008  *
00009  *  Last modified:
00010  *     $Date: 2011-05-11 12:44:17 +0200 (Wed, 11 May 2011) $ by $Author: tack $
00011  *     $Revision: 12001 $
00012  *
00013  *  This file is part of Gecode, the generic constraint
00014  *  development environment:
00015  *     http://www.gecode.org
00016  *
00017  *  Permission is hereby granted, free of charge, to any person obtaining
00018  *  a copy of this software and associated documentation files (the
00019  *  "Software"), to deal in the Software without restriction, including
00020  *  without limitation the rights to use, copy, modify, merge, publish,
00021  *  distribute, sublicense, and/or sell copies of the Software, and to
00022  *  permit persons to whom the Software is furnished to do so, subject to
00023  *  the following conditions:
00024  *
00025  *  The above copyright notice and this permission notice shall be
00026  *  included in all copies or substantial portions of the Software.
00027  *
00028  *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
00029  *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
00030  *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00031  *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
00032  *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
00033  *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
00034  *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
00035  *
00036  */
00037 
00038 #include <gecode/kernel.hh>
00039 
00040 namespace Gecode {
00041 
00042   void
00043   Archive::resize(int n) {
00044     int m = std::max(n+1, (3*_size)/2);
00045     _a = heap.realloc<unsigned int>(_a,_n,m);
00046     _size = m;
00047   }
00048   
00049   Archive::Archive(const Archive& e) : _size(e._n), _n(e._n), _pos(e._pos) {
00050     _a = heap.alloc<unsigned int>(_n);
00051     heap.copy<unsigned int>(_a,e._a,_n);
00052   }
00053   
00054   Archive&
00055   Archive::operator =(const Archive& e) {
00056     if (this!=&e) {
00057       _a = heap.realloc<unsigned int>(_a, _size, e._n);
00058       heap.copy<unsigned int>(_a,e._a,e._n);
00059       _size = _n = e._n;
00060     }
00061     return *this;
00062   }
00063   
00064   Archive::~Archive(void) {
00065     heap.free<unsigned int>(_a,_size);
00066   }
00067 
00068 }
00069 
00070 // STATISTICS: kernel-branch