Benka

Hello Same Issue here... My fms15 doesn't reach my fms14 :-(

Hello Thank you all for your answers! Sorry for the response time I'm in France. I'll try to implement a duplicate management in this function.

Hello I'm trying to produce a list of all possible unique consecutive combinations from another list. The order does matter. For example: combinaisons_uniques (a, b, c, d) will return a,b,c,d a,b,c a,b a b,c,d b,c b c,d c d any Idea?

:goodpost: It works! Thanks a lot! :thankyou:

Thanks. But there is a problem. With 4 items, there are 15 combinations, but with 7 items, there are 127 combinations... I'm trying to make a custom function to do this.

no, it could be from 2 to 10 items in the list. I found a java source : http://stackoverflow.com/questions/403865/algorithm-to-sum-up-a-list-of-numbers-for-all-combinations http://www.briandunning.com/cf/1023 unique_combinations_counter (number_values)

the real problem is that i don't know how to do... :-(

Hello I'm trying to produce a list of all possible unique combinations from another list. The order does not matter. For example: combinaisons_uniques (a, b, c, d) will return : a, b, c, d a, b, c a, b, d a, b a, c a, d a, c, d b, c, d b, c b d b c, d c d any Idea?

Thanks The Shadow! :thanks: I'm gonna try to understand what you did It seem to be very clever!

You don't use any matrix?

:waytogo: http://en.wikipedia.org/wiki/Levenshtein_distance Yes, if it were reversed, ie, "GAMBOL" ; "GUMBO", it would be still equal 2

Hi I'd like to create a function working like this : LevenshteinDistance ( "madonna";"modanna") = 2 LevenshteinDistance ( "GUMBO";"GAMBOL") = 2 LevenshteinDistance ( "ZXRZYXX";"ZXRZZZXZZ") = 4 like this : http://www.merriampark.com/ld.htm

Hello everyone I'd like to implement a function in Filemaker Advanced 10 would calculate the Levenshtein distance between 2 words ( the Levenshtein distance is a metric for measuring the amount of difference between two sequences). For example, the distance between "Madonna" and "Modanna" is 2. There is a good article on wikipedia: http://en.wikipedia.org/wiki/Levenshtein_distance Unfortunately, I didn't find this feature in BrianDunning and others :-( If anyone has a solution, I'm interested :-)

Hi How would you to extract a string between "TxtC" an "TxtA" ("TxtB") with a function like this one Function ( "TxtA TxtA TxtA TxtB TxtC TxtA"; "TxtC" ; 1 ; "TxtA" ; 1 ) -> "TxtB" ? Thanks!