You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
If a list of names is too long, we could divide it in smaller chunks and call the service several times. Like that we won't choke it. I did this for some datelife functions, see issue phylotastic/datelife#39
Do this with the name retrieval services (not possible for trees). Divide input list into N sets of up to 1000, then loop from 1 to N, getting the names 1000 at a time.
The text was updated successfully, but these errors were encountered:
If a list of names is too long, we could divide it in smaller chunks and call the service several times. Like that we won't choke it. I did this for some datelife functions, see issue phylotastic/datelife#39
Do this with the name retrieval services (not possible for trees). Divide input list into N sets of up to 1000, then loop from 1 to N, getting the names 1000 at a time.
The text was updated successfully, but these errors were encountered: