diff -r 89c329efa980 -r e48454f237ca hgcacheproxymodel/tsrc/unit/bmhelper.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/hgcacheproxymodel/tsrc/unit/bmhelper.cpp	Mon May 03 13:32:54 2010 +0300
@@ -0,0 +1,95 @@
+/*
+* Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
+* All rights reserved.
+* This component and the accompanying materials are made available
+* under the terms of "Eclipse Public License v1.0"
+* which accompanies this distribution, and is available
+* at the URL "http://www.eclipse.org/legal/epl-v10.html".
+*
+* Initial Contributors:
+* Nokia Corporation - initial contribution.
+*
+* Contributors:
+*
+* Description:
+*
+*  Version     : %version: 1 %
+*/
+#include "bmhelper.h"
+#include <QDebug>
+
+BMHelper::BMHelper(int totalSize)
+{
+    for ( int i(0); i < totalSize; i++)
+        mBuffer.append(false);
+}
+
+BMHelper::~BMHelper()
+{
+}
+
+void BMHelper::release(int start, int end)
+{
+    if ( start<0)
+        start = 0;
+    if (end>mBuffer.size() - 1)
+        end = mBuffer.size() - 1;
+    
+    for ( int i = start; i <= end; i++){
+        mBuffer.replace(i, false);
+    }
+}
+
+void BMHelper::request(int start, int end, HgRequestOrder order)
+{
+    Q_UNUSED(order);
+    if ( start<0)
+        start = 0;
+    if (end>mBuffer.size() - 1)
+        end = mBuffer.size() - 1;
+
+    for ( int i = start; i <= end; i++){
+        mBuffer.replace(i, true);
+    }
+}
+
+bool BMHelper::isIntergal(int bufferSize)
+{
+    int c = mBuffer.count(true);
+    bool res = (bufferSize == c);
+    if (res){ ///check integrity ( if all items from first true, to size are true;
+        int f = mBuffer.indexOf(true);
+        for ( int i =0; i < mBuffer.count(); i++){
+            if (mBuffer[i] != (i>=f && i < f+bufferSize) ){
+                res = false;
+                break;
+            }
+        }
+    } else {
+        qWarning()<<QString("isIntergal mBuffer.count(true)=%1 bufferSize=%2").arg(c).arg(bufferSize);
+    }
+    
+    return res;
+}
+
+void BMHelper::itemCountChanged( int aIndex, bool aRemoved, int aNewTotalCount )
+{
+    Q_UNUSED(aRemoved);
+    
+    if ( aIndex < 0)
+        aIndex = 0;
+    if ( aIndex > mBuffer.count())
+        aIndex = mBuffer.count()-1;
+    
+    if ((mBuffer.count() - aNewTotalCount)>0){
+        while (mBuffer.count()!=aNewTotalCount){
+            if (aIndex > mBuffer.count() )
+                aIndex = mBuffer.count() -1;
+            mBuffer.removeAt(aIndex);
+        }
+    } else if ((mBuffer.count() - aNewTotalCount)<0){
+        while (mBuffer.count()!=aNewTotalCount){
+            mBuffer.insert(aIndex, false);
+        }
+    }
+}