1 : //* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
2 : /* ***** BEGIN LICENSE BLOCK *****
3 : * Version: MPL 1.1/GPL 2.0/LGPL 2.1
4 : *
5 : * The contents of this file are subject to the Mozilla Public License Version
6 : * 1.1 (the "License"); you may not use this file except in compliance with
7 : * the License. You may obtain a copy of the License at
8 : * http://www.mozilla.org/MPL/
9 : *
10 : * Software distributed under the License is distributed on an "AS IS" basis,
11 : * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
12 : * for the specific language governing rights and limitations under the
13 : * License.
14 : *
15 : * The Original Code is Url Classifier code
16 : *
17 : * The Initial Developer of the Original Code is
18 : * the Mozilla Foundation.
19 : * Portions created by the Initial Developer are Copyright (C) 2011
20 : * the Initial Developer. All Rights Reserved.
21 : *
22 : * Contributor(s):
23 : * Dave Camp <dcamp@mozilla.com>
24 : * Gian-Carlo Pascutto <gpascutto@mozilla.com>
25 : *
26 : * Alternatively, the contents of this file may be used under the terms of
27 : * either the GNU General Public License Version 2 or later (the "GPL"), or
28 : * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
29 : * in which case the provisions of the GPL or the LGPL are applicable instead
30 : * of those above. If you wish to allow use of your version of this file only
31 : * under the terms of either the GPL or the LGPL, and not to allow others to
32 : * use your version of this file under the terms of the MPL, indicate your
33 : * decision by deleting the provisions above and replace them with the notice
34 : * and other provisions required by the GPL or the LGPL. If you do not delete
35 : * the provisions above, a recipient may use your version of this file under
36 : * the terms of any one of the MPL, the GPL or the LGPL.
37 : *
38 : * ***** END LICENSE BLOCK ***** */
39 :
40 : #include "ChunkSet.h"
41 :
42 : namespace mozilla {
43 : namespace safebrowsing {
44 :
45 : nsresult
46 55 : ChunkSet::Serialize(nsACString& aChunkStr)
47 : {
48 55 : aChunkStr.Truncate();
49 :
50 55 : PRUint32 i = 0;
51 165 : while (i < mChunks.Length()) {
52 55 : if (i != 0) {
53 0 : aChunkStr.Append(',');
54 : }
55 55 : aChunkStr.AppendInt((PRInt32)mChunks[i]);
56 :
57 55 : PRUint32 first = i;
58 55 : PRUint32 last = first;
59 55 : i++;
60 124 : while (i < mChunks.Length() && (mChunks[i] == mChunks[i - 1] + 1 || mChunks[i] == mChunks[i - 1])) {
61 14 : last = i++;
62 : }
63 :
64 55 : if (last != first) {
65 12 : aChunkStr.Append('-');
66 12 : aChunkStr.AppendInt((PRInt32)mChunks[last]);
67 : }
68 : }
69 :
70 55 : return NS_OK;
71 : }
72 :
73 : nsresult
74 519 : ChunkSet::Set(PRUint32 aChunk)
75 : {
76 519 : PRUint32 idx = mChunks.BinaryIndexOf(aChunk);
77 519 : if (idx == nsTArray<uint32>::NoIndex) {
78 342 : mChunks.InsertElementSorted(aChunk);
79 : }
80 519 : return NS_OK;
81 : }
82 :
83 : nsresult
84 0 : ChunkSet::Unset(PRUint32 aChunk)
85 : {
86 0 : mChunks.RemoveElementSorted(aChunk);
87 :
88 0 : return NS_OK;
89 : }
90 :
91 : bool
92 560 : ChunkSet::Has(PRUint32 aChunk) const
93 : {
94 560 : return mChunks.BinaryIndexOf(aChunk) != nsTArray<uint32>::NoIndex;
95 : }
96 :
97 : nsresult
98 732 : ChunkSet::Merge(const ChunkSet& aOther)
99 : {
100 732 : const uint32 *dupIter = aOther.mChunks.Elements();
101 732 : const uint32 *end = aOther.mChunks.Elements() + aOther.mChunks.Length();
102 :
103 1007 : for (const uint32 *iter = dupIter; iter != end; iter++) {
104 275 : nsresult rv = Set(*iter);
105 275 : NS_ENSURE_SUCCESS(rv, rv);
106 : }
107 :
108 732 : return NS_OK;
109 : }
110 :
111 : nsresult
112 341 : ChunkSet::Remove(const ChunkSet& aOther)
113 : {
114 341 : uint32 *addIter = mChunks.Elements();
115 341 : uint32 *end = mChunks.Elements() + mChunks.Length();
116 :
117 471 : for (uint32 *iter = addIter; iter != end; iter++) {
118 130 : if (!aOther.Has(*iter)) {
119 114 : *addIter = *iter;
120 114 : addIter++;
121 : }
122 : }
123 :
124 341 : mChunks.SetLength(addIter - mChunks.Elements());
125 :
126 341 : return NS_OK;
127 : }
128 :
129 : void
130 1172 : ChunkSet::Clear()
131 : {
132 1172 : mChunks.Clear();
133 1172 : }
134 :
135 : }
136 : }
|