[go: up one dir, main page]

Menu

[r3]: / vposition.h  Maximize  Restore  History

Download this file

101 lines (78 with data), 2.5 kB

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
/*
Copyright (C) 2011 Arnaud Champenois arthelion92@gmail.com
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 3 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, see <http://www.gnu.org/licenses/>.
*/
#ifndef VPOSITION_H
#define VPOSITION_H
#include <stdint.h>
struct VPosition
{
VPosition()
{
mMsPos = mFilePos = -1;
}
VPosition(int64_t aMsPos, int64_t aFilePos)
{
mMsPos = aMsPos;
mFilePos = aFilePos;
}
int64_t mMsPos; // Position time
int64_t mFilePos; // Position in file
};
inline bool operator<(const VPosition&a,const VPosition&b)
{
if(a.mMsPos<b.mMsPos) return true;
else return false;
}
inline bool operator>(const VPosition&a,const VPosition&b)
{
if(a.mMsPos>b.mMsPos) return true;
else return false;
}
inline bool operator<=(const VPosition&a,const VPosition&b)
{
if(a.mMsPos<b.mMsPos) return true;
else return false;
}
inline bool operator>=(const VPosition&a,const VPosition&b)
{
if(a.mMsPos>b.mMsPos) return true;
else return false;
}
inline bool operator==(const VPosition&a,const VPosition&b)
{
if(a.mMsPos==b.mMsPos) return true;
else return false;
}
inline VPosition operator*(const VPosition&a,int aValue)
{ return VPosition(a.mMsPos*aValue,a.mFilePos*aValue); }
inline VPosition operator+(const VPosition&a,const VPosition&b)
{
return VPosition(a.mMsPos+b.mMsPos,a.mFilePos+b.mFilePos);
}
inline VPosition &operator+=(VPosition&a,const VPosition&b)
{
a.mMsPos += b.mMsPos;
a.mFilePos += b.mFilePos;
return a;
}
inline VPosition &operator-=(VPosition&a,const VPosition&b)
{
a.mMsPos -= b.mMsPos;
a.mFilePos -= b.mFilePos;
return a;
}
inline VPosition operator-(const VPosition&a,const VPosition&b)
{
return VPosition(a.mMsPos-b.mMsPos,a.mFilePos-b.mFilePos);
}
#endif // VPOSITION_H