1. <i id='8fNOk'><tr id='8fNOk'><dt id='8fNOk'><q id='8fNOk'><span id='8fNOk'><b id='8fNOk'><form id='8fNOk'><ins id='8fNOk'></ins><ul id='8fNOk'></ul><sub id='8fNOk'></sub></form><legend id='8fNOk'></legend><bdo id='8fNOk'><pre id='8fNOk'><center id='8fNOk'></center></pre></bdo></b><th id='8fNOk'></th></span></q></dt></tr></i><div id='8fNOk'><tfoot id='8fNOk'></tfoot><dl id='8fNOk'><fieldset id='8fNOk'></fieldset></dl></div>
    <tfoot id='8fNOk'></tfoot>

    <small id='8fNOk'></small><noframes id='8fNOk'>

  2. <legend id='8fNOk'><style id='8fNOk'><dir id='8fNOk'><q id='8fNOk'></q></dir></style></legend>

    • <bdo id='8fNOk'></bdo><ul id='8fNOk'></ul>

      小字符串的快速开源校验和

      Fast open source checksum for small strings(小字符串的快速开源校验和)
    1. <tfoot id='dz9Vv'></tfoot>

      <legend id='dz9Vv'><style id='dz9Vv'><dir id='dz9Vv'><q id='dz9Vv'></q></dir></style></legend>

              <tbody id='dz9Vv'></tbody>
            <i id='dz9Vv'><tr id='dz9Vv'><dt id='dz9Vv'><q id='dz9Vv'><span id='dz9Vv'><b id='dz9Vv'><form id='dz9Vv'><ins id='dz9Vv'></ins><ul id='dz9Vv'></ul><sub id='dz9Vv'></sub></form><legend id='dz9Vv'></legend><bdo id='dz9Vv'><pre id='dz9Vv'><center id='dz9Vv'></center></pre></bdo></b><th id='dz9Vv'></th></span></q></dt></tr></i><div id='dz9Vv'><tfoot id='dz9Vv'></tfoot><dl id='dz9Vv'><fieldset id='dz9Vv'></fieldset></dl></div>

              <bdo id='dz9Vv'></bdo><ul id='dz9Vv'></ul>

              <small id='dz9Vv'></small><noframes id='dz9Vv'>

              • 本文介绍了小字符串的快速开源校验和的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着跟版网的小编来一起学习吧!

                问题描述

                对于小字符串(20-500 个字符),我需要一个快速校验和(尽可能快).

                I need a quick checksum (as fast as possilbe) for small strings (20-500 chars).

                我需要源代码,而且它必须很小!(最大约 100 LOC)

                I need the source code and that must be small! (about 100 LOC max)

                如果它可以在 Base32/64 中生成字符串.(或类似的东西)这将是完美的.基本上校验和不能使用任何坏"字符..你知道..通常的 (){}[].,;:/+-|等等

                If it could generate strings in Base32/64. (or something similar) it would be perfect. Basically the checksums cannot use any "bad" chars.. you know.. the usual (){}[].,;:/+-| etc

                澄清

                它可能是强/弱,这并不重要,因为它仅用于幕后目的.

                It could be strong/weak, that really doesn't matter since it is only for behind-the-scenes purposes.

                它不需要包含原始字符串的所有数据,因为我只会与生成的校验和进行比较,我不希望有任何解密".

                It need not contain all the data of the original string since I will be only doing comparison with generated checksums, I don't expect any sort of "decryption".

                推荐答案

                用C快速实现,我这边没有版权,随便用吧.但请注意,这是一个非常弱的校验和",所以不要将它用于严肃的事情:) - 但这就是你想要的,不是吗?

                Quick implementation in C, no copyrights from my side, so use it as you wish. But please note that this is a very weak "checksum", so don't use it for serious things :) - but that's what you wanted, isn't it?

                这将返回一个 32 位整数校验和,编码为包含其十六进制值的字符串.如果校验和函数不能满足您的需求,您可以将 chk += ((int)(str[i]) * (i + 1)); 行更改为更好的(fe 乘法),加法和按位旋转会更好).

                This returns an 32-bit integer checksum encoded as an string containing its hex value. If the checksum function doesn't satisfy your needs, you can change the chk += ((int)(str[i]) * (i + 1)); line to something better (f.e. multiplication, addition and bitwise rotating would be much better).

                按照hughdbrown的建议和他链接的答案之一,我更改了for 循环,因此它不会在每次迭代时调用 strlen.

                Following hughdbrown's advice and one of the answers he linked, I changed the for loop so it doesn't call strlen with every iteration.

                #include <stdio.h>
                #include <stdlib.h>
                #include <string>
                
                char* hextab = "0123456789ABCDEF";
                
                char* encode_int(int i) {
                  char* c = (char*)malloc(sizeof(char) * 9);
                
                  for (int j = 0; j < 4; j++) {
                    c[(j << 1)] = hextab[((i % 256) >> 4)];
                    c[(j << 1) + 1] = hextab[((i % 256) % 16)];
                
                    i = (i >> 8);
                  }
                  c[8] = 0;
                
                  return c;
                }
                
                int checksum(char* str) {
                  int i;
                  int chk = 0x12345678;
                
                  for (i = 0; str[i] != ''; i++) {
                    chk += ((int)(str[i]) * (i + 1));
                  }
                
                  return chk;
                }
                
                int main() {
                  char* str1 = "Teststring";
                  char* str2 = "Teststring2";
                
                  printf("string: %s, checksum string: %s
                ", str1, encode_int(checksum(str1)));
                  printf("string: %s, checksum string: %s
                ", str2, encode_int(checksum(str2)));
                
                  return 0;
                }
                

                这篇关于小字符串的快速开源校验和的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持跟版网!

                本站部分内容来源互联网,如果有图片或者内容侵犯了您的权益,请联系我们,我们会在确认后第一时间进行删除!

                相关文档推荐

                Fetch multiple links inside foreach loop(在 foreach 循环中获取多个链接)
                Backbone Fetch Request is OPTIONS method(Backbone Fetch Request 是 OPTIONS 方法)
                Fetch API leaks memory in Chrome(Fetch API 在 Chrome 中泄漏内存)
                How can I download and save a file using the Fetch API? (Node.js)(如何使用 Fetch API 下载和保存文件?(Node.js))
                Send blob data to node using fetch, multer, express(使用 fetch、multer、express 将 blob 数据发送到节点)
                Sending a custom User-Agent string along with my headers (fetch)(发送自定义用户代理字符串以及我的标头(获取))

              • <small id='UpISi'></small><noframes id='UpISi'>

                  <tbody id='UpISi'></tbody>
                <tfoot id='UpISi'></tfoot>
                <legend id='UpISi'><style id='UpISi'><dir id='UpISi'><q id='UpISi'></q></dir></style></legend>
                    <bdo id='UpISi'></bdo><ul id='UpISi'></ul>
                        • <i id='UpISi'><tr id='UpISi'><dt id='UpISi'><q id='UpISi'><span id='UpISi'><b id='UpISi'><form id='UpISi'><ins id='UpISi'></ins><ul id='UpISi'></ul><sub id='UpISi'></sub></form><legend id='UpISi'></legend><bdo id='UpISi'><pre id='UpISi'><center id='UpISi'></center></pre></bdo></b><th id='UpISi'></th></span></q></dt></tr></i><div id='UpISi'><tfoot id='UpISi'></tfoot><dl id='UpISi'><fieldset id='UpISi'></fieldset></dl></div>