


Sharing of 4 digital thousand place formatting methods implemented in JS_javascript skills
The so-called thousands form of numbers, that is, starting from the single digit, add a comma between every three digits. For example "10,000". In response to this requirement, I initially wrote a function like this:
//Method 1
function toThousands(num) {
var result = [ ], counter = 0;
num = (num || 0).toString().split('');
for (var i = num.length - 1; i >= 0; i--) {
counter ;
result.unshift(num[i]);
If (!(counter % 3) && i != 0) { result.unshift(','); }
}
Return result.join('');
}
The execution process of method one is to convert the numbers into strings, break them into arrays, and then insert the elements in the array into the beginning of the new array (result) one by one starting from the end. Every time an element is inserted, counter counts once (plus 1). When counter is a multiple of 3, a comma is inserted, but note that no comma is required at the beginning (when i is 0). Finally, the result is obtained by calling the join method of the new array.
Method 1 is relatively clear and easy to understand, and has been used in the project for some time. But my intuition tells me that its performance is not good.
Method 2 - string version of method 1
//Method 2
function toThousands(num) {
var result = '', counter = 0;
num = (num || 0).toString();
for (var i = num.length - 1; i >= 0; i--) {
counter ;
result = num.charAt(i) result;
If (!(counter % 3) && i != 0) { result = ',' result; }
}
Return result;
}
Method 2 is an improved version of method 1. It does not break the string into arrays and always operates on the string.
Method 3 - Loop to match the last three numbers
//Method 3
function toThousands(num) {
var num = (num || 0).toString(), re = /d{3}$/, result = '';
While ( re.test(num) ) {
result = RegExp.lastMatch result;
If (num !== RegExp.lastMatch) {
result = ',' result;
num = RegExp.leftContext;
} else {
num = '';
break;
}
}
If (num) { result = num result; }
Return result;
}
Method 3 is a completely different algorithm. It loops through regular expressions to match the three numbers at the end. Each time it matches, the comma and the matched content are inserted into the beginning of the result string, and then the matching target (num) Assign the value to the content that has not yet been matched (RegExp.leftContext). Also, note:
1. If the number of digits is a multiple of 3, the last matched content must be three digits, but there is no need to add commas before the first three digits;
2. If the number of digits in the number is not a multiple of 3, then there will definitely be 1 or 2 numbers left in the num variable at the end. After the loop, the remaining numbers should be inserted into the beginning of the result string.
Although method three reduces the number of loops (processing three characters in one loop), it increases consumption to a certain extent due to the use of regular expressions.
Method 4 - String version of method 3
//Method 4
function toThousands(num) {
var num = (num || 0).toString(), result = '';
while (num.length > 3) {
result = ',' num.slice(-3) result;
num = num.slice(0, num.length - 3);
}
If (num) { result = num result; }
Return result;
}
In fact, the function of intercepting the last three characters can be achieved through the slice, substr or substring method of the string type. This way you avoid using regular expressions.
Method Five - Grouping and Merging Method
//Method 5
function toThousands(num) {
var num = (num || 0).toString(), temp = num.length % 3;
switch (temp) {
case 1:
num = '00' num;
break;
case 2:
num = '0' num;
break;
}
Return num.match(/d{3}/g).join(',').replace(/^0 /, '');
}
First complement the number of digits to a multiple of 3, use regular expressions to cut it into groups of three digits, then add commas through the join method, and finally remove the complemented 0s.
Method Six - The Lazy Man's Method
//Method 6
function toThousands(num) {
Return (num || 0).toString().replace(/(d)(?=(?:d{3}) $)/g, '$1,');
}
I have always felt that this formatting can be done by replacing a regular expression, but it requires the use of assertions and other writing methods. Unfortunately, I am not familiar with this part. After some searching on Google, I actually found such a regular expression. This is probably the shortest implementation of the code.
Test results
数字 | 执行5000次消耗的时间(ms) | |||||
---|---|---|---|---|---|---|
方法一 | 方法二 | 方法三 | 方法四 | 方法五 | 方法六 | |
1 | 4 | 1 | 3 | 1 | 14 | 2 |
10 | 14 | 1 | 3 | 0 | 7 | 2 |
100 | 12 | 1 | 2 | 4 | 5 | 3 |
1000 | 13 | 2 | 3 | 2 | 9 | 5 |
10000 | 21 | 4 | 3 | 1 | 6 | 3 |
100000 | 21 | 3 | 2 | 1 | 5 | 6 |
The strong comparison between Method 1 and Method 2 shows that the efficiency of string operations is much higher than that of array operations; the test results of Method 6 tell us that the length of the code has nothing to do with the performance. Method 4 has the best overall performance (but why the performance is reduced when num is 100, I really don’t understand). The main reason is:
1. Comparing methods one and two, each operation uses 3 characters instead of 1 character to reduce the number of loops;
2. Compared with methods three, five and six, regular expressions are not used, which reduces consumption.
Finally, I chose method four as the final optimization solution. If readers have better implementation methods or suggestions for improvement, you can leave comments.

Understanding how JavaScript engine works internally is important to developers because it helps write more efficient code and understand performance bottlenecks and optimization strategies. 1) The engine's workflow includes three stages: parsing, compiling and execution; 2) During the execution process, the engine will perform dynamic optimization, such as inline cache and hidden classes; 3) Best practices include avoiding global variables, optimizing loops, using const and lets, and avoiding excessive use of closures.

Python is more suitable for beginners, with a smooth learning curve and concise syntax; JavaScript is suitable for front-end development, with a steep learning curve and flexible syntax. 1. Python syntax is intuitive and suitable for data science and back-end development. 2. JavaScript is flexible and widely used in front-end and server-side programming.

Python and JavaScript have their own advantages and disadvantages in terms of community, libraries and resources. 1) The Python community is friendly and suitable for beginners, but the front-end development resources are not as rich as JavaScript. 2) Python is powerful in data science and machine learning libraries, while JavaScript is better in front-end development libraries and frameworks. 3) Both have rich learning resources, but Python is suitable for starting with official documents, while JavaScript is better with MDNWebDocs. The choice should be based on project needs and personal interests.

The shift from C/C to JavaScript requires adapting to dynamic typing, garbage collection and asynchronous programming. 1) C/C is a statically typed language that requires manual memory management, while JavaScript is dynamically typed and garbage collection is automatically processed. 2) C/C needs to be compiled into machine code, while JavaScript is an interpreted language. 3) JavaScript introduces concepts such as closures, prototype chains and Promise, which enhances flexibility and asynchronous programming capabilities.

Different JavaScript engines have different effects when parsing and executing JavaScript code, because the implementation principles and optimization strategies of each engine differ. 1. Lexical analysis: convert source code into lexical unit. 2. Grammar analysis: Generate an abstract syntax tree. 3. Optimization and compilation: Generate machine code through the JIT compiler. 4. Execute: Run the machine code. V8 engine optimizes through instant compilation and hidden class, SpiderMonkey uses a type inference system, resulting in different performance performance on the same code.

JavaScript's applications in the real world include server-side programming, mobile application development and Internet of Things control: 1. Server-side programming is realized through Node.js, suitable for high concurrent request processing. 2. Mobile application development is carried out through ReactNative and supports cross-platform deployment. 3. Used for IoT device control through Johnny-Five library, suitable for hardware interaction.

I built a functional multi-tenant SaaS application (an EdTech app) with your everyday tech tool and you can do the same. First, what’s a multi-tenant SaaS application? Multi-tenant SaaS applications let you serve multiple customers from a sing

This article demonstrates frontend integration with a backend secured by Permit, building a functional EdTech SaaS application using Next.js. The frontend fetches user permissions to control UI visibility and ensures API requests adhere to role-base


Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

AI Hentai Generator
Generate AI Hentai for free.

Hot Article

Hot Tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

PhpStorm Mac version
The latest (2018.2.1) professional PHP integrated development tool

Safe Exam Browser
Safe Exam Browser is a secure browser environment for taking online exams securely. This software turns any computer into a secure workstation. It controls access to any utility and prevents students from using unauthorized resources.

SublimeText3 Linux new version
SublimeText3 Linux latest version

MinGW - Minimalist GNU for Windows
This project is in the process of being migrated to osdn.net/projects/mingw, you can continue to follow us there. MinGW: A native Windows port of the GNU Compiler Collection (GCC), freely distributable import libraries and header files for building native Windows applications; includes extensions to the MSVC runtime to support C99 functionality. All MinGW software can run on 64-bit Windows platforms.