array.hpp
Go to the documentation of this file.
00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 00002 /* 00003 * Main authors: 00004 * Christian Schulte <schulte@gecode.org> 00005 * 00006 * Copyright: 00007 * Christian Schulte, 2005 00008 * 00009 * Last modified: 00010 * $Date: 2010-10-04 10:01:21 +0200 (Mon, 04 Oct 2010) $ by $Author: schulte $ 00011 * $Revision: 11440 $ 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 namespace Gecode { 00039 00040 /* 00041 * Implementation 00042 * 00043 */ 00044 00045 forceinline 00046 IntArgs::IntArgs(void) : PrimArgArray<int>(0) {} 00047 00048 forceinline 00049 IntArgs::IntArgs(int n) : PrimArgArray<int>(n) {} 00050 00051 forceinline 00052 IntArgs::IntArgs(const SharedArray<int>& x) 00053 : PrimArgArray<int>(x.size()) { 00054 for (int i=x.size(); i--;) 00055 a[i] = x[i]; 00056 } 00057 forceinline 00058 IntArgs::IntArgs(const std::vector<int>& x) 00059 : PrimArgArray<int>(static_cast<int>(x.size())) { 00060 for (unsigned int i=x.size(); i--;) 00061 a[i] = x[i]; 00062 } 00063 00064 forceinline 00065 IntArgs::IntArgs(int n, const int* e) : PrimArgArray<int>(n, e) {} 00066 00067 forceinline 00068 IntArgs::IntArgs(const PrimArgArray<int>& a) : PrimArgArray<int>(a) {} 00069 00070 forceinline IntArgs 00071 IntArgs::create(int n, int start, int inc) { 00072 IntArgs r(n); 00073 for (int i=0; i<n; i++, start+=inc) 00074 r[i] = start; 00075 return r; 00076 } 00077 00078 forceinline 00079 IntVarArray::IntVarArray(void) {} 00080 00081 forceinline 00082 IntVarArray::IntVarArray(Space& home, int n) 00083 : VarArray<IntVar>(home,n) {} 00084 00085 forceinline 00086 IntVarArray::IntVarArray(const IntVarArray& a) 00087 : VarArray<IntVar>(a) {} 00088 00089 forceinline 00090 IntVarArray::IntVarArray(Space& home, const IntVarArgs& a) 00091 : VarArray<IntVar>(home,a) {} 00092 00093 00094 forceinline 00095 BoolVarArray::BoolVarArray(void) {} 00096 00097 forceinline 00098 BoolVarArray::BoolVarArray(Space& home, int n) 00099 : VarArray<BoolVar>(home,n) {} 00100 00101 forceinline 00102 BoolVarArray::BoolVarArray(const BoolVarArray& a) 00103 : VarArray<BoolVar>(a) {} 00104 00105 forceinline 00106 BoolVarArray::BoolVarArray(Space& home, const BoolVarArgs& a) 00107 : VarArray<BoolVar>(home,a) {} 00108 00109 } 00110 00111 // STATISTICS: int-other