2 Copyright (C) 2002-2010 Paul Davis
4 This program is free software; you can redistribute it and/or modify it
5 under the terms of the GNU Lesser General Public License as published by
6 the Free Software Foundation; either version 2 of the License, or (at your
7 option) any later version.
9 This program is distributed in the hope that it will be useful, but WITHOUT
10 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
12 License for more details.
14 You should have received a copy of the GNU Lesser General Public License
15 along with this program; if not, write to the Free Software Foundation,
16 Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
22 #include "timecode/bbt_time.h"
24 using namespace Timecode;
26 /* This number doesn't describe the smallest division of a "beat" (which is
27 only defined contextually anyway), but rather the smallest division of the the
28 divisions of a bar. If using a meter of 4/8, there are 4 divisions per bar, and
29 we can divide each one into ticks_per_bar_division pieces; in a separate meter
30 (section) of 3/8, there are 3 divisions per bar, each of which can be divided
31 into ticks_per_bar_division pieces.
33 The number is intended to have as many integer factors as possible so that
34 1/Nth divisions are integer numbers of ticks.
36 1920 is the largest legal value that be used inside an SMF file, and has many factors.
39 const double BBT_Time::ticks_per_bar_division = 1920.0;
41 BBT_Time::BBT_Time (double dbeats)
43 /* NOTE: this does not construct a BBT time in a canonical form,
44 in that beats may be a very large number, and bars will
51 beats = rint (floor (dbeats));
52 ticks = rint (floor (BBT_Time::ticks_per_bar_division * fmod (dbeats, 1.0)));