-
Notifications
You must be signed in to change notification settings - Fork 2k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Duplicate Wifi networks #26
Comments
👍 This becomes a bit more complicated quickly as there could be some secure some open, different signal levels so you gotta max the best one for display, maybe also show the count (n) so you know it is a institutional AP. It almost becomes easier to do in js. |
it would be easier to do in js... maybe it s worth considering, as then you would only have to pass the array to js, and a progmem string containing the actual js... what i m mostly worried about is uncontrolable growth and memory usage with this, which is not justified in my mind as you are really only using the lib once in a blue moon to make your life easier, but decreases resources on your ESP at all times... |
i am close this, don t think there s a big need for it really |
Im gonna pr it regardless |
:)) |
@tablatronix Shawn, i just have a thought. |
I was gonna just do another n2 loop and remove them but only if there are duplicates detected, but I noticed you changed your sort loop to std::sort comparison Is it any faster ? I guess a map might work, I barely know C though and had a hard time trying to modify references in a lambda. shrug. I was also going to use the sort loop to check if there was any dups before bothering another loop. Ill look at the JS solution again since you added that callout. |
welcome to the club, i barely know c as well :) js would be interesting, maybe with a count as well, but that would probably waste the most memory as well... |
yeah i looked at a hash table and it was not worth even looking at for memory, the extra microsecond for a n2 loop was better, for eg i have 22 duplicate network at this one location, more elsewhere. hmm but there will probably only ever be 1 or 2 duplicate ids... |
Well it looks like std::sort uses quicksort and is around 30% faster in my real world test. |
I added Adds 7ms to my code, for 22 dups. negligible. |
Cool :-) |
that s perfect, will pull it in a bit later and add the toggle for it boy you ve got lots of networks :)) |
Hello, when scanning in our company all Wifi networks are listed 2-3 times.
I didn't had the chance for further investigation; but I assume following reason... We have several access points providing the same Wifi network. Means we can use network XYZ inside the whole building on all floors. So, assumption is that a Wifi network is getting listed multiple times if multiple access points are in range.
Is there a chance putting all items with the same name together?
Thanks, JC
The text was updated successfully, but these errors were encountered: