Dobby | friendly Admin Elf , takes care | Content Management System library

Basically you can change the order of a and b sort params depending on the order param you pass to your custom function. Then also based on the type of current param (string or number) you use different types of sort method.

Try substitute lighttpd in your script with the full path to it, i.e. what prints when you run which lighttpd. For example, if which lighttpd prints /usr/sbin/lighttpd, your script should be like this:

You definately need it to be recursive to drill into deeply nested objects. But there are actually two conditional tests you need to do:

1. Is this a key that should be replaced? You are already doing this.
2. Is this value an object that needs to be recursed into? If so, recurse, else we just return its type unaltered.

Your two attempts each do half of this. You need to combine them into a nested conditional type that does both checks.

You can simply force nest data into a sub-array, and then flatten it using Array.prototype.flat:

• When data is an array, [data] will be an array with a single element that is also an array, so Array.flat will flatten it into an array
• When data is a string, [data] will be an array of string, and Array.flat will preserve the way it is

find_by returns a single object(or nil) on which you are trying to iterate with each, which is supposed to work on enumerables.

You can change the block to