h& /(      !"#$%&'(c) Oleksandr Zhabenko 2023MIToleksandr.zhabenko@yahoo.com Experimental Safe-Inferred (c) Oleksandr Zhabenko 2022-2023MIToleksandr.zhabenko@yahoo.com Experimental Safe-Inferredrhythmic-sequencesData type to encode the changes that are introduced by the position of the group of values in general sequence to the general result of the  createHashesG+ function. If the second parameter in the  is 1 then the result is more sensitive to beginning of the line; if it is set to 2 then the result is more sensitive to ending of the line; if it is greater than 2 then the result is sensitive to some user weights provided as the first parameter to  and otherwise the computation result does not depend on the first parameter to  (this one can be considered the basic option for the computation).rhythmic-sequencesData type to contain the needed for hashing algorithm information about the sorted 'array sorting with its indices'. rhythmic-sequencesData type used to provide somewhat 'array sorting with its indices'.rhythmic-sequencesThe similar function is since  base-4.16.0.0 in the Numeric module. Is not used further, is provided here mostly for testing purposes.rhythmic-sequences'Basic counting of the same bits in the ( arguments.rhythmic-sequencesSome idea function to evaluate the rhythmicity data. Is not used further in the package, can be thought of as an alternative way of computation.rhythmic-sequencesSplit the list into lists of n elements where n is the first parameter.rhythmic-sequencesFunction to get basic data for hash-based evaluation of the rhythmicity of the list data. Is used internally in the -. Provided here mostly for testing purposes.rhythmic-sequencesConvert hashes into basic simler data to evaluate rhythmicity of the list data.rhythmic-sequencesMostly for testing.rhythmic-sequences If the second parameter in the  is 1 then the result is more sensitive to beginning of the line; if it is set to 2 then the result is more sensitive to ending of the line; if it is greater than 2 then the result is sensitive to some user weights provided as the first parameter to  and otherwise the computation result does not depend on the first parameter to  (this one can be considered the basic option for the computation).rhythmic-sequencesIf you would like to specify just your own values then specify the ) "a..." where 'a' here means the minus sign '-' or some not equal to 1 or 2 digit, instead of dots specify some digits that are the beginning of the [* ] list in . If 'a' is '-', then the next not equal to 'a' symbol should be some digit not equal to 1 or 2 if you want to specify your own list of [Int8] for . Caution:  %readHashCorrections . show $ xs /= xs %show . readHashCorrections $ xs /= xs&in general case. The default value is  H [0,0..] 0(. This one corresponds to usage of the  without any corrections (equi-sensitive to all the parts of the line except probably the last syllables if the number of syllables is not wholely divisible without remainder to the groupLength parameter in the  function).rhythmic-sequences>This is used to provide the second and the third arguments to ! function. The default value is  (4,[3,2]). This means that the line is divided into groups of 4-syllables then there are searched for rhythmic repetitions of the positions of the most maximum values and the less maximum values. This scheme should is related to disyllables metrical feet for SaaW (syllables-as-a-whole) mode of operation for PhLADiPreLiO (see:  https://oleksandrzhabenko.github.io/uk/rhythmicity/PhLADiPreLiO.Eng.21.html#SaaW)?. For more information on the metrical feet you can see e. g. @article{kagerfeet, title={Feet and metrical stress}, author={Kager, Rene}, journal={This page intentionally left blank}, pages={195} }rhythmic-sequencesGeneral implementation of the hash-based algorithm to evaluate the level of rhythmicity of the list data. The relatively greater result (for PhLADiPreLiO) corresponds to greater detected periodicity.rhythmic-sequencesProvided for testing.rhythmic-sequencesGeneral implementation of the second hashing of the data for the algorithm.rhythmic-sequencesA variant of the $ that actually must be equal to the  for the second argument lists with less than 8 elements. For greater values is not correctly defined, so do not use it for the lists with 8 or more elements in them. Actually should be equal to  for the second argument.rhythmic-sequences?Function to filter the elements by the second parameter of the ' data and then to get the first ones.rhythmic-sequencesFunction to create bitwise representation of the intermediate data for the algorithm. Should be very optimized to run fast.rhythmic-sequences&The alternative implementation of the  (on the Linux x86_64 for some CPU is slower than the former one).rhythmic-sequencesA period of the groups (the length of the lists into which the general sequence is splitted at first).rhythmic-sequencesThe list must be sorted in the descending order, the elements must be greater or equal to 0 and less than the first argument of  here; besides, there must not be repetitions (any duplicates) in the list so all the elements must be pairwise not equal. rhythmic-sequences A list of +; data values that is evaluated for its rhythmic properties.rhythmic-sequencesData that specifies how the arguments influence the result. Somewhat the kernel of the  computation.rhythmic-sequences-The period of the length of the initial list.rhythmic-sequencesList of ordinary positions of the maximum-minimum levels for values of the list in the group. The length of the unique elements together in the list is expected to be in the list [1..7].     ,      !"#$%&'()*+,-+./+0123451rhythmic-sequences-0.2.2.0-Au3iPdRrj8AG1TtgshttrCRhythmicity.BasicFRhythmicity.MarkerSeqs hashPosLF2hashBalancingLF2 hashBasicLF2HashCorrectionsHASort3As3id3orDval3Sort2S2idvalshowBin unionCountcountWeightsQssplitF getHashes2countHashesPrioritized count1HasheshashCorrections2FhashListreadHashCorrections grouppingR countHashesG createNewHash createHashG createNHashidListtoNumtoNum2 $fShowSort2$fFunctorSort2 $fOrdSort2 $fEqSort2 $fShowASort3 $fEqASort3$fEqHashCorrections$fShowHashCorrectionsbaseGHC.BitsBits Text.Read.LexLexemeGHC.IntInt8ghc-prim GHC.ClassesOrd