Paul Davis
449aab3c46
git-svn-id: svn://localhost/ardour2/branches/3.0@3435 d708f5d6-7413-0410-9779-e7cbd77b26cf
49 lines
1.3 KiB
C++
49 lines
1.3 KiB
C++
/*
|
|
Copyright (C) 2006 Paul Davis
|
|
|
|
This program 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.
|
|
|
|
This program 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., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
$Id: insert.cc 712 2006-07-28 01:08:57Z drobilla $
|
|
*/
|
|
|
|
#define __STDC_LIMIT_MACROS 1
|
|
#include <stdint.h>
|
|
#include <ardour/chan_count.h>
|
|
|
|
namespace ARDOUR {
|
|
|
|
// infinite/zero chan count stuff, for setting minimums and maximums, etc.
|
|
// FIXME: implement this in a less fugly way
|
|
|
|
ChanCount
|
|
infinity_factory()
|
|
{
|
|
ChanCount ret;
|
|
|
|
for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
|
|
ret.set(*t, UINT32_MAX);
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
|
|
|
|
// Statics
|
|
const ChanCount ChanCount::INFINITE = infinity_factory();
|
|
const ChanCount ChanCount::ZERO = ChanCount();
|
|
|
|
|
|
} // namespace ARDOUR
|