/dports/www/grafana8/grafana-8.3.6/vendor/github.com/andybalholm/brotli/ |
H A D | cluster_literal.go | 84 for idx1 = 0; idx1 < num_clusters; idx1++ { 92 for num_clusters > min_cluster_size { 115 for i = 0; i < num_clusters; i++ { 122 num_clusters-- 149 for i = 0; i < num_clusters; i++ { 154 return num_clusters 183 for j = 0; j < num_clusters; j++ { 195 for i = 0; i < num_clusters; i++ { 260 var num_clusters uint = 0 286 num_clusters += num_new_clusters [all …]
|
H A D | cluster_command.go | 84 for idx1 = 0; idx1 < num_clusters; idx1++ { 92 for num_clusters > min_cluster_size { 115 for i = 0; i < num_clusters; i++ { 122 num_clusters-- 149 for i = 0; i < num_clusters; i++ { 154 return num_clusters 183 for j = 0; j < num_clusters; j++ { 195 for i = 0; i < num_clusters; i++ { 260 var num_clusters uint = 0 286 num_clusters += num_new_clusters [all …]
|
H A D | cluster_distance.go | 84 for idx1 = 0; idx1 < num_clusters; idx1++ { 92 for num_clusters > min_cluster_size { 115 for i = 0; i < num_clusters; i++ { 122 num_clusters-- 149 for i = 0; i < num_clusters; i++ { 154 return num_clusters 183 for j = 0; j < num_clusters; j++ { 195 for i = 0; i < num_clusters; i++ { 260 var num_clusters uint = 0 286 num_clusters += num_new_clusters [all …]
|
/dports/www/gitea/gitea-1.16.5/vendor/github.com/andybalholm/brotli/ |
H A D | cluster_distance.go | 84 for idx1 = 0; idx1 < num_clusters; idx1++ { 92 for num_clusters > min_cluster_size { 115 for i = 0; i < num_clusters; i++ { 122 num_clusters-- 149 for i = 0; i < num_clusters; i++ { 154 return num_clusters 183 for j = 0; j < num_clusters; j++ { 195 for i = 0; i < num_clusters; i++ { 260 var num_clusters uint = 0 286 num_clusters += num_new_clusters [all …]
|
H A D | cluster_literal.go | 84 for idx1 = 0; idx1 < num_clusters; idx1++ { 92 for num_clusters > min_cluster_size { 115 for i = 0; i < num_clusters; i++ { 122 num_clusters-- 149 for i = 0; i < num_clusters; i++ { 154 return num_clusters 183 for j = 0; j < num_clusters; j++ { 195 for i = 0; i < num_clusters; i++ { 260 var num_clusters uint = 0 286 num_clusters += num_new_clusters [all …]
|
/dports/www/mattermost-server/mattermost-server-6.0.2/vendor/github.com/andybalholm/brotli/ |
H A D | cluster_distance.go | 84 for idx1 = 0; idx1 < num_clusters; idx1++ { 92 for num_clusters > min_cluster_size { 115 for i = 0; i < num_clusters; i++ { 122 num_clusters-- 149 for i = 0; i < num_clusters; i++ { 154 return num_clusters 183 for j = 0; j < num_clusters; j++ { 195 for i = 0; i < num_clusters; i++ { 260 var num_clusters uint = 0 286 num_clusters += num_new_clusters [all …]
|
H A D | cluster_command.go | 84 for idx1 = 0; idx1 < num_clusters; idx1++ { 92 for num_clusters > min_cluster_size { 115 for i = 0; i < num_clusters; i++ { 122 num_clusters-- 149 for i = 0; i < num_clusters; i++ { 154 return num_clusters 183 for j = 0; j < num_clusters; j++ { 195 for i = 0; i < num_clusters; i++ { 260 var num_clusters uint = 0 286 num_clusters += num_new_clusters [all …]
|
H A D | cluster_literal.go | 84 for idx1 = 0; idx1 < num_clusters; idx1++ { 92 for num_clusters > min_cluster_size { 115 for i = 0; i < num_clusters; i++ { 122 num_clusters-- 149 for i = 0; i < num_clusters; i++ { 154 return num_clusters 183 for j = 0; j < num_clusters; j++ { 195 for i = 0; i < num_clusters; i++ { 260 var num_clusters uint = 0 286 num_clusters += num_new_clusters [all …]
|
/dports/sysutils/jest/jest-f76bc46/vendor/github.com/andybalholm/brotli/ |
H A D | cluster_distance.go | 84 for idx1 = 0; idx1 < num_clusters; idx1++ { 92 for num_clusters > min_cluster_size { 115 for i = 0; i < num_clusters; i++ { 122 num_clusters-- 149 for i = 0; i < num_clusters; i++ { 154 return num_clusters 183 for j = 0; j < num_clusters; j++ { 195 for i = 0; i < num_clusters; i++ { 260 var num_clusters uint = 0 286 num_clusters += num_new_clusters [all …]
|
H A D | cluster_literal.go | 84 for idx1 = 0; idx1 < num_clusters; idx1++ { 92 for num_clusters > min_cluster_size { 115 for i = 0; i < num_clusters; i++ { 122 num_clusters-- 149 for i = 0; i < num_clusters; i++ { 154 return num_clusters 183 for j = 0; j < num_clusters; j++ { 195 for i = 0; i < num_clusters; i++ { 260 var num_clusters uint = 0 286 num_clusters += num_new_clusters [all …]
|
H A D | cluster_command.go | 84 for idx1 = 0; idx1 < num_clusters; idx1++ { 92 for num_clusters > min_cluster_size { 115 for i = 0; i < num_clusters; i++ { 122 num_clusters-- 149 for i = 0; i < num_clusters; i++ { 154 return num_clusters 183 for j = 0; j < num_clusters; j++ { 195 for i = 0; i < num_clusters; i++ { 260 var num_clusters uint = 0 286 num_clusters += num_new_clusters [all …]
|
/dports/devel/sentry-cli/sentry-cli-1.71.0/cargo-crates/brotli-sys-0.3.2/brotli/enc/ |
H A D | cluster_inc.h | 85 for (idx1 = 0; idx1 < num_clusters; ++idx1) { 94 while (num_clusters > min_cluster_size) { 114 for (i = 0; i < num_clusters; ++i) { 121 --num_clusters; 146 for (i = 0; i < num_clusters; ++i) { 151 return num_clusters; 179 for (j = 0; j < num_clusters; ++j) { 191 for (i = 0; i < num_clusters; ++i) { 253 size_t num_clusters = 0; 286 num_clusters += num_new_clusters; [all …]
|
/dports/archivers/py-brotlipy/brotlipy-0.7.0/libbrotli/enc/ |
H A D | cluster_inc.h | 85 for (idx1 = 0; idx1 < num_clusters; ++idx1) { 94 while (num_clusters > min_cluster_size) { 114 for (i = 0; i < num_clusters; ++i) { 121 --num_clusters; 146 for (i = 0; i < num_clusters; ++i) { 151 return num_clusters; 179 for (j = 0; j < num_clusters; ++j) { 191 for (i = 0; i < num_clusters; ++i) { 253 size_t num_clusters = 0; 286 num_clusters += num_new_clusters; [all …]
|
/dports/net/proby/proby-1.0.2/cargo-crates/brotli-sys-0.3.2/brotli/enc/ |
H A D | cluster_inc.h | 85 for (idx1 = 0; idx1 < num_clusters; ++idx1) { 94 while (num_clusters > min_cluster_size) { 114 for (i = 0; i < num_clusters; ++i) { 121 --num_clusters; 146 for (i = 0; i < num_clusters; ++i) { 151 return num_clusters; 179 for (j = 0; j < num_clusters; ++j) { 191 for (i = 0; i < num_clusters; ++i) { 253 size_t num_clusters = 0; 286 num_clusters += num_new_clusters; [all …]
|
/dports/www/miniserve/miniserve-0.18.0/cargo-crates/brotli-sys-0.3.2/brotli/enc/ |
H A D | cluster_inc.h | 85 for (idx1 = 0; idx1 < num_clusters; ++idx1) { 94 while (num_clusters > min_cluster_size) { 114 for (i = 0; i < num_clusters; ++i) { 121 --num_clusters; 146 for (i = 0; i < num_clusters; ++i) { 151 return num_clusters; 179 for (j = 0; j < num_clusters; ++j) { 191 for (i = 0; i < num_clusters; ++i) { 253 size_t num_clusters = 0; 286 num_clusters += num_new_clusters; [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/brotli/enc/ |
H A D | cluster_inc.h | 87 for (idx1 = 0; idx1 < num_clusters; ++idx1) { 96 while (num_clusters > min_cluster_size) { 116 for (i = 0; i < num_clusters; ++i) { 123 --num_clusters; 148 for (i = 0; i < num_clusters; ++i) { 153 return num_clusters; 181 for (j = 0; j < num_clusters; ++j) { 193 for (i = 0; i < num_clusters; ++i) { 255 size_t num_clusters = 0; 288 num_clusters += num_new_clusters; [all …]
|
/dports/emulators/qemu60/qemu-6.0.0/roms/edk2/MdeModulePkg/Library/BrotliCustomDecompressLib/brotli/c/enc/ |
H A D | cluster_inc.h | 87 for (idx1 = 0; idx1 < num_clusters; ++idx1) { 96 while (num_clusters > min_cluster_size) { 116 for (i = 0; i < num_clusters; ++i) { 123 --num_clusters; 148 for (i = 0; i < num_clusters; ++i) { 153 return num_clusters; 181 for (j = 0; j < num_clusters; ++j) { 193 for (i = 0; i < num_clusters; ++i) { 255 size_t num_clusters = 0; 291 num_clusters += num_new_clusters; [all …]
|
/dports/emulators/qemu60/qemu-6.0.0/roms/edk2/BaseTools/Source/C/BrotliCompress/brotli/c/enc/ |
H A D | cluster_inc.h | 87 for (idx1 = 0; idx1 < num_clusters; ++idx1) { 96 while (num_clusters > min_cluster_size) { 116 for (i = 0; i < num_clusters; ++i) { 123 --num_clusters; 148 for (i = 0; i < num_clusters; ++i) { 153 return num_clusters; 181 for (j = 0; j < num_clusters; ++j) { 193 for (i = 0; i < num_clusters; ++i) { 255 size_t num_clusters = 0; 291 num_clusters += num_new_clusters; [all …]
|
/dports/archivers/p5-IO-Compress-Brotli/IO-Compress-Brotli-0.004001/brotli/c/enc/ |
H A D | cluster_inc.h | 87 for (idx1 = 0; idx1 < num_clusters; ++idx1) { 96 while (num_clusters > min_cluster_size) { 116 for (i = 0; i < num_clusters; ++i) { 123 --num_clusters; 148 for (i = 0; i < num_clusters; ++i) { 153 return num_clusters; 181 for (j = 0; j < num_clusters; ++j) { 193 for (i = 0; i < num_clusters; ++i) { 255 size_t num_clusters = 0; 288 num_clusters += num_new_clusters; [all …]
|
/dports/archivers/py-brotli/Brotli-1.0.9/c/enc/ |
H A D | cluster_inc.h | 87 for (idx1 = 0; idx1 < num_clusters; ++idx1) { 96 while (num_clusters > min_cluster_size) { 116 for (i = 0; i < num_clusters; ++i) { 123 --num_clusters; 148 for (i = 0; i < num_clusters; ++i) { 153 return num_clusters; 181 for (j = 0; j < num_clusters; ++j) { 193 for (i = 0; i < num_clusters; ++i) { 255 size_t num_clusters = 0; 291 num_clusters += num_new_clusters; [all …]
|
/dports/archivers/brotli/brotli-1.0.9/c/enc/ |
H A D | cluster_inc.h | 87 for (idx1 = 0; idx1 < num_clusters; ++idx1) { 96 while (num_clusters > min_cluster_size) { 116 for (i = 0; i < num_clusters; ++i) { 123 --num_clusters; 148 for (i = 0; i < num_clusters; ++i) { 153 return num_clusters; 181 for (j = 0; j < num_clusters; ++j) { 193 for (i = 0; i < num_clusters; ++i) { 255 size_t num_clusters = 0; 291 num_clusters += num_new_clusters; [all …]
|
/dports/devel/apitrace/apitrace-9.0/thirdparty/brotli/c/enc/ |
H A D | cluster_inc.h | 87 for (idx1 = 0; idx1 < num_clusters; ++idx1) { 96 while (num_clusters > min_cluster_size) { 116 for (i = 0; i < num_clusters; ++i) { 123 --num_clusters; 148 for (i = 0; i < num_clusters; ++i) { 153 return num_clusters; 181 for (j = 0; j < num_clusters; ++j) { 193 for (i = 0; i < num_clusters; ++i) { 255 size_t num_clusters = 0; 288 num_clusters += num_new_clusters; [all …]
|
/dports/emulators/qemu42/qemu-4.2.1/roms/edk2/BaseTools/Source/C/BrotliCompress/enc/ |
H A D | cluster_inc.h | 87 for (idx1 = 0; idx1 < num_clusters; ++idx1) { 96 while (num_clusters > min_cluster_size) { 116 for (i = 0; i < num_clusters; ++i) { 123 --num_clusters; 148 for (i = 0; i < num_clusters; ++i) { 153 return num_clusters; 181 for (j = 0; j < num_clusters; ++j) { 193 for (i = 0; i < num_clusters; ++i) { 255 size_t num_clusters = 0; 288 num_clusters += num_new_clusters; [all …]
|
/dports/emulators/qemu/qemu-6.2.0/roms/edk2/BaseTools/Source/C/BrotliCompress/brotli/c/enc/ |
H A D | cluster_inc.h | 87 for (idx1 = 0; idx1 < num_clusters; ++idx1) { 96 while (num_clusters > min_cluster_size) { 116 for (i = 0; i < num_clusters; ++i) { 123 --num_clusters; 148 for (i = 0; i < num_clusters; ++i) { 153 return num_clusters; 181 for (j = 0; j < num_clusters; ++j) { 193 for (i = 0; i < num_clusters; ++i) { 255 size_t num_clusters = 0; 291 num_clusters += num_new_clusters; [all …]
|
/dports/emulators/qemu5/qemu-5.2.0/roms/edk2/MdeModulePkg/Library/BrotliCustomDecompressLib/brotli/c/enc/ |
H A D | cluster_inc.h | 87 for (idx1 = 0; idx1 < num_clusters; ++idx1) { 96 while (num_clusters > min_cluster_size) { 116 for (i = 0; i < num_clusters; ++i) { 123 --num_clusters; 148 for (i = 0; i < num_clusters; ++i) { 153 return num_clusters; 181 for (j = 0; j < num_clusters; ++j) { 193 for (i = 0; i < num_clusters; ++i) { 255 size_t num_clusters = 0; 291 num_clusters += num_new_clusters; [all …]
|