i18n language codes

I18N (whose source is the English word internationalization the first character I and n,18 as the middle character number) is the abbreviation of "internationalization". The I18N encapsulation API in the Chrome plugin framework:Chrome.i18n.getMessage (name)The characters used can be defined in a format similar to __msg_extname__, and then invoked through this API, for example:Chrome.i18n.getMessage (' Extna

No matter in the Web page or the software on the login time will encounter the problem of verification code, do not know the secret of the Code of the Friends have no interest together to explore.In fact, there is no mystery, that is, to generate random numbers, and then let the resulting random number as the word repertoires (pre-made digital letter string) subscript, so from the word repertoires randomly extracted from the composition of the small string is the simplest string, of course, you

Language abbreviation language type language codeCHS Simplified Chinese 0804CHT Traditional Chinese 0404JPN Japanese 0011KOR Korean 0012Dan Danish 0006DEU German 0007ENG International English 0809ENU English 0409ESP Spanish 000AFin Finnish 000BFRA French (Standard) 040CFRC Canadian French 0c0cITA Italian 0010NLD Dutch 0013Nor Norwegian 0014PLK Polish 0015PTB Braz

understand the code limit of 10,000 lines, UNIX V6 kernel source code in terms of the number is exactly within this range.On the other hand, recent operating systems, such as the latest version of Linux, are said to have more than 10 million lines of kernel source code. Even if you are not a beginner, it is virtually impossible to fully understand the entire code. : http://minnie.tuhs.org/cgi-bin/utree.pl?file=V6Ten. NETBSDNetBSD is a free, highly-ported unix-like operating system that is the m

understand the code limit of 10,000 lines, UNIX V6 kernel source code in terms of the number is exactly within this range.On the other hand, recent operating systems, such as the latest version of Linux, are said to have more than 10 million lines of kernel source code. Even if you are not a beginner, it is virtually impossible to fully understand the entire code. : http://minnie.tuhs.org/cgi-bin/utree.pl?file=V6Ten. NETBSDNetBSD is a free, highly-ported unix-like operating system that is the m

, recent operating systems, such as Linux 's latest version of the kernel source code, are said to exceed the million line. Even if you are not a beginner, it is virtually impossible to fully understand the entire code. :http://minnie.tuhs.org/cgi-bin/utree.pl?file=V6Ten. NETBSDNetBSD is a free, highly-ported unix-like operating system that is the most current portable platform operating system and can be executed on many platforms, from 64bit Alpha servers to handheld devices and embedded de

-ported unix-like operating system that is the most current portable platform operating system and can be executed on many platforms, from 64bit Alpha servers to handheld devices and embedded devices. The slogan for the NetBSD program is: "Of course it runs NetBSD". Its simple design, code specification, and many advanced features make it highly acclaimed in the industry and academia. Due to its concise design and advanced features, it has excellent performance in both production and research, a

Language codes a few old remember, make notes, deepen memory, also for reference: Language $LANG value Englist (US) En_us.utf8 Assamese As_in.utf8 Bengali Bn_in.utf8 Chinese (Simplified) Zh_cn.utf8 Chinese (Traditional) Zh_tw.utf8 French

There are many C language data structure code on the net, some can't run, and some can run and run;1 queues#include 2 stacks#include 3 Trees#include 4 figure#include Above project downloadHttp://pan.baidu.com/s/1o8qyWLsFilenameSjjgdemo-c5 C Data Structure resource linkHttp://outofmemory.cn/code-snippet/7235/C-language-scheme-create-and-BFS-DFS-bianlihttp://blog.csdn.net/Golden_Shadow/article/category/745332

-ported unix-like operating system that is the most current portable platform operating system and can be executed on many platforms, from 64bit Alpha servers to handheld devices and embedded devices. The slogan for the NetBSD program is: "Of course it runs NetBSD". Its simple design, code specification, and many advanced features make it highly acclaimed in the industry and academia. Due to its concise design and advanced features, it has excellent performance in both production and research, a

Knowing the editions selected in the browser of our visitors may be a very important data we may used to redirect the user to a specific page in the corresponding language, or to display specific information directed to the user (as for example the most suitable AD ). The basic command we will use to know the specified ages selected in the browser is this one: Request. servervariables ("http_accept_language ") You may get the complete

All winning source codes for the international C language chaos code competition: 1984-research analysis, 1984-Research Analysis Anonymous. cSource code: int i;main(){for(;i["] The code looks dizzy. The Code formatted with the compiler is as follows: int i;main(){ for(; i["] I believe that the formatted code is still dizzy for a novice C. Let's continue to look at it. 1.1 pointsThis Code contains only o

One, while loop1. Code formatwhile (loop condition){Loop body}2. If the loop condition is true, the loop body is executedAfter the loop body is executed, when the condition is judged to be true,If true, the loop body is executed so that it ends when judged falseSecond, do andloop1. Code formatDo{Loop body}while (cyclic condition);2. Execute the loop body first and then determine if the loop condition satisfiesIf satisfied, the loop body is executed again until the condition does not meet the end

", N); for(inti =0; I "%d", A[i]); Insert_sort (A,0, N); for(inti =0; I "%d", A[i]); return 0;}Hill sort#include /** Hill Sort * Stability: unstable * time complexity: O (N*LOGN) **/voidShell_insert_sort (intA[],intLintRintd) { for(intTMP, J, i = L + D; I i) {tmp= A[i], j = i-D; while(J >= L tmp A[j]) {A[j+ d] =A[j]; J-=D; } a[j+ d] =tmp; }}voidShell_sort (intA[],intLintR) { intD = (r-l)/2; while(d >=1) {Shell_insert_sort (A, L, R, D); D/=2; }}intMainvoid){ inta[ -]; intN scanf"%d