mirror of
https://gitlab.winehq.org/wine/wine-gecko.git
synced 2024-09-13 09:24:08 -07:00
8c296bbcd4
This patch was generated by a script. Here's the source of the script for
future reference:
function convert() {
echo "Converting $1 to $2..."
find . ! -wholename "*nsprpub*" \
! -wholename "*security/nss*" \
! -wholename "*/.hg*" \
! -wholename "obj-ff-dbg*" \
! -name nsXPCOMCID.h \
! -name prtypes.h \
-type f \
\( -iname "*.cpp" \
-o -iname "*.h" \
-o -iname "*.c" \
-o -iname "*.cc" \
-o -iname "*.idl" \
-o -iname "*.ipdl" \
-o -iname "*.ipdlh" \
-o -iname "*.mm" \) | \
xargs -n 1 sed -i -e "s/\b$1\b/$2/g"
}
convert PRInt8 int8_t
convert PRUint8 uint8_t
convert PRInt16 int16_t
convert PRUint16 uint16_t
convert PRInt32 int32_t
convert PRUint32 uint32_t
convert PRInt64 int64_t
convert PRUint64 uint64_t
convert PRIntn int
convert PRUintn unsigned
convert PRSize size_t
convert PROffset32 int32_t
convert PROffset64 int64_t
convert PRPtrdiff ptrdiff_t
convert PRFloat64 double
103 lines
2.0 KiB
C++
103 lines
2.0 KiB
C++
//* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
/* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
|
|
|
|
#include "ChunkSet.h"
|
|
|
|
namespace mozilla {
|
|
namespace safebrowsing {
|
|
|
|
nsresult
|
|
ChunkSet::Serialize(nsACString& aChunkStr)
|
|
{
|
|
aChunkStr.Truncate();
|
|
|
|
uint32_t i = 0;
|
|
while (i < mChunks.Length()) {
|
|
if (i != 0) {
|
|
aChunkStr.Append(',');
|
|
}
|
|
aChunkStr.AppendInt((int32_t)mChunks[i]);
|
|
|
|
uint32_t first = i;
|
|
uint32_t last = first;
|
|
i++;
|
|
while (i < mChunks.Length() && (mChunks[i] == mChunks[i - 1] + 1 || mChunks[i] == mChunks[i - 1])) {
|
|
last = i++;
|
|
}
|
|
|
|
if (last != first) {
|
|
aChunkStr.Append('-');
|
|
aChunkStr.AppendInt((int32_t)mChunks[last]);
|
|
}
|
|
}
|
|
|
|
return NS_OK;
|
|
}
|
|
|
|
nsresult
|
|
ChunkSet::Set(uint32_t aChunk)
|
|
{
|
|
uint32_t idx = mChunks.BinaryIndexOf(aChunk);
|
|
if (idx == nsTArray<uint32>::NoIndex) {
|
|
mChunks.InsertElementSorted(aChunk);
|
|
}
|
|
return NS_OK;
|
|
}
|
|
|
|
nsresult
|
|
ChunkSet::Unset(uint32_t aChunk)
|
|
{
|
|
mChunks.RemoveElementSorted(aChunk);
|
|
|
|
return NS_OK;
|
|
}
|
|
|
|
bool
|
|
ChunkSet::Has(uint32_t aChunk) const
|
|
{
|
|
return mChunks.BinaryIndexOf(aChunk) != nsTArray<uint32>::NoIndex;
|
|
}
|
|
|
|
nsresult
|
|
ChunkSet::Merge(const ChunkSet& aOther)
|
|
{
|
|
const uint32 *dupIter = aOther.mChunks.Elements();
|
|
const uint32 *end = aOther.mChunks.Elements() + aOther.mChunks.Length();
|
|
|
|
for (const uint32 *iter = dupIter; iter != end; iter++) {
|
|
nsresult rv = Set(*iter);
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
}
|
|
|
|
return NS_OK;
|
|
}
|
|
|
|
nsresult
|
|
ChunkSet::Remove(const ChunkSet& aOther)
|
|
{
|
|
uint32 *addIter = mChunks.Elements();
|
|
uint32 *end = mChunks.Elements() + mChunks.Length();
|
|
|
|
for (uint32 *iter = addIter; iter != end; iter++) {
|
|
if (!aOther.Has(*iter)) {
|
|
*addIter = *iter;
|
|
addIter++;
|
|
}
|
|
}
|
|
|
|
mChunks.SetLength(addIter - mChunks.Elements());
|
|
|
|
return NS_OK;
|
|
}
|
|
|
|
void
|
|
ChunkSet::Clear()
|
|
{
|
|
mChunks.Clear();
|
|
}
|
|
|
|
}
|
|
}
|