Roald Baudoux

Is there any external or Jitter object up to the task ?

Peter Elsea's Lclose is limited to lists up to 256 items while I'd like to go up to 1000 items.

finding-the-item-closest-to-an-incoming-float-in-a-list-with-size-256-items

How about this? You can replace it by using zl in various flavours. Add in a patcherargs and you could make it more useful.

Seeing as I saved this myself for future use, I'll post it here. I've put patcherargs in so it works as an object, trimmed down a few objects that weren't strictly needed and added an additional outlet that gives you the index of the closest float. You can change the maximum size by sending 'maxsize 512' etc.

I also restored my memory of the abs object...

here is a version with less objects (might be faster, I don't know)

Thanks for those abstractions. Nice tricks.

I simplified a bit further Timo's version.

Also, I wanted it the other way: the float triggers.

I always wonder about the number of objects vs. complex objects decision. In the interests of experimentation, I tested the two different methods here (using pedant), and my method was a tiny bit faster on average (0.00152). Not in any way significant, unless you were performing the operation thousands of times a second, but it is interesting to know.

By the way I repost because there was a bug in the former one.

Congratulations, your method is now faster by around 0.002ms! Do we have any other challengers?

however, i am making chords, and i dont need two of the same numbers. if value being checked is the same as a value in the list, the output is the same as the input. (lets say, the integer 30 compared to a list of [1 10 30 100] will give me 30, but i would want it to give me 10 instead. 29 would give me 30)

do you have any ideas on how to make the closest number output =! to the value being checked? so that it skips to the next nearest neighbour?

that way you will never get the input will never be the same as the output...

Hello, I am reviving this old thread because I've just learned that Lobjects's last generation has a @maxlistsize attribute to adapt the objects to any list size (get the objects from Peter Elsea's retirement home page).

Finding the item closest to an incoming float in a list with size > 256 items ?