itoa的实现_static const char digits[200] = { ‘0‘, ‘0‘, ‘0‘, ‘

复制代码
    const uint32_t a = value / 100000000; // 1 to 42
    value %= 100000000;

    if (a >= 10) {
        const unsigned i = a << 1;
        *buffer++ = cDigitsLut[i];
        *buffer++ = cDigitsLut[i + 1];
    }
    else
        *buffer++ = static_cast<char>('0' + static_cast<char>(a));

    const uint32_t b = value / 10000; // 0 to 9999
    const uint32_t c = value % 10000; // 0 to 9999

    const uint32_t d1 = (b / 100) << 1;
    const uint32_t d2 = (b % 100) << 1;

    const uint32_t d3 = (c / 100) << 1;
    const uint32_t d4 = (c % 100) << 1;

    *buffer++ = cDigitsLut[d1];
    *buffer++ = cDigitsLut[d1 + 1];
    *buffer++ = cDigitsLut[d2];
    *buffer++ = cDigitsLut[d2 + 1];
    *buffer++ = cDigitsLut[d3];
    *buffer++ = cDigitsLut[d3 + 1];
    *buffer++ = cDigitsLut[d4];
    *buffer++ = cDigitsLut[d4 + 1];
}
return buffer;

}

inline char* i32toa(int32_t value, char* buffer) {

uint32_t u = static_cast<uint32_t>(value);

if (value < 0) {

*buffer++ = '-';

u = ~u + 1;

}

复制代码
return u32toa(u, buffer);

}

inline char* u64toa(uint64_t value, char* buffer) {

const char* cDigitsLut = GetDigitsLut();

const uint64_t kTen8 = 100000000;

const uint64_t kTen9 = kTen8 * 10;

const uint64_t kTen10 = kTen8 * 100;

const uint64_t kTen11 = kTen8 * 1000;

const uint64_t kTen12 = kTen8 * 10000;

const uint64_t kTen13 = kTen8 * 100000;

const uint64_t kTen14 = kTen8 * 1000000;

const uint64_t kTen15 = kTen8 * 10000000;

const uint64_t kTen16 = kTen8 * kTen8;

复制代码
if (value < kTen8) {
    uint32_t v = static_cast<uint32_t>(value);
    if (v < 10000) {
        const uint32_t d1 = (v / 100) << 1;
        const uint32_t d2 = (v % 100) << 1;

        if (v >= 1000)
            *buffer++ = cDigitsLut[d1];
        if (v >= 100)
            *buffer++ = cDigitsLut[d1 + 1];
        if (v >= 10)
            *buffer++ = cDigitsLut[d2];
        *buffer++ = cDigitsLut[d2 + 1];
    }
    else {
        // value = bbbbcccc
        const uint32_t b = v / 10000;
        const uint32_t c = v % 10000;

        const uint32_t d1 = (b / 100) << 1;
        const uint32_t d2 = (b % 100) << 1;

        const uint32_t d3 = (c / 100) << 1;
        const uint32_t d4 = (c % 100) << 1;

        if (value >= 10000000)
            *buffer++ = cDigitsLut[d1];
        if (value >= 1000000)
            *buffer++ = cDigitsLut[d1 + 1];
        if (value >= 100000)
            *buffer++ = cDigitsLut[d2];
        *buffer++ = cDigitsLut[d2 + 1];

        *buffer++ = cDigitsLut[d3];
        *buffer++ = cDigitsLut[d3 + 1];
        *buffer++ = cDigitsLut[d4];
        *buffer++ = cDigitsLut[d4 + 1];
    }
}
else if (value < kTen16) {
    const uint32_t v0 = static_cast<uint32_t>(value / kTen8);
    const uint32_t v1 = static_cast<uint32_t>(value % kTen8);

    const uint32_t b0 = v0 / 10000;
    const uint32_t c0 = v0 % 10000;

    const uint32_t d1 = (b0 / 100) << 1;
    const uint32_t d2 = (b0 % 100) << 1;

    const uint32_t d3 = (c0 / 100) << 1;
    const uint32_t d4 = (c0 % 100) << 1;

    const uint32_t b1 = v1 / 10000;
    const uint32_t c1 = v1 % 10000;

    const uint32_t d5 = (b1 / 100) << 1;
    const uint32_t d6 = (b1 % 100) << 1;

    const uint32_t d7 = (c1 / 100) << 1;
    const uint32_t d8 = (c1 % 100) << 1;

    if (value >= kTen15)
        *buffer++ = cDigitsLut[d1];
    if (value >= kTen14)
        *buffer++ = cDigitsLut[d1 + 1];
    if (value >= kTen13)
        *buffer++ = cDigitsLut[d2];
    if (value >= kTen12)
        *buffer++ = cDigitsLut[d2 + 1];
    if (value >= kTen11)
        *buffer++ = cDigitsLut[d3];
    if (value >= kTen10)
        *buffer++ = cDigitsLut[d3 + 1];
    if (value >= kTen9)
        *buffer++ = cDigitsLut[d4];
    if (value >= kTen8)
        *buffer++ = cDigitsLut[d4 + 1];

    *buffer++ = cDigitsLut[d5];
    *buffer++ = cDigitsLut[d5 + 1];
    *buffer++ = cDigitsLut[d6];
    *buffer++ = cDigitsLut[d6 + 1];
    *buffer++ = cDigitsLut[d7];
    *buffer++ = cDigitsLut[d7 + 1];
    *buffer++ = cDigitsLut[d8];
    *buffer++ = cDigitsLut[d8 + 1];
}
else {
    const uint32_t a = static_cast<uint32_t>(value / kTen16); // 1 to 1844
    value %= kTen16;

    if (a < 10)
        *buffer++ = static_cast<char>('0' + static_cast<char>(a));
    else if (a < 100) {
        const uint32_t i = a << 1;
        *buffer++ = cDigitsLut[i];
        *buffer++ = cDigitsLut[i + 1];
    }
    else if (a < 1000) {
        *buffer++ = static_cast<char>('0' + static_cast<char>(a / 100));

        const uint32_t i = (a % 100) << 1;
        *buffer++ = cDigitsLut[i];
        *buffer++ = cDigitsLut[i + 1];
    }
    else {
        const uint32_t i = (a / 100) << 1;
        const uint32_t j = (a % 100) << 1;
        *buffer++ = cDigitsLut[i];
        *buffer++ = cDigitsLut[i + 1];
        *buffer++ = cDigitsLut[j];
        *buffer++ = cDigitsLut[j + 1];
    }

    const uint32_t v0 = static_cast<uint32_t>(value / kTen8);
    const uint32_t v1 = static_cast<uint32_t>(value % kTen8);

    const uint32_t b0 = v0 / 10000;
    const uint32_t c0 = v0 % 10000;

    const uint32_t d1 = (b0 / 100) << 1;
    const uint32_t d2 = (b0 % 100) << 1;

    const uint32_t d3 = (c0 / 100) << 1;
    const uint32_t d4 = (c0 % 100) << 1;

    const uint32_t b1 = v1 / 10000;
    const uint32_t c1 = v1 % 10000;

    const uint32_t d5 = (b1 / 100) << 1;
    const uint32_t d6 = (b1 % 100) << 1;

    const uint32_t d7 = (c1 / 100) << 1;
    const uint32_t d8 = (c1 % 100) << 1;

    *buffer++ = cDigitsLut[d1];
    *buffer++ = cDigitsLut[d1 + 1];
    *buffer++ = cDigitsLut[d2];
    *buffer++ = cDigitsLut[d2 + 1];
    *buffer++ = cDigitsLut[d3];
    *buffer++ = cDigitsLut[d3 + 1];
    *buffer++ = cDigitsLut[d4];
    *buffer++ = cDigitsLut[d4 + 1];
    *buffer++ = cDigitsLut[d5];
    *buffer++ = cDigitsLut[d5 + 1];
    *buffer++ = cDigitsLut[d6];
    *buffer++ = cDigitsLut[d6 + 1];
    *buffer++ = cDigitsLut[d7];
    *buffer++ = cDigitsLut[d7 + 1];
    *buffer++ = cDigitsLut[d8];
    *buffer++ = cDigitsLut[d8 + 1];
}

return buffer;
相关推荐
程序员侠客行几秒前
Tomcat 从陌生到熟悉
java·tomcat·web
wertyuytrewm2 分钟前
Java 异常|Java Exceptions
java·开发语言
ProgramHelpOa4 分钟前
Amazon SDE Intern OA 2026 最新复盘|70分钟两题 Medium-Hard
java·前端·javascript
雪碧聊技术11 分钟前
深入理解 Java GC:从“房间清洁工”到解决系统卡顿实战
java·开发语言
大鹏说大话17 分钟前
Java并发编程核心:线程安全、synchronized与volatile的深度剖析
java·开发语言
smchaopiao19 分钟前
如何用CSS和JS搞定全屏图片展示
前端·javascript·css
迷藏49419 分钟前
# 发散创新:低代码开发新范式——用可视化逻辑构建企业级业务系统 在当今快速迭代的软件工程实践
java·python·低代码
JAVA+C语言21 分钟前
Java IO 流
java·开发语言
桌面运维家22 分钟前
KVM虚拟机:快照增量备份与Linux系统快速恢复
linux·运维·服务器
酉鬼女又兒25 分钟前
零基础快速入门前端CSS Transform 与动画核心知识点及蓝桥杯 Web 应用开发考点解析(可用于备赛蓝桥杯Web应用开发)
开发语言·前端·css·职场和发展·蓝桥杯·html