forked from mirrors/gecko-dev
90 lines
2.8 KiB
C++
90 lines
2.8 KiB
C++
//* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
/* ***** BEGIN LICENSE BLOCK *****
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
|
*
|
|
* The contents of this file are subject to the Mozilla Public License Version
|
|
* 1.1 (the "License"); you may not use this file except in compliance with
|
|
* the License. You may obtain a copy of the License at
|
|
* http://www.mozilla.org/MPL/
|
|
*
|
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
|
* for the specific language governing rights and limitations under the
|
|
* License.
|
|
*
|
|
* The Original Code is Url Classifier code
|
|
*
|
|
* The Initial Developer of the Original Code is
|
|
* the Mozilla Foundation.
|
|
* Portions created by the Initial Developer are Copyright (C) 2011
|
|
* the Initial Developer. All Rights Reserved.
|
|
*
|
|
* Contributor(s):
|
|
* Dave Camp <dcamp@mozilla.com>
|
|
* Gian-Carlo Pascutto <gpascutto@mozilla.com>
|
|
*
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
* either the GNU General Public License Version 2 or later (the "GPL"), or
|
|
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
|
* of those above. If you wish to allow use of your version of this file only
|
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
|
* use your version of this file under the terms of the MPL, indicate your
|
|
* decision by deleting the provisions above and replace them with the notice
|
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
|
* the provisions above, a recipient may use your version of this file under
|
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
|
*
|
|
* ***** END LICENSE BLOCK ***** */
|
|
|
|
#ifndef ChunkSet_h__
|
|
#define ChunkSet_h__
|
|
|
|
|
|
#include "Entries.h"
|
|
#include "nsString.h"
|
|
#include "nsTArray.h"
|
|
|
|
namespace mozilla {
|
|
namespace safebrowsing {
|
|
|
|
/**
|
|
* Store the chunks as an array of uint32.
|
|
* XXX: We should optimize this further to compress the
|
|
* many consecutive numbers.
|
|
*/
|
|
class ChunkSet {
|
|
public:
|
|
ChunkSet() {}
|
|
~ChunkSet() {}
|
|
|
|
nsresult Serialize(nsACString& aStr);
|
|
nsresult Set(PRUint32 aChunk);
|
|
nsresult Unset(PRUint32 aChunk);
|
|
void Clear();
|
|
nsresult Merge(const ChunkSet& aOther);
|
|
nsresult Remove(const ChunkSet& aOther);
|
|
|
|
bool Has(PRUint32 chunk) const;
|
|
|
|
uint32 Length() const { return mChunks.Length(); }
|
|
|
|
nsresult Write(nsIOutputStream* aOut) {
|
|
return WriteTArray(aOut, mChunks);
|
|
}
|
|
|
|
nsresult Read(nsIInputStream* aIn, PRUint32 aNumElements) {
|
|
return ReadTArray(aIn, &mChunks, aNumElements);
|
|
}
|
|
|
|
uint32 *Begin() { return mChunks.Elements(); }
|
|
uint32 *End() { return mChunks.Elements() + mChunks.Length(); }
|
|
|
|
private:
|
|
nsTArray<uint32> mChunks;
|
|
};
|
|
|
|
}
|
|
}
|
|
|
|
#endif
|