Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
H
haskell-gargantext
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Przemyslaw Kaminski
haskell-gargantext
Commits
30031300
Commit
30031300
authored
Apr 27, 2021
by
Alexandre Delanoë
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
[FIX] Data.List needs to be qualified for future GHC upgrade
parent
8d3ac246
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
5 additions
and
5 deletions
+5
-5
User.hs
src/Gargantext/Prelude/Crypto/Pass/User.hs
+5
-5
No files found.
src/Gargantext/Prelude/Crypto/Pass/User.hs
View file @
30031300
...
...
@@ -22,7 +22,7 @@ import Data.Text (Text)
import
Data.String
(
String
)
import
Control.Monad
import
Control.Monad.Random
import
Data.List
hiding
(
sum
)
import
qualified
Data.List
as
List
-- | 2) Easy password manager imports
import
Gargantext.Prelude
...
...
@@ -35,7 +35,7 @@ import Gargantext.Prelude.Utils (shuffle)
gargPass
::
MonadRandom
m
=>
m
Text
gargPass
=
cs
<$>
gargPass'
chars
33
where
chars
=
zipWith
(
\\
)
charSets
visualySimilar
chars
=
zipWith
(
List
.
\\
)
charSets
visualySimilar
charSets
=
[
[
'a'
..
'z'
]
,
[
'A'
..
'Z'
]
...
...
@@ -49,7 +49,7 @@ gargPass' :: MonadRandom m => [String] -> Int -> m String
gargPass'
charSets
n
=
do
parts
<-
getPartition
n
chars
<-
zipWithM
replicateM
parts
(
uniform
<$>
charSets
)
shuffle'
(
concat
chars
)
shuffle'
(
List
.
concat
chars
)
where
getPartition
n'
=
adjust
<$>
replicateM
(
k
-
1
)
(
getRandomR
(
1
,
n'
`
div
`
k
))
k
=
length
charSets
...
...
@@ -59,7 +59,7 @@ shuffle' :: (Eq a, MonadRandom m) => [a] -> m [a]
shuffle'
[]
=
pure
[]
shuffle'
lst
=
do
x
<-
uniform
lst
xs
<-
shuffle
(
delete
x
lst
)
xs
<-
shuffle
(
List
.
delete
x
lst
)
return
(
x
:
xs
)
...
...
@@ -84,5 +84,5 @@ getRandomIndex list = randomRIO (0, (length list - 1))
getRandomElement
::
[
b
]
->
IO
b
getRandomElement
list
=
do
index
<-
(
getRandomIndex
list
)
pure
(
list
!!
index
)
pure
(
list
List
.
!!
index
)
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment