-
when using Spark's cross validation api to search `round` , every experiment is started from iteration 0 which is costly and unnecessary for gbm
-
We currently use `std::map` for `Mul`s. Since a typical `Mul` has just a few factors, it probably doesn't matter at all.
However, for `Add`s, the standard `std::map` seems slower than `std::unordered…
-
To reproduce:
- use file search to search e.g. for *.java files
- using the search result tree view, select a few projects in the search results and hit DELETE
- now all subsequent delete or naviga…
-
# Describe the bug
When editing a tree and using the search facilities, there should be an indication that there are more items than what has been listed. Currently, an admin may be fooled into …
-
- See also https://github.com/search?q=maven+dependency+tree&type=repositories
- Note that the `mvn dependency:tree` command would typically process all pom.xml in the codebase at once, and would ge…
-
-
For big text, it can generate huge Json and is painful to navigate. Ability to search and fold the json nodes would be much helpful in consuming that info.
-
The code for the KD tree seems to have an issue, as it only searches for leaf nodes without any fallback steps
-
```
When I 'search' somethin on the right side, the main notes and trees are
filtered to show the result. Very convenient. But how do I reset to show all
the tree nodes and notes?
```
Original issu…
-
When searching for datasets within the portal, I want to have filtering options and quick access to recent searches,
so that I can easily narrow down search results and quickly revisit my previous sea…