Django 2.1.x Documentationmeans “First load the template called ‘base’, which has defined a bunch of blocks, and fill the blocks with the following blocks.” In short, that lets you dramatically cut down on redundancy in templates: similar to mod_perl – it embeds Python within Apache and loads Python code into memory when the server starts. Code stays in memory throughout the life of an Apache process, which leads to significant performance Document-based search Simple database operations are too simple an approach when you start considering large blocks of text. Whereas the examples above can be thought of as operations on a string of characters, full0 码力 | 2790 页 | 2.71 MB | 1 年前3
Django 2.2.x Documentationmeans “First load the template called ‘base’, which has defined a bunch of blocks, and fill the blocks with the following blocks.” In short, that lets you dramatically cut down on redundancy in templates: similar to mod_perl – it embeds Python within Apache and loads Python code into memory when the server starts. Code stays in memory throughout the life of an Apache process, which leads to significant performance Document-based search Simple database operations are too simple an approach when you start considering large blocks of text. Whereas the examples above can be thought of as operations on a string of characters, full0 码力 | 2915 页 | 2.83 MB | 1 年前3
Django 2.1.x Documentationmeans “First load the template called ‘base’, which has defined a bunch of blocks, and fill the blocks with the following blocks.” In short, that lets you dramatically cut down on redundancy in templates: similar to mod_perl – it embeds Python within Apache and loads Python code into memory when the server starts. Code stays in memory throughout the life of an Apache process, which leads to significant performance Document-based search Simple database operations are too simple an approach when you start considering large blocks of text. Whereas the examples above can be thought of as operations on a string of characters, full0 码力 | 1910 页 | 6.49 MB | 1 年前3
Django 4.2.x Documentationmeans “First load the template called ‘base’, which has defined a bunch of blocks, and fill the blocks with the following blocks.” In short, that lets you dramatically cut down on redundancy in templates: similar to mod_perl – it embeds Python within Apache and loads Python code into memory when the server starts. Code stays in memory throughout the life of an Apache process, which leads to significant performance search Standard database operations stop being a useful approach when you start considering large blocks of text. Whereas the examples above can be thought of as operations on a string of characters, full0 码力 | 3305 页 | 3.16 MB | 1 年前3
Django 2.0.x Documentationmeans “First load the template called ‘base’, which has defined a bunch of blocks, and fill the blocks with the following blocks.” In short, that lets you dramatically cut down on redundancy in templates: similar to mod_perl – it embeds Python within Apache and loads Python code into memory when the server starts. Code stays in memory throughout the life of an Apache process, which leads to significant performance Document-based search Simple database operations are too simple an approach when you start considering large blocks of text. Whereas the examples above can be thought of as operations on a string of characters, full0 码力 | 2746 页 | 2.67 MB | 1 年前3
Django 2.0.x Documentationmeans “First load the template called ‘base’, which has defined a bunch of blocks, and fill the blocks with the following blocks.” In short, that lets you dramatically cut down on redundancy in templates: similar to mod_perl – it embeds Python within Apache and loads Python code into memory when the server starts. Code stays in memory throughout the life of an Apache process, which leads to significant performance Document-based search Simple database operations are too simple an approach when you start considering large blocks of text. Whereas the examples above can be thought of as operations on a string of characters, full0 码力 | 1880 页 | 6.41 MB | 1 年前3
Django Q Documentation
Release 0.7.131 1.2.3 recycle The number of tasks a worker will process before recycling . Useful to release memory resources on a regular basis. Defaults to 500. 1 Uses multiprocessing.cpu_count() which can fail broker, but rather how many tasks are kept in memory by a single cluster. Setting this to a reasonable number, can help balance the workload and the memory overhead of each individual cluster. Defaults chains group id result(wait=0) return the full list of results from the chain when it finishes. Blocks until timeout or result. param int wait how many milliseconds to wait for a result return an unsorted0 码力 | 56 页 | 416.37 KB | 1 年前3
Django Q Documentation
Release 0.7.111 1.2.3 recycle The number of tasks a worker will process before recycling . Useful to release memory resources on a regular basis. Defaults to 500. 1.2.4 timeout The number of seconds a worker is broker, but rather how many tasks are kept in memory by a single cluster. Setting this to a reasonable number, can help balance the workload and the memory overhead of each individual cluster. Defaults chains group id result(wait=0) return the full list of results from the chain when it finishes. Blocks until timeout or result. param int wait how many milliseconds to wait for a result return an unsorted0 码力 | 54 页 | 412.45 KB | 1 年前3
Django Q Documentation
Release 0.7.10number. [1] recycle The number of tasks a worker will process before recycling . Useful to release memory resources on a regular basis. Defaults to 500. timeout The number of seconds a worker is allowed broker, but rather how many tasks are kept in memory by a single cluster. Setting this to a reasonable number, can help balance the workload and the memory overhead of each individual cluster. Defaults chains group id result(wait=0) return the full list of results from the chain when it finishes. Blocks until timeout or result. param int wait: how many milliseconds to wait for a result return: an unsorted0 码力 | 67 页 | 518.39 KB | 1 年前3
Django Q Documentation
Release 0.7.121 1.2.3 recycle The number of tasks a worker will process before recycling . Useful to release memory resources on a regular basis. Defaults to 500. 1 Uses multiprocessing.cpu_count() which can fail broker, but rather how many tasks are kept in memory by a single cluster. Setting this to a reasonable number, can help balance the workload and the memory overhead of each individual cluster. Defaults chains group id result(wait=0) return the full list of results from the chain when it finishes. Blocks until timeout or result. param int wait how many milliseconds to wait for a result return an unsorted0 码力 | 56 页 | 415.46 KB | 1 年前3
共 91 条
- 1
- 2
- 3
- 4
- 5
- 6
- 10













