Sponsored Content
The Lounge What is on Your Mind? Bits Under Development: Forum Activity Index (FAI) Post 302328583 by Neo on Wednesday 24th of June 2009 05:39:43 PM
Old 06-24-2009
Bits Under Development: Forum Activity Index (FAI)

Working on some "new forum virtual economics" I have taken the total number of Bits in Circulation (user checking + savings) and divided that by the total number of posts, and have called this (for a lack of better name), the Forum Activity Index (FAI).

You can now see this index on your banking page.

Next, I am thinking to take the total Bits in Circulation (as above) and divide by the number of members who have posted, but I need to think more about this.

If you have any ideas, please do post them.

Right now, the FAI is 2,333 User Bits / Post ....

But I am not sure what it means Smilie

---------- Post updated at 21:39 ---------- Previous update was at 20:49 ----------

One problem I thought of right away is that the central bits bank has been reclaiming bits from users who are inactive for over two years. This means that the FAI is lower than it should be if all the inactive user bits were in circulation.....

hmmmmm Smilie
These 3 Users Gave Thanks to Neo For This Post:
 

7 More Discussions You Might Find Interesting

1. Filesystems, Disks and Memory

why the inode index of file system starts from 1 unlike array index(0)

why do inode indices starts from 1 unlike array indexes which starts from 0 its a question from "the design of unix operating system" of maurice j bach id be glad if i get to know the answer quickly :) (0 Replies)
Discussion started by: sairamdevotee
0 Replies

2. UNIX for Dummies Questions & Answers

wh inode index starts from 1 unlike array index (0)

brothers why inode index starts from 1 unlike array inex which starts from 0 its a question from the design of unix operating system of maurice j.bach i need to know the answer urgently...someone help please (1 Reply)
Discussion started by: sairamdevotee
1 Replies

3. Shell Programming and Scripting

Sort from start index and end index in line

Hi All, I have a file (FileNames.txt) which contains the following data in it. $ cat FileNames.txt MYFILE17XXX208Sep191307.csv MYFILE19XXX208Sep192124.csv MYFILE20XXX208Sep192418.csv MYFILE22XXX208Sep193234.csv MYFILE21XXX208Sep193018.csv MYFILE24XXX208Sep194053.csv... (5 Replies)
Discussion started by: krish_indus
5 Replies

4. What is on Your Mind?

What exactly is the concept of BITS in this unix.com forum?

Is there a detailed page on the explanation of concept behind BITS and score used in this forum. Just saw the index on my Banking page. (Clicked the Banking hyperlink below my profile name on the topmost right corner of this screen) Thanks in advance. (2 Replies)
Discussion started by: Manjunath B
2 Replies

5. What is on Your Mind?

Place Bits & Win Bits!!! - 17th Annual Satellite Awards

Ten movies have been nominated as best motion picture by the International Press Academy, presentation of the 2012 Satellite Awards will be held on 16th December at Los Angeles, CA. Place your bits here on one of the below nominated movie of your choice:- Argo ... (0 Replies)
Discussion started by: Yoda
0 Replies

6. What is on Your Mind?

Updated Forum Search Index Min Word Length (Again)

For some reason, three char word lengths were not showing up in search results, even though the minimum is set to three and has been for a long time. After monkeying around with this, I turned off full page search, dumped all search indexes, and re-enabled full text search and it's working... (1 Reply)
Discussion started by: Neo
1 Replies

7. What is on Your Mind?

Updated Forum Search Index Min Word Length to 2 Chars and Added Quick Search Bar

Today I changed the forum mysql database to permit 2 letter searches: ft_min_word_len=2 I rebuilt the mysql search indexes as well. Then, I added a "quick search bar" at the top of each page. I have tested this and two letter searches are working; but it's not perfect,... (1 Reply)
Discussion started by: Neo
1 Replies
QBitArray(3qt)															    QBitArray(3qt)

NAME
QBitArray - Array of bits SYNOPSIS
All the functions in this class are reentrant when Qt is built with thread support.</p> #include <qbitarray.h> Inherits QByteArray. Public Members QBitArray () QBitArray ( uint size ) QBitArray ( const QBitArray & a ) QBitArray & operator= ( const QBitArray & a ) uint size () const bool resize ( uint size ) bool fill ( bool v, int size = -1 ) virtual void detach () QBitArray copy () const bool testBit ( uint index ) const void setBit ( uint index ) void setBit ( uint index, bool value ) void clearBit ( uint index ) bool toggleBit ( uint index ) bool at ( uint index ) const QBitVal operator[] ( int index ) bool operator[] ( int index ) const QBitArray & operator&= ( const QBitArray & a ) QBitArray & operator|= ( const QBitArray & a ) QBitArray & operator^= ( const QBitArray & a ) QBitArray operator~ () const RELATED FUNCTION DOCUMENTATION
QBitArray operator& ( const QBitArray & a1, const QBitArray & a2 ) QBitArray operator| ( const QBitArray & a1, const QBitArray & a2 ) QBitArray operator^ ( const QBitArray & a1, const QBitArray & a2 ) QDataStream & operator<< ( QDataStream & s, const QBitArray & a ) QDataStream & operator>> ( QDataStream & s, QBitArray & a ) DESCRIPTION
The QBitArray class provides an array of bits. Because QBitArray is a QMemArray, it uses explicit sharing with a reference count. A QBitArray is a special byte array that can access individual bits and perform bit-operations (AND, OR, XOR and NOT) on entire arrays or bits. Bits can be manipulated by the setBit() and clearBit() functions, but it is also possible to use the indexing [] operator to test and set individual bits. The [] operator is a little slower than setBit() and clearBit() because some tricks are required to implement single-bit assignments. Example: QBitArray a(3); a.setBit( 0 ); a.clearBit( 1 ); a.setBit( 2 ); // a = [1 0 1] QBitArray b(3); b[0] = 1; b[1] = 1; b[2] = 0; // b = [1 1 0] QBitArray c; c = ~a & b; // c = [0 1 0] When a QBitArray is constructed the bits are uninitialized. Use fill() to set all the bits to 0 or 1. The array can be resized with resize() and copied with copy(). Bits can be set with setBit() and cleared with clearBit(). Bits can be toggled with toggleBit(). A bit's value can be obtained with testBit() and with at(). QBitArray supports the & (AND), | (OR), ^ (XOR) and ~ (NOT) operators. See also Collection Classes, Implicitly and Explicitly Shared Classes, and Non-GUI Classes. MEMBER FUNCTION DOCUMENTATION
QBitArray::QBitArray () Constructs an empty bit array. QBitArray::QBitArray ( uint size ) Constructs a bit array of size bits. The bits are uninitialized. See also fill(). QBitArray::QBitArray ( const QBitArray & a ) Constructs a shallow copy of a. bool QBitArray::at ( uint index ) const Returns the value (0 or 1) of the bit at position index. See also operator[](). void QBitArray::clearBit ( uint index ) Clears the bit at position index, i.e. sets it to 0. See also setBit() and toggleBit(). QBitArray QBitArray::copy () const Returns a deep copy of the bit array. See also detach(). void QBitArray::detach () [virtual] Detaches from shared bit array data and makes sure that this bit array is the only one referring to the data. If multiple bit arrays share common data, this bit array dereferences the data and gets a copy of the data. Nothing happens if there is only a single reference. See also copy(). Reimplemented from QMemArray. bool QBitArray::fill ( bool v, int size = -1 ) Fills the bit array with v (1's if v is TRUE, or 0's if v is FALSE). fill() resizes the bit array to size bits if size is nonnegative. Returns FALSE if a nonnegative size was specified and the bit array could not be resized; otherwise returns TRUE. See also resize(). QBitArray &; QBitArray::operator&= ( const QBitArray & a ) Performs the AND operation between all bits in this bit array and a. Returns a reference to this bit array. The result has the length of the longest of the two bit arrays, with any missing bits (i.e. if one array is shorter than the other), taken to be 0. QBitArray a( 3 ), b( 2 ); a[0] = 1; a[1] = 0; a[2] = 1; // a = [1 0 1] b[0] = 1; b[1] = 0; // b = [1 0] a &= b; // a = [1 0 0] See also operator|=(), operator^=(), and operator~(). QBitArray &; QBitArray::operator= ( const QBitArray & a ) Assigns a shallow copy of a to this bit array and returns a reference to this array. QBitVal QBitArray::operator[] ( int index ) Implements the [] operator for bit arrays. The returned QBitVal is a context object. It makes it possible to get and set a single bit value by its index position. Example: QBitArray a( 3 ); a[0] = 0; a[1] = 1; a[2] = a[0] ^ a[1]; The functions testBit(), setBit() and clearBit() are faster. See also at(). bool QBitArray::operator[] ( int index ) const This is an overloaded member function, provided for convenience. It behaves essentially like the above function. Implements the [] operator for constant bit arrays. QBitArray &; QBitArray::operator^= ( const QBitArray & a ) Performs the XOR operation between all bits in this bit array and a. Returns a reference to this bit array. The result has the length of the longest of the two bit arrays, with any missing bits (i.e. if one array is shorter than the other), taken to be 0. QBitArray a( 3 ), b( 2 ); a[0] = 1; a[1] = 0; a[2] = 1; // a = [1 0 1] b[0] = 1; b[1] = 0; // b = [1 0] a ^= b; // a = [0 0 1] See also operator&=(), operator|=(), and operator~(). QBitArray &; QBitArray::operator|= ( const QBitArray & a ) Performs the OR operation between all bits in this bit array and a. Returns a reference to this bit array. The result has the length of the longest of the two bit arrays, with any missing bits (i.e. if one array is shorter than the other), taken to be 0. QBitArray a( 3 ), b( 2 ); a[0] = 1; a[1] = 0; a[2] = 1; // a = [1 0 1] b[0] = 1; b[1] = 0; // b = [1 0] a |= b; // a = [1 0 1] See also operator&=(), operator^=(), and operator~(). QBitArray QBitArray::operator~ () const Returns a bit array that contains the inverted bits of this bit array. Example: QBitArray a( 3 ), b; a[0] = 1; a[1] = 0; a[2] = 1; // a = [1 0 1] b = ~a; // b = [0 1 0] bool QBitArray::resize ( uint size ) Resizes the bit array to size bits and returns TRUE if the bit array could be resized; otherwise returns FALSE. The array becomes a null array if size == 0. If the array is expanded, the new bits are set to 0. See also size(). void QBitArray::setBit ( uint index, bool value ) Sets the bit at position index to value. Equivalent to: if ( value ) setBit( index ); else clearBit( index ); See also clearBit() and toggleBit(). void QBitArray::setBit ( uint index ) This is an overloaded member function, provided for convenience. It behaves essentially like the above function. Sets the bit at position index to 1. See also clearBit() and toggleBit(). uint QBitArray::size () const Returns the bit array's size (number of bits). See also resize(). bool QBitArray::testBit ( uint index ) const Returns TRUE if the bit at position index is set, i.e. is 1; otherwise returns FALSE. See also setBit() and clearBit(). bool QBitArray::toggleBit ( uint index ) Toggles the bit at position index. If the previous value was 0, the new value will be 1. If the previous value was 1, the new value will be 0. See also setBit() and clearBit(). RELATED FUNCTION DOCUMENTATION
QBitArray operator&; ( const QBitArray & a1, const QBitArray & a2 ) Returns the AND result between the bit arrays a1 and a2. The result has the length of the longest of the two bit arrays, with any missing bits (i.e. if one array is shorter than the other), taken to be 0. See also QBitArray::operator&=(). QDataStream &; operator<< ( QDataStream & s, const QBitArray & a ) Writes bit array a to stream s. See also Format of the QDataStream operators. QDataStream &; operator>> ( QDataStream & s, QBitArray & a ) Reads a bit array into a from stream s. See also Format of the QDataStream operators. QBitArray operator^ ( const QBitArray & a1, const QBitArray & a2 ) Returns the XOR result between the bit arrays a1 and a2. The result has the length of the longest of the two bit arrays, with any missing bits (i.e. if one array is shorter than the other), taken to be 0. See also QBitArray::operator^(). QBitArray operator| ( const QBitArray & a1, const QBitArray & a2 ) Returns the OR result between the bit arrays a1 and a2. The result has the length of the longest of the two bit arrays, with any missing bits (i.e. if one array is shorter than the other), taken to be 0. See also QBitArray::operator|=(). SEE ALSO
http://doc.trolltech.com/qbitarray.html http://www.trolltech.com/faq/tech.html COPYRIGHT
Copyright 1992-2001 Trolltech AS, http://www.trolltech.com. See the license file included in the distribution for a complete license statement. AUTHOR
Generated automatically from the source code. BUGS
If you find a bug in Qt, please report it as described in http://doc.trolltech.com/bughowto.html. Good bug reports help us to help you. Thank you. The definitive Qt documentation is provided in HTML format; it is located at $QTDIR/doc/html and can be read using Qt Assistant or with a web browser. This man page is provided as a convenience for those users who prefer man pages, although this format is not officially supported by Trolltech. If you find errors in this manual page, please report them to qt-bugs@trolltech.com. Please include the name of the manual page (qbitarray.3qt) and the Qt version (3.1.1). Trolltech AS 9 December 2002 QBitArray(3qt)
All times are GMT -4. The time now is 09:00 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy