IP : 18.218.200.164Hostname : host45.registrar-servers.comKernel : Linux host45.registrar-servers.com 4.18.0-513.18.1.lve.2.el8.x86_64 #1 SMP Sat Mar 30 15:36:11 UTC 2024 x86_64Disable Function : None :) OS : Linux
PATH:
/
home/
../
home1/
../
lib64/
libzstd.so.1/
/
?�������?���������������?�����������������������?���Breaking content into %u epochs of size %u Total samples size is too large (%u MB), maximum size is %u MB Total number of training samples is %u and is invalid.Total number of testing samples is %u and is invalid.Training on %u samples of total size %u Testing on %u samples of total size %u Failed to allocate scratch buffers Constructing partial suffix array WARNING: The maximum dictionary size %u is too large compared to the source size %u! size(source)/size(dictionary) = %f, but it should be >= 10! This may lead to a subpar dictionary! We recommend training on sources at least 10x, and preferably 100x the size of the dictionary! Cover must have at least one input file dictBufferCapacity must be at least %u Failed to allocate dmer map: out of memory Constructed dictionary of size %u Failed to allocate buffers: out of memory Trying %u different sets of parameters Failed to allocate parameters
%u%% %79s Computing frequencies Cover parameters incorrect Building dictionary Failed to select dictionary Incorrect parameters d=%u Failed to initialize context k=%u �?$@Y@dictBuilder/divsufsort.cssize < STACK_SIZE0 <= ssizeT[s] == c1T[s - 1] <= T[s]k < jk != NULLT[s - 1] >= T[s]i < ks < 0((s + 1) < n) && (T[s] <= T[s + 1])((s == 0) && (T[s] == c1)) || (s < 0)construct_BWT_indexesconstruct_BWTconstruct_SAtr_introsortss_mintrosortss_swapmerge #'*-02579;=@ACEGIKLNPQSTVWYZ[]^`abcefghjklmnpqrstuvwxyz{|}~����������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������Total number of training samples is %u and is invalid Total number of testing samples is %u and is invalid. Failed to allocate scratch buffers Failed to allocate frequency table FASTCOVER parameters incorrect FASTCOVER must have at least one input file Incorrect splitPoint Incorrect accel Incorrect k dd2"
%70s statistics ... finding patterns ... minimum ratio : %u
%4.2f %% list %u best segments | warning : ZSTD_compressBegin_usingCDict failed warning : could not compress sample size %u warning : pathological dataset : literals are not compressible : samples are noisy or too regular FSE_normalizeCount error with offcodeCount FSE_normalizeCount error with matchLengthCount FSE_normalizeCount error with litLengthCount FSE_writeNCount error with offcodeNCount FSE_writeNCount error with matchLengthNCount FSE_writeNCount error with litlengthNCount not enough space to write RepOffsets found %3u matches of length >= %i at pos %7u Selected dict at position %u, of length %u : saves %u (ratio: %.2f) sample set too large : reduced to %u MB ... sorting %u files of total size %u MB ...
%u segments found, of total size %u %3u:%3u bytes at pos %8u, savings %7u bytes |! warning : selected content significantly smaller than requested (%u < %u) ! consider increasing the number of samples (total size : %u MB) ! consider increasing selectivity to produce larger dictionary (-s%u) ! note : larger dictionaries are not necessarily better, test its efficiency on samples ! note : calculated dictionary significantly larger than requested (%u > %u) ! consider increasing dictionary size, or produce denser dictionary (-s%u) ! always test dictionary efficiency on real samples ����̊����������������������7���7���'�������������������������������������v���k���`���m���m���\���P���D���8���,��� ���+���+���������������ޯ��Я��Ͱ��Ͱ��������������������������B���B���1���%������ ��������������������ظ����¸����������N��N��?��4��)��������|��|��l��`��T��H��<��0�������������������������������w��l��a��V��K����������������������������P���0���������������p��� @� @� @� ?@�&�!Jg&��IJ�),�IJ�/���J� 5s��J� =���K> D��MK� K���M MS�#Q�T��K W�X��o ]#TE�T j�j��v |N|��c���L���L���>���0���"��������������L��XM��2M���M���N��