nanoid-hs

KO | EN

gitlite — search

#javascript #python #react #ai #nodejs #macos #java #windows #cli #kubernetes #pytorch #security #openai #open-source

(★ 20)

Haskell implementation of Nanoid, secure URL-friendly unique ID generator.

nanoid-hs 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# nanoid-hs

[![Build Status](https://travis-ci.org/4e6/nanoid-hs.svg?branch=master)](https://travis-ci.org/4e6/nanoid-hs)

Nanoid package is an implementation of [ai/nanoid](https://github.com/ai/nanoid)
in Haskell.

> Nanoid is a tiny, secure, URL-friendly, unique string ID generator

```haskell
$ cabal new-repl
GHCi, version 8.2.2: http://www.haskell.org/ghc/  :? for help
[1 of 1] Compiling Nanoid           ( Nanoid.hs, interpreted )
Ok, one module loaded.
*Nanoid> generate [10..20] url 5
"89abc"

*Nanoid> generate <$> randomsIO <*> pure "abcd" <*> pure 4
"dabb"

*Nanoid> generate <$> randomsIO <*> pure url <*> pure 21
"1xfg7ez1WL7r6jinFzTsy"
```

The core nanoid
[generator](https://github.com/ai/nanoid/blob/f2dc36fc83785f0d132f364769cb6e0f6ba7f083/format.js)
function is the point of our interest. The goal of this project is not to
implement a UID generator in Haskell, but to replicate the original nanoid's
algorithm. We'll see how to express imperative language constructs like
variables, mutation, and for-loops in Haskell and get additional guarantees
about the stateful program. The ultimate idea is to show that functional
language can be as practical as an imperative one, but with a much higher
expressiveness that allows writing programs in different styles.

This package is written as an article in a documentation to the
[Nanoid.hs](Nanoid.hs) module, and serves purely educational purposes. I
choosed `ai/nanoid` because it is a useful real-world program, it is small, it
has mutability and side effects, and it already has been ported to [other
programming lanugages](https://github.com/ai/nanoid#other-programming-languages).

The technique which I used is not new and was described in
[Lazy functional state threads](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.2237)
paper.

You can also check [Imperative Hakskell](http://vaibhavsagar.com/blog/2017/05/29/imperative-haskell/)
blog post on this topic. It uses the same approach to convert classic CS algorightms to Haskell.

## Build

All the examples are runnable from GHCi REPL provided by the awesome
Cabal new build infrastructure.

```
$ cabal new-repl
In order, the following will be built (use -v for more details):
 - nanoid-hs-0.1.0.0 (lib) (file Nanoid.hs changed)
Preprocessing library for nanoid-hs-0.1.0.0..
GHCi, version 8.2.2: http://www.haskell.org/ghc/  :? for help
[1 of 1] Compiling Nanoid           ( Nanoid.hs, interpreted )
Ok, one module loaded.
*Nanoid>
```

Generate HTML version of the package documentation with:

```
$ cabal new-haddock
```

## References

- nanoid https://github.com/ai/nanoid
- Lazy functional state threads http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.2237
- Imperative Haskell http://vaibhavsagar.com/blog/2017/05/29/imperative-haskell/

nanoid-hs

nanoid-hs 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

nanoid-hs

nanoid-hs 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README