[tune] Refactor search algorithms (#7037)

* start refactoring of search algorithms

* format

* needs tests

* fix

* suggestions

* Fix PBT

* lint

* refactoring

* hyperopt_working

* dragonfly

* hyperopt

* change_half_of_algs

* save

* code-removed

* remove_lots_of_unneccessary

* changes

* formatting

* suggest

* reset

* rm

* tests

* search-change

* exception

* refactor-doc

* search

* py

* moredocs

* Update doc/source/tune-searchalg.rst

* concurrency

* max

* tune

* betterwarning

* bohb

* tests

* test-change

Co-authored-by: ujvl <misraujval@gmail.com>

python/ray/tune/examples/hyperopt_example.py

@@ -28,7 +28,7 @@ if __name__ == "__main__":
     parser.add_argument(
         "--smoke-test", action="store_true", help="Finish quickly for testing")
     args, _ = parser.parse_known_args()
-    ray.init()
+    ray.init(configure_logging=False)
 
     space = {
         "width": hp.uniform("width", 0, 20),
@@ -60,7 +60,6 @@ if __name__ == "__main__":
     }
     algo = HyperOptSearch(
         space,
-        max_concurrent=4,
         metric="mean_loss",
         mode="min",
         points_to_evaluate=current_best_params)