求改进小函数# Programming - 葵花宝典
x*u
1 楼
计算机程序设计公司，招聘C++以及网页设计员
公司已注册E-Verify,可以提供OPT和OPT延期服务
请发Resume到 4*******[email protected]
或电话联系： 646-535-8857
公司已注册E-Verify,可以提供OPT和OPT延期服务
请发Resume到 4*******[email protected]
或电话联系： 646-535-8857
d*p
2 楼
一个比较两个字符串的函数(相等返回0,否则-1或者1):
int compareStr(str1, str2)
if (length(str1) < length(str2))
return -1;
else if (length(str1) > length(str2))
return 1;
// two string equal in length
for each character c1i in str1 and c2i in str2
if c1i is upper case
convert c1i to lower case
if c2i is upper case
convert c2i to lower case
if (c1i < c2i)
int compareStr(str1, str2)
if (length(str1) < length(str2))
return -1;
else if (length(str1) > length(str2))
return 1;
// two string equal in length
for each character c1i in str1 and c2i in str2
if c1i is upper case
convert c1i to lower case
if c2i is upper case
convert c2i to lower case
if (c1i < c2i)
x*u
3 楼
可提供OPT延期服务~
y*e
4 楼
直接用STL的equal呢？
inline bool eq_nocase(char c1, char c2) {
return toupper(c1) == toupper(c2);
}
const int N = strlen(str1);
equal(str1, str1+N, str2, eq_nocase);
inline bool eq_nocase(char c1, char c2) {
return toupper(c1) == toupper(c2);
}
const int N = strlen(str1);
equal(str1, str1+N, str2, eq_nocase);
X*r
5 楼
为什么不用strcasecmp？
【在 d****p 的大作中提到】
: 一个比较两个字符串的函数(相等返回0,否则-1或者1):
: int compareStr(str1, str2)
: if (length(str1) < length(str2))
: return -1;
: else if (length(str1) > length(str2))
: return 1;
: // two string equal in length
: for each character c1i in str1 and c2i in str2
: if c1i is upper case
: convert c1i to lower case
【在 d****p 的大作中提到】
: 一个比较两个字符串的函数(相等返回0,否则-1或者1):
: int compareStr(str1, str2)
: if (length(str1) < length(str2))
: return -1;
: else if (length(str1) > length(str2))
: return 1;
: // two string equal in length
: for each character c1i in str1 and c2i in str2
: if c1i is upper case
: convert c1i to lower case
d*p
6 楼
The string comes as wstring, not string.
Do you see better algorithm? The function is called so many times since it
is used to compare keys in a lot of maps.
【在 X****r 的大作中提到】
: 为什么不用strcasecmp？
Do you see better algorithm? The function is called so many times since it
is used to compare keys in a lot of maps.
【在 X****r 的大作中提到】
: 为什么不用strcasecmp？
d*p
7 楼
Thanks.
I guess this function is more general purposed and should be slower than the
code posted? Anyway I will do a profiling.
【在 y****e 的大作中提到】
: 直接用STL的equal呢？
: inline bool eq_nocase(char c1, char c2) {
: return toupper(c1) == toupper(c2);
: }
: const int N = strlen(str1);
: equal(str1, str1+N, str2, eq_nocase);
I guess this function is more general purposed and should be slower than the
code posted? Anyway I will do a profiling.
【在 y****e 的大作中提到】
: 直接用STL的equal呢？
: inline bool eq_nocase(char c1, char c2) {
: return toupper(c1) == toupper(c2);
: }
: const int N = strlen(str1);
: equal(str1, str1+N, str2, eq_nocase);
g*g
8 楼
http://www.docjar.com/html/api/java/lang/String.java.html
你可以看看这个源码。
【在 d****p 的大作中提到】
: 一个比较两个字符串的函数(相等返回0,否则-1或者1):
: int compareStr(str1, str2)
: if (length(str1) < length(str2))
: return -1;
: else if (length(str1) > length(str2))
: return 1;
: // two string equal in length
: for each character c1i in str1 and c2i in str2
: if c1i is upper case
: convert c1i to lower case
你可以看看这个源码。
【在 d****p 的大作中提到】
: 一个比较两个字符串的函数(相等返回0,否则-1或者1):
: int compareStr(str1, str2)
: if (length(str1) < length(str2))
: return -1;
: else if (length(str1) > length(str2))
: return 1;
: // two string equal in length
: for each character c1i in str1 and c2i in str2
: if c1i is upper case
: convert c1i to lower case
X*r
9 楼
wcscasecmp() if available
You can check the source code of strcasecmp to get the idea. However, it
really depends on the representation of the string, e.g. checking the
length first is not efficient for C strings, but it is for C++'s
std::string.
it
【在 d****p 的大作中提到】
: The string comes as wstring, not string.
: Do you see better algorithm? The function is called so many times since it
: is used to compare keys in a lot of maps.
You can check the source code of strcasecmp to get the idea. However, it
really depends on the representation of the string, e.g. checking the
length first is not efficient for C strings, but it is for C++'s
std::string.
it
【在 d****p 的大作中提到】
: The string comes as wstring, not string.
: Do you see better algorithm? The function is called so many times since it
: is used to compare keys in a lot of maps.
d*p
10 楼
Thanks.
【在 g*****g 的大作中提到】
: http://www.docjar.com/html/api/java/lang/String.java.html
: 你可以看看这个源码。
【在 g*****g 的大作中提到】
: http://www.docjar.com/html/api/java/lang/String.java.html
: 你可以看看这个源码。
d*p
11 楼
Will try wcscasecmp - not sure it is available on all platforms.
If it doesn't work, I may consider building a lookup table to do the case
translation directly.
【在 X****r 的大作中提到】
: wcscasecmp() if available
: You can check the source code of strcasecmp to get the idea. However, it
: really depends on the representation of the string, e.g. checking the
: length first is not efficient for C strings, but it is for C++'s
: std::string.
:
: it
If it doesn't work, I may consider building a lookup table to do the case
translation directly.
【在 X****r 的大作中提到】
: wcscasecmp() if available
: You can check the source code of strcasecmp to get the idea. However, it
: really depends on the representation of the string, e.g. checking the
: length first is not efficient for C strings, but it is for C++'s
: std::string.
:
: it
y*d
12 楼
不能预先都转化为 upper case 的么？
【在 d****p 的大作中提到】
: The string comes as wstring, not string.
: Do you see better algorithm? The function is called so many times since it
: is used to compare keys in a lot of maps.
【在 d****p 的大作中提到】
: The string comes as wstring, not string.
: Do you see better algorithm? The function is called so many times since it
: is used to compare keys in a lot of maps.
d*p
13 楼
That's a good idea. However for now it is not realistic since project is
close to ending and such a change may be risky - too much code relying on
this little function. I would like to say if we were starting from scratch
again, this kind of preprocessing is absolutely necessary.
I tried using a char map to convert upper char to lower case char. Scaled
cpu time spent on the function dropped from 22 to 16, around 27% boost. ie
if (c >= L'A' && c < L'Z') c -= L'A' - L'a'
to
c = charmap[c] where ch
【在 y***d 的大作中提到】
: 不能预先都转化为 upper case 的么？
close to ending and such a change may be risky - too much code relying on
this little function. I would like to say if we were starting from scratch
again, this kind of preprocessing is absolutely necessary.
I tried using a char map to convert upper char to lower case char. Scaled
cpu time spent on the function dropped from 22 to 16, around 27% boost. ie
if (c >= L'A' && c < L'Z') c -= L'A' - L'a'
to
c = charmap[c] where ch
【在 y***d 的大作中提到】
: 不能预先都转化为 upper case 的么？
v*s
14 楼
如果是C /C++， 前面2个strlen应该去掉，合并到后面的循环中。
具体细节自己考虑吧，或者google c strcmp 函数。
【在 d****p 的大作中提到】
: 一个比较两个字符串的函数(相等返回0,否则-1或者1):
: int compareStr(str1, str2)
: if (length(str1) < length(str2))
: return -1;
: else if (length(str1) > length(str2))
: return 1;
: // two string equal in length
: for each character c1i in str1 and c2i in str2
: if c1i is upper case
: convert c1i to lower case
具体细节自己考虑吧，或者google c strcmp 函数。
【在 d****p 的大作中提到】
: 一个比较两个字符串的函数(相等返回0,否则-1或者1):
: int compareStr(str1, str2)
: if (length(str1) < length(str2))
: return -1;
: else if (length(str1) > length(str2))
: return 1;
: // two string equal in length
: for each character c1i in str1 and c2i in str2
: if c1i is upper case
: convert c1i to lower case
r*t
15 楼
有些标点符号比 upper case 大，所以不行。
【在 y***d 的大作中提到】
: 不能预先都转化为 upper case 的么？
【在 y***d 的大作中提到】
: 不能预先都转化为 upper case 的么？
r*t
16 楼
转成 lower case 以后，wstring 有 operator- 没有？如果没有的话做成 union
{wstring, long long...}，或者 cast 成足够大的整数，然后用整数相减行不行呢？或者
derive wstring 实现减法也行。
is
on
scratch
Scaled
boost.
ie
under
【在 d****p 的大作中提到】
: That's a good idea. However for now it is not realistic since project is
: close to ending and such a change may be risky - too much code relying on
: this little function. I would like to say if we were starting from scratch
: again, this kind of preprocessing is absolutely necessary.
: I tried using a char map to convert upper char to lower case char. Scaled
: cpu time spent on the function dropped from 22 to 16, around 27% boost. ie
: if (c >= L'A' && c < L'Z') c -= L'A' - L'a'
: to
: c = charmap[c] where ch
{wstring, long long...}，或者 cast 成足够大的整数，然后用整数相减行不行呢？或者
derive wstring 实现减法也行。
is
on
scratch
Scaled
boost.
ie
under
【在 d****p 的大作中提到】
: That's a good idea. However for now it is not realistic since project is
: close to ending and such a change may be risky - too much code relying on
: this little function. I would like to say if we were starting from scratch
: again, this kind of preprocessing is absolutely necessary.
: I tried using a char map to convert upper char to lower case char. Scaled
: cpu time spent on the function dropped from 22 to 16, around 27% boost. ie
: if (c >= L'A' && c < L'Z') c -= L'A' - L'a'
: to
: c = charmap[c] where ch
d*p
17 楼
casting wstring to large integer is a very interesting concept.thanks.
？或者
【在 r****t 的大作中提到】
: 转成 lower case 以后，wstring 有 operator- 没有？如果没有的话做成 union
: {wstring, long long...}，或者 cast 成足够大的整数，然后用整数相减行不行呢？或者
: derive wstring 实现减法也行。
:
: is
: on
: scratch
: Scaled
: boost.
: ie
？或者
【在 r****t 的大作中提到】
: 转成 lower case 以后，wstring 有 operator- 没有？如果没有的话做成 union
: {wstring, long long...}，或者 cast 成足够大的整数，然后用整数相减行不行呢？或者
: derive wstring 实现减法也行。
:
: is
: on
: scratch
: Scaled
: boost.
: ie
相关阅读
[bssd] Neural network as a programming language可替代性竟然已经学会了reactjs和angular js 2.程序语言的流行趋势王银看kotlin（本文建议零售价 ￥15）nodejs performance[R问题][classification] 你们模型cutoff value都怎么取? .5 吗？强人工智能实现的那一天就是大部分人开始死亡的那一天把python当成通用script来学，哪些module需要熟练？请问大家选Amazon 还是google cloud的服务器？人总是对近期进展过于乐观，远期进展过于悲观呼叫Wdong大牛Team 以前都是用dot.net的,新项目上.net core 还是golang ?请问搭建一个类似IBM I2或者palantir的分析平台需要多少人?AI普及后的社会怎么快速学习PYTHON到中级水平？ 有做项目的R，Matlab的经验，学过JAVA。问个spark的问题C++怎么保证2行代码atomic王垠造剑 (转载)大而不强，落后与先进的差距