avatar
request a paper# Economics - 经济
h*g
1
我是公司的律师帮忙申请EB1-A I-140,在TSC,但是公司的律师不肯用premium
processing,说那样很容易被RFE,然后接下来又要很长的时间去准备RFE的回复。我有
下面几个问题:
1. 不用PP真的被RFE的几率就小一些吗?
2. 为了防止以后我的EB1-A被reject了,是不是也应该再申请一个NIW?
3. 我现在是O-1A,什么时候可以跳槽?如果在140批准之前就跳槽是不是新公司得要重
新提交140,而且原来的PD就没了?如果140批准之后跳槽就可以保留PD了是吗?
4. 不用PP一般需要等多久才能被处理,我看了以前的帖子,有不到两个月的,也有等
了8个月的。有最近的一些数据吗?
avatar
c*n
2
java 有自动生成javadoc的工具, 有谁知道javaScript怎样生成doc么?
avatar
h*o
3
I have a files which records some activities of all functions.
I want to count how many times each of the function is called.
How to write a unix shell to count them?
or is there any other way?
Thanks
avatar
h*a
4
Hi, folks,
Please help me to get this paper and send it to x****[email protected]
Heffley, D. and D.P. Hewitt, "Land Use Zoning in a Local Economy with
Optimal
Property Taxes and Public Expenditures,"
Journal of Real Estate Finance and Economics, Vol. 1, 373-391 (1988).
Thanks!
avatar
b*f
5
据说没有直接关联
NIW通过率高一点,个人建议一起搞一个,反正推荐信都有了。。。
140批准了就有PD。为啥不自己申请1A,批准前跑路公司应该可以withdraw 140.
不知道,其实知道receipt number的话可以自己追加pp。。。
avatar
r*y
6
自己写一个吧

【在 c***n 的大作中提到】
: java 有自动生成javadoc的工具, 有谁知道javaScript怎样生成doc么?
avatar
i*h
7
What function? You mean C/C++ function?
if in C,
void f() {
static int count = 0;
count++;
}
avatar
h*a
8
got it. Thank you.
avatar
h*o
9
forget about the function. Please think it as strings.
What I want is to count how many times each function name appear in this
file. While the size of the file is too large, I cannot count it with my
eyes and therefore want to write some shell. But I am a beginner of unix
shell. so I want to get some answers or hints here.
BTW, the format of the functions in this file is sth. like:
ADDR BUFADDR TIMESTAMP THREAD
CACHE LA

【在 h**o 的大作中提到】
: I have a files which records some activities of all functions.
: I want to count how many times each of the function is called.
: How to write a unix shell to count them?
: or is there any other way?
: Thanks

avatar
i*h
10
if function name appears at most 1 time in one line:
grep function_name log_file | wc -l

【在 h**o 的大作中提到】
: forget about the function. Please think it as strings.
: What I want is to count how many times each function name appear in this
: file. While the size of the file is too large, I cannot count it with my
: eyes and therefore want to write some shell. But I am a beginner of unix
: shell. so I want to get some answers or hints here.
: BTW, the format of the functions in this file is sth. like:
: ADDR BUFADDR TIMESTAMP THREAD
: CACHE LA

avatar
h*o
11
But I do not know what function appear in this files.
I only know there are some format which I can use to parse the names of
these function (see the attachment in the previous response)
I think I can first use grep to parse these function name, then count them
using for, sort,etc.
But I do not know how to grep them.

【在 i***h 的大作中提到】
: if function name appears at most 1 time in one line:
: grep function_name log_file | wc -l

avatar
i*h
12
So you don't have a list of all possible functions?
In that case, you'll need to know in what format the function names appeared
in the log file and find them using regex (I probably would do with Perl,
using hash to store the count of the appearances of each function).

【在 h**o 的大作中提到】
: But I do not know what function appear in this files.
: I only know there are some format which I can use to parse the names of
: these function (see the attachment in the previous response)
: I think I can first use grep to parse these function name, then count them
: using for, sort,etc.
: But I do not know how to grep them.

avatar
h*o
13
yes, I don't have. Here are some format I can parse the name of the
functions:
90861840 90001000 d80ca215c298 1
cd9028 cc69c0 0
libumem.so.1`umem_cache_alloc_debug+0x12b
libumem.so.1`umem_cache_alloc+0xc8
libumem.so.1`umem_alloc+0xaf
libumem.so.1`malloc+0x2e
libumem.so.1`calloc+0x35
xcalloc+0x3b
memPoolAlloc+0x28d
0x4e6f81
functionA+0x130
0x4eaa53
functionB+0x11b
libwebproxy.so.1`functionC+0x6ab
libwebproxy.so.1`functionD+0xa8
libwebproxy.so.1`functionE+0x6dc
libwebproxy.so.1`functionF+0x6d4
...

【在 i***h 的大作中提到】
: So you don't have a list of all possible functions?
: In that case, you'll need to know in what format the function names appeared
: in the log file and find them using regex (I probably would do with Perl,
: using hash to store the count of the appearances of each function).

avatar
h*o
14
besides. It seems grep only find the line which satisfies the requirement of
regular exp. but how to just get the name of the file, cutting other things
like address, lib names, etc? expecially if each line has different format,
then I cannot use 'cut'.

appeared

【在 i***h 的大作中提到】
: So you don't have a list of all possible functions?
: In that case, you'll need to know in what format the function names appeared
: in the log file and find them using regex (I probably would do with Perl,
: using hash to store the count of the appearances of each function).

avatar
i*h
15
In Perl (not familiar with shell programming and regex) something like:
$line = 'libumem.so.1`umem_cache_alloc_debug+0x12b';
$line =~ /^lib.*\`(\S+)\+0x/;
$func_name = $1;
func_name will be "umem_cache_alloc_debug"

【在 h**o 的大作中提到】
: yes, I don't have. Here are some format I can parse the name of the
: functions:
: 90861840 90001000 d80ca215c298 1
: cd9028 cc69c0 0
: libumem.so.1`umem_cache_alloc_debug+0x12b
: libumem.so.1`umem_cache_alloc+0xc8
: libumem.so.1`umem_alloc+0xaf
: libumem.so.1`malloc+0x2e
: libumem.so.1`calloc+0x35
: xcalloc+0x3b

avatar
h*o
16
Thanks. I will try to understand it.

【在 i***h 的大作中提到】
: In Perl (not familiar with shell programming and regex) something like:
: $line = 'libumem.so.1`umem_cache_alloc_debug+0x12b';
: $line =~ /^lib.*\`(\S+)\+0x/;
: $func_name = $1;
: func_name will be "umem_cache_alloc_debug"

相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。