SLUGIFY

Now that's cool.

Jon Peltier said:

Now that's cool.

Click to expand...

Isn't it? I really love Lambda function!

The second parameter is actually only a counter, but Lambda doesn't support optional parameters which is actually not a big deal to implement. So it looks like we have to add it to the function to create a loop like this.
There is a suggestion in Excel.Uservoice that I also commented, but who knows when they will consider implementing that.

I suppose you could use a wrapper function SLUGIFY(A1) which called the real Lambda(reference, ndx) function

Jon Peltier said:

I suppose you could use a wrapper function SLUGIFY(A1) which called the real Lambda(reference, ndx) function

Click to expand...

You mean the following, right?


I didn't quite like that it requires an additional function definition, but it is actually a great solution until Microsoft allows optional parameters.

I originally wanted to create a recursive function to demonstrate a simple "for-next" implementation. However, it is also possible to create a non-recursive version.
A slightly modified version that uses validchar variable for readability.


Note: We can't use AND/OR functions here since these functions will aggregate the results and return a single value instead of an array when they are used with an array function. So we should simply use boolean math, */+ equivalent for AND and OR respectively.

Posted a new Lambda function demonstrating how to create and use subroutines in a Lambda function.

In SLUGIFY.PLUS function, I am redirecting the process to a subroutine to clean the multiple adjacent dashes in the final slug by using an additional recursion instead of using the SUBSTITUTE function that actually cannot clean all possible adjacent dashes.

Interesting.

You can Simplify LEFT(phrase, ndx-1) & IF(OR(AND(charcode>97,charcode<123), AND(charcode>47,charcode<58)), char, "-") & RIGHT(phrase, LEN(phrase)-ndx)) to Simply IF((ABS(charcode-109.5)<=12.5)+(ABS(charcode-52.5)<=4.5), char, REPLACE(phrase, ndx, 1, "-"))

Thanks for the non-recursive LAMBDA too!

Great recursive function smozgur !! I think it was the very first one on this forum.
As much as I love recursive functions, nowadays, with the amazing new lambda helper functions, we can replace their functionality in even more efficient ways.
To be more exact, every recursive design based on a determined nr. of iterations beforehand (like nr. of chars in a string) can be replaced with a lambda helper function.
The only recursive functions that will survive are the ones on which the nr. of iterations is undermined and only when the exit condition is met, will deliver the result.
Even those can be tricked with helper functions, but they will never be as "elegant" as the recursive ones.

Back to the chase, here we need to identify digits and lower letters, which can be done with their character code values and comparison operations.
What if we need to also keep the upper letters, this implies even more comparison operations, no matter how much they can be simplified.
What if we need to keep any letter from whatever alphabet, we cannot rely on char codes anymore.
There is a simpler universal way to identify a letter from any alphabet, lower or upper case, which is:
A letter is a character that has different values between its lower- and upper-case values.
On other words, for a letter "x" the formula =EXACT(LOWER(x),UPPER(x)) will return FALSE
If returns TRUE could be a digit or a symbol. Digits are numbers. So, a symbol is a non-number and a non-letter.

Using this approach and replacing recursive functionality with MAP, here is an alternative function for entire column vector input data.
Also, the first variable after LET, "g", is the dash char "-" ; LET(g,"-", ......
If we need underscore char "_" we can change it with ease.
The function can handle any distribution of dash chars or any other distribution of symbols, located anywhere trough the strings, beginning, end, middle.

AMSLG(a) Array MAP SLuGify
a: column vector (1D vertical array)

Nice one, @Xlambda!
Thanks for sharing!