diff options
author | toma <toma@283d02a7-25f6-0310-bc7c-ecb5cbfe19da> | 2009-11-25 17:56:58 +0000 |
---|---|---|
committer | toma <toma@283d02a7-25f6-0310-bc7c-ecb5cbfe19da> | 2009-11-25 17:56:58 +0000 |
commit | 460c52653ab0dcca6f19a4f492ed2c5e4e963ab0 (patch) | |
tree | 67208f7c145782a7e90b123b982ca78d88cc2c87 /libkmime/boolflags.cpp | |
download | tdepim-460c52653ab0dcca6f19a4f492ed2c5e4e963ab0.tar.gz tdepim-460c52653ab0dcca6f19a4f492ed2c5e4e963ab0.zip |
Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features.
BUG:215923
git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdepim@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
Diffstat (limited to 'libkmime/boolflags.cpp')
-rw-r--r-- | libkmime/boolflags.cpp | 61 |
1 files changed, 61 insertions, 0 deletions
diff --git a/libkmime/boolflags.cpp b/libkmime/boolflags.cpp new file mode 100644 index 000000000..2110acbde --- /dev/null +++ b/libkmime/boolflags.cpp @@ -0,0 +1,61 @@ +/* + boolflags.cpp + + KNode, the KDE newsreader + Copyright (c) 1999-2001 the KNode authors. + See file AUTHORS for details + + 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. + 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, US +*/ + +#include "boolflags.h" + +void BoolFlags::set(unsigned int i, bool b) +{ + if(i>15) return; + + unsigned char p; //bitmask + int n; + + if(i<8) { //first byte + p=(1 << i); + n=0; + } + else { //second byte + p=(1 << ( i-8 )); + n=1; + } + + if(b) + bits[n] = bits[n] | p; + else + bits[n] = bits[n] & (255-p); +} + + +bool BoolFlags::get(unsigned int i) +{ + if(i>15) return false; + + unsigned char p; //bitmask + int n; + + if(i<8) { //first byte + p=(1 << i); + n=0; + } + else { //second byte + p=(1 << i-8); + n=1; + } + + return ( (bits[n] & p)>0 ); +} + + |