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