mirror of
https://github.com/infiniflow/ragflow.git
synced 2026-03-06 08:06:43 +08:00
70e9743ef1
# RAGFlow Go Implementation Plan 🚀 This repository tracks the progress of porting RAGFlow to Go. We'll implement core features and provide performance comparisons between Python and Go versions. ## Implementation Checklist - [x] User Management APIs - [x] Dataset Management Operations - [x] Retrieval Test - [x] Chat Management Operations - [x] Infinity Go SDK --------- Signed-off-by: Jin Hai <haijin.chn@gmail.com> Co-authored-by: Yingfeng Zhang <yingfeng.zhang@gmail.com>
83 lines
1.9 KiB
C++
83 lines
1.9 KiB
C++
// Copyright 2016 The RE2 Authors. All Rights Reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
#ifndef RE2_BITMAP256_H_
|
|
#define RE2_BITMAP256_H_
|
|
|
|
#ifdef _MSC_VER
|
|
#include <intrin.h>
|
|
#endif
|
|
#include <stdint.h>
|
|
#include <string.h>
|
|
|
|
#include "util/logging.h"
|
|
|
|
namespace re2 {
|
|
|
|
class Bitmap256 {
|
|
public:
|
|
Bitmap256() { Clear(); }
|
|
|
|
// Clears all of the bits.
|
|
void Clear() { memset(words_, 0, sizeof words_); }
|
|
|
|
// Tests the bit with index c.
|
|
bool Test(int c) const {
|
|
DCHECK_GE(c, 0);
|
|
DCHECK_LE(c, 255);
|
|
|
|
return (words_[c / 64] & (uint64_t{1} << (c % 64))) != 0;
|
|
}
|
|
|
|
// Sets the bit with index c.
|
|
void Set(int c) {
|
|
DCHECK_GE(c, 0);
|
|
DCHECK_LE(c, 255);
|
|
|
|
words_[c / 64] |= (uint64_t{1} << (c % 64));
|
|
}
|
|
|
|
// Finds the next non-zero bit with index >= c.
|
|
// Returns -1 if no such bit exists.
|
|
int FindNextSetBit(int c) const;
|
|
|
|
private:
|
|
// Finds the least significant non-zero bit in n.
|
|
static int FindLSBSet(uint64_t n) {
|
|
DCHECK_NE(n, 0);
|
|
#if defined(__GNUC__)
|
|
return __builtin_ctzll(n);
|
|
#elif defined(_MSC_VER) && defined(_M_X64)
|
|
unsigned long c;
|
|
_BitScanForward64(&c, n);
|
|
return static_cast<int>(c);
|
|
#elif defined(_MSC_VER) && defined(_M_IX86)
|
|
unsigned long c;
|
|
if (static_cast<uint32_t>(n) != 0) {
|
|
_BitScanForward(&c, static_cast<uint32_t>(n));
|
|
return static_cast<int>(c);
|
|
} else {
|
|
_BitScanForward(&c, static_cast<uint32_t>(n >> 32));
|
|
return static_cast<int>(c) + 32;
|
|
}
|
|
#else
|
|
int c = 63;
|
|
for (int shift = 1 << 5; shift != 0; shift >>= 1) {
|
|
uint64_t word = n << shift;
|
|
if (word != 0) {
|
|
n = word;
|
|
c -= shift;
|
|
}
|
|
}
|
|
return c;
|
|
#endif
|
|
}
|
|
|
|
uint64_t words_[4];
|
|
};
|
|
|
|
} // namespace re2
|
|
|
|
#endif // RE2_BITMAP256_H_
|