[Seedpool] refactor construct

Author: bongjunj

src/seedpool.ml

@@ -343,32 +343,31 @@ let compute_init_cov seeds =
     (fun accu seed -> EdgeCoverage.union accu seed.Seed.edge_cov)
     EdgeCoverage.empty seeds
 
+let make_pool_and_cov seeds =
+  let open Coverage in
+  let pool = create () in
+  seeds |> List.to_seq |> add_seq pool;
+  let init_cov = compute_init_cov seeds in
+  (pool, init_cov)
+
 let evaluate_seeds_and_construct_seedpool raw_seeds node_tbl distmap =
   let open AUtil in
   let open Coverage in
-  let pool = create () in
-  if is_optimuzz_base () then (
+  if is_optimuzz_base () then
     let _, seeds = classify_seeds node_tbl distmap raw_seeds in
-    let init_cov = compute_init_cov seeds in
-    seeds |> List.to_seq |> add_seq pool;
-    (pool, init_cov))
+    make_pool_and_cov seeds
   else
     let cover_seeds, noncover_seeds =
       classify_seeds node_tbl distmap raw_seeds
     in
     if cover_seeds = [] then (
       L.info "No covering seeds found. Using closest seeds.";
       let pool_closest = closest_seeds noncover_seeds in
-      let init_cov = compute_init_cov pool_closest in
-      pool_closest |> List.to_seq |> add_seq pool;
-      (pool, init_cov))
+      make_pool_and_cov pool_closest)
     else (
-      (* if we have covering seeds, we use covering seeds only. *)
       L.info "Covering seeds found. Using them only.";
       let sorted_seeds = cover_seeds |> List.sort_uniq compare_score in
-      let init_cov = compute_init_cov sorted_seeds in
-      sorted_seeds |> List.to_seq |> add_seq pool;
-      (pool, init_cov))
+      make_pool_and_cov sorted_seeds)
 
 let make llctx node_tbl (distmap : float Coverage.DistanceTable.t) =
   let open AUtil in
@@ -426,6 +425,4 @@ let make llctx node_tbl (distmap : float Coverage.DistanceTable.t) =
     |> List.filter_map preprocess_seed
   in
 
-  let pool = evaluate_seeds_and_construct_seedpool seeds node_tbl distmap in
-
-  pool
+  evaluate_seeds_and_construct_seedpool seeds node_tbl distmap