Nemo
2.3.56
Simulate forward-in-time genetic evolution in a spatially explicit, individual-based stochastic simulator
|
#include <bitset>
#include <assert.h>
#include <limits.h>
#include <string.h>
#include <iostream>
Go to the source code of this file.
Classes | |
class | bitstring |
Non-template and faster implementation of std::bitset. More... | |
class | bitstring::reference |
Macros | |
#define | BITS_PER_WORD (CHAR_BIT*sizeof(unsigned long)) |
#define | BITSET_WORDS(__n) ((__n) < 1 ? 1 : ((__n) + BITS_PER_WORD - 1)/BITS_PER_WORD) |
#define | MASK ULLONG_MAX |
Nemo2
Copyright (C) 2006-2015 Frederic Guillaume frede.nosp@m.ric..nosp@m.guill.nosp@m.aume.nosp@m.@ieu..nosp@m.uzh..nosp@m.ch
This file is part of Nemo
Nemo 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.
Nemo 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.
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
#define BITS_PER_WORD (CHAR_BIT*sizeof(unsigned long)) |
#define BITSET_WORDS | ( | __n | ) | ((__n) < 1 ? 1 : ((__n) + BITS_PER_WORD - 1)/BITS_PER_WORD) |
#define MASK ULLONG_MAX |