Redian新闻
>
大家哪里找contractor?serviceMagic.com 不错?
avatar
大家哪里找contractor?serviceMagic.com 不错?# Living
c*2
1
In C.
Not sure whether this is an interesting or meaningless question. :-)
avatar
N*w
2
request 交过去,很快就有人来联系,而且有评价的
价格一般也还好,不会乱要价
只是都是老美 contractor,价格不如老墨低
avatar
i*e
3
a trick using pointer arithmetic.
(int)((int*)0+1)
一些常见面试题的答案与总结 -
http://www.ihas1337code.com
avatar
S*t
4
Angie's list
serviceMagic.com charges too much.
avatar
H*7
5
what does this mean, can you plz explain it?

【在 i**********e 的大作中提到】
: a trick using pointer arithmetic.
: (int)((int*)0+1)
: 一些常见面试题的答案与总结 -
: http://www.ihas1337code.com

avatar
z*i
6
membership fee?

【在 S*********t 的大作中提到】
: Angie's list
: serviceMagic.com charges too much.

avatar
i*e
7
First, advance the pointer at address 0 by one. How many it advances depend
on the size of the pointer type.
一些常见面试题的答案与总结 -
http://www.ihas1337code.com
avatar
V*T
8
On the contrary,the contractor from Servicemagic charges much less than
those from Angie's list.
We canceled Angie's list membership and started to use servicemagic more.

【在 S*********t 的大作中提到】
: Angie's list
: serviceMagic.com charges too much.

avatar
y*e
9
这个方法很妙!

depend

【在 i**********e 的大作中提到】
: First, advance the pointer at address 0 by one. How many it advances depend
: on the size of the pointer type.
: 一些常见面试题的答案与总结 -
: http://www.ihas1337code.com

avatar
V*T
10
servicemagic is free
Angie's list charges annual fee.

【在 z**********i 的大作中提到】
: membership fee?
avatar
c*2
11
There are at least two other ways:
1) int a[2];
unsigned addr0=&a[0];
unsigned addr1=&a[1];
size_t sizeofint=addr1-addr0;
2) typedef struct ab {
int a;
int b;
} AB;
sizeofint=offset(b in AB)
=(unsigned)(&((AB*)0->b))
avatar
I*M
12
Our experience with ServiceMagic is pretty good.
avatar
m*1
13
contractors have to pay ServiceMagic $40-50 to get job information if they
want to come to your house to see the job.
avatar
m*1
14
but you don't have to pay a dime to servicemagic.
相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。