Skip to content

P
purescript-gargantext
Commit 90f53112 authored by Karen Konou's avatar Karen Konou
Browse files
Options

[Graph] Remove node limit in clusters in legend

parent 3175cde4
Pipeline #6668 passed with stages
      in 24 minutes and 25 seconds
      Show whitespace changes
      Inline Side-by-side
      Showing with 2 additions and 8 deletions
      src/Gargantext/Components/GraphExplorer/Sidebar.purs
      View file @ 90f53112
      ...@@ -130,10 +130,6 @@ sideTabLegendCpt = here.component "sideTabLegend" cpt where ...@@ -130,10 +130,6 @@ sideTabLegendCpt = here.component "sideTabLegend" cpt where
      legend' /\ legendBox <- R2.useBox' legend legend' /\ legendBox <- R2.useBox' legend
      -- | Computed
      -- |
      let
      maxItemPerCluster = 4
      -- | Hooks -- | Hooks
      -- | -- |
      ...@@ -144,7 +140,6 @@ sideTabLegendCpt = here.component "sideTabLegend" cpt where ...@@ -144,7 +140,6 @@ sideTabLegendCpt = here.component "sideTabLegend" cpt where
      ( getter _.id_ ( getter _.id_
      >>> GEU.takeGreatestNodeByCluster >>> GEU.takeGreatestNodeByCluster
      hyperdataGraph hyperdataGraph
      maxItemPerCluster
      ) )
      -- For each provided Cluster (see Legend), count the number of nodes -- For each provided Cluster (see Legend), count the number of nodes
      ......
      src/Gargantext/Components/GraphExplorer/Utils.purs
      View file @ 90f53112
      ...@@ -78,8 +78,8 @@ normalizeNodeSize minSize maxSize ns = over traversed (over sizeLens (\s -> minS ...@@ -78,8 +78,8 @@ normalizeNodeSize minSize maxSize ns = over traversed (over sizeLens (\s -> minS
      ------------------------------------------------------------------------ ------------------------------------------------------------------------
      takeGreatestNodeByCluster :: GET.HyperdataGraph -> Int -> Int -> Array GEGT.Node takeGreatestNodeByCluster :: GET.HyperdataGraph -> Int -> Array GEGT.Node
      takeGreatestNodeByCluster graphData take clusterId takeGreatestNodeByCluster graphData clusterId
      = graphData = graphData
      # getter _.graph # getter _.graph
      >>> getter _.nodes >>> getter _.nodes
      ...@@ -91,7 +91,6 @@ takeGreatestNodeByCluster graphData take clusterId ...@@ -91,7 +91,6 @@ takeGreatestNodeByCluster graphData take clusterId
      >>> A.sortWith >>> A.sortWith
      ( getter _.size ( getter _.size
      ) )
      >>> A.takeEnd take
      >>> A.reverse >>> A.reverse
      countNodeByCluster :: GET.HyperdataGraph -> Int -> GEGT.ClusterCount countNodeByCluster :: GET.HyperdataGraph -> Int -> GEGT.ClusterCount
      ......
      Markdown is supported
      0% or
      You are about to add 0 people to the discussion. Proceed with caution.
      Finish editing this message first!
      Please register or to comment