This website requires JavaScript.
Explore
Help
Register
Sign In
rooty
/
DataTables
Watch
1
Star
0
Fork
0
You've already forked DataTables
mirror of
https://github.com/DataTables/DataTables.git
synced
2024-11-30 12:24:10 +01:00
Code
Issues
Releases
Activity
2c14233057
DataTables
/
media
History
Allan Jardine
2c14233057
New: Optimisation for sorting - when the sorting runs it will execute the sorting function a lot, particularly for large tables, so we want these functions to be as fast as possible. As it stood, each time the function ran it would prep the data and then do the required comparison - and it would do that data prep every time. This is pointless since toLowerCase (for example) is always going to give the same result when using the same input - so now introduced a third sorting function type (in addition to 'asc' and 'desc') called 'pre', which will pre-format the data to be sorted, only once for each item to be sorted, allowing the sorting comparison function itself to be really fast (simply just the comparison). This is also backwards compatible, if the sorting type doesn't have a 'pre'-formatting method then it will just use the two sorting functions as normal.
2011-11-19 09:53:11 +00:00
..
css
Updated: Update the links on all examples to include the new examples for 1.8 and general tidy up of examples
2011-04-26 07:30:31 +01:00
images
Initial commit - DataTables 1.7.0
2010-08-17 08:42:13 +01:00
js
New: Optimisation for sorting - when the sorting runs it will execute the sorting function a lot, particularly for large tables, so we want these functions to be as fast as possible. As it stood, each time the function ran it would prep the data and then do the required comparison - and it would do that data prep every time. This is pointless since toLowerCase (for example) is always going to give the same result when using the same input - so now introduced a third sorting function type (in addition to 'asc' and 'desc') called 'pre', which will pre-format the data to be sorted, only once for each item to be sorted, allowing the sorting comparison function itself to be really fast (simply just the comparison). This is also backwards compatible, if the sorting type doesn't have a 'pre'-formatting method then it will just use the two sorting functions as normal.
2011-11-19 09:53:11 +00:00
unit_testing
Fix typo 'destory' -> 'destroy'.
2011-11-07 09:55:01 +01:00