kandi background

polyglot | Multilingual text processing toolkit | Natural Language Processing library

by aboSamoor Python Version: Current License: GPL-3.0

by aboSamoor Python Version: Current License: GPL-3.0

Download this library from

kandi X-RAY | polyglot Summary

polyglot is a Python library typically used in Artificial Intelligence, Natural Language Processing applications. polyglot has no bugs, it has no vulnerabilities, it has build file available, it has a Strong Copyleft License and it has high support. You can install using 'pip install polyglot' or download it from GitHub, PyPI.

Multilingual text (NLP) processing toolkit

Support

Support

Quality

Quality

Security

Security

License

License

Reuse

Reuse

kandi-support Support

polyglot has a highly active ecosystem.
It has 1843 star(s) with 302 fork(s). There are 83 watchers for this library.
It had no major release in the last 12 months.
There are 131 open issues and 64 have been closed. On average issues are closed in 39 days. There are 12 open pull requests and 0 closed requests.
It has a negative sentiment in the developer community.
The latest version of polyglot is current.

polyglot Support

Best in #Natural Language Processing

Average in #Natural Language Processing

polyglot Support

Best in #Natural Language Processing

Average in #Natural Language Processing

quality kandi Quality

polyglot has 0 bugs and 0 code smells.

polyglot Quality

Best in #Natural Language Processing

Average in #Natural Language Processing

polyglot Quality

Best in #Natural Language Processing

Average in #Natural Language Processing

security Security

polyglot has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.
polyglot code analysis shows 0 unresolved vulnerabilities.
There are 0 security hotspots that need review.

polyglot Security

Best in #Natural Language Processing

Average in #Natural Language Processing

polyglot Security

Best in #Natural Language Processing

Average in #Natural Language Processing

license License

polyglot is licensed under the GPL-3.0 License. This license is Strong Copyleft.
Strong Copyleft licenses enforce sharing, and you can use them when creating open source projects.

polyglot License

Best in #Natural Language Processing

Average in #Natural Language Processing

polyglot License

Best in #Natural Language Processing

Average in #Natural Language Processing

build Reuse

polyglot releases are not available. You will need to build from source code and install.
Deployable package is available in PyPI.
Build file is available. You can build the component from source.

polyglot Reuse

Best in #Natural Language Processing

Average in #Natural Language Processing

polyglot Reuse

Best in #Natural Language Processing

Average in #Natural Language Processing

Top functions reviewed by kandi - BETA

kandi has reviewed polyglot and discovered the below as its top functions. This is intended to give you an instant insight into polyglot implemented functionality, and help decide if they suit your requirements.

Runs the command line tool .
Updates the index .
Recursively builds the package index .
Iterate over a zip file and iterates over all sub - directories .
Resolve the linkcode for the linkcode source code .
Find all the packages .
Transliterate string .
Runs the polyglot Downloader .
Deserialize a line from a text file .
Detects the language from the given text .

polyglot Key Features

Multilingual text (NLP) processing toolkit

polyglot Examples and Code Snippets

See all related Code Snippets

Karate - Get CSV column value having space

Copy

Download

* csv data = 
"""
Instrument ID, Instrument Name
SS-01,TestData
"""
* match data[0]['Instrument ID'] == 'SS-01'

vim - How to Split single line Array literal into multiple lines?

Copy

Download

[ "TypeScript",
 "HTML",
 "CSS",
 "SQL",
 "JavaScript" ]

:s/\s/\r/g

[
"TypeScript",
"HTML",
"CSS",
"SQL",
"JavaScript"
]

='[

[
    "TypeScript",
    "HTML",
    "CSS",
    "SQL",
    "JavaScript"
]

nnoremap <key> :s/\s/\r/g<CR>='[

vi[                   " visually select what's between the brackets
:'<,'>s/\%V\s/\r/g    " substitute spaces contained in the visual
                      " selection with \r

vi[
:'<,'>s/\%V\s/§/g
:s/§/\r/g
='[

function! ExpandList()
    silent s/\%V\s/§/g
    silent s/§/\r/g
    silent normal ='[
endfunction
xnoremap <key> :<C-u>call ExpandList()<CR>

function! ExpandList()
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim() })
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

function! ExpandList(type, ...)
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim()})
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

nnoremap <key> :set opfunc=ExpandList<CR>g@

-----------------------

[ "TypeScript",
 "HTML",
 "CSS",
 "SQL",
 "JavaScript" ]

:s/\s/\r/g

[
"TypeScript",
"HTML",
"CSS",
"SQL",
"JavaScript"
]

='[

[
    "TypeScript",
    "HTML",
    "CSS",
    "SQL",
    "JavaScript"
]

nnoremap <key> :s/\s/\r/g<CR>='[

vi[                   " visually select what's between the brackets
:'<,'>s/\%V\s/\r/g    " substitute spaces contained in the visual
                      " selection with \r

vi[
:'<,'>s/\%V\s/§/g
:s/§/\r/g
='[

function! ExpandList()
    silent s/\%V\s/§/g
    silent s/§/\r/g
    silent normal ='[
endfunction
xnoremap <key> :<C-u>call ExpandList()<CR>

function! ExpandList()
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim() })
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

function! ExpandList(type, ...)
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim()})
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

nnoremap <key> :set opfunc=ExpandList<CR>g@

-----------------------

[ "TypeScript",
 "HTML",
 "CSS",
 "SQL",
 "JavaScript" ]

:s/\s/\r/g

[
"TypeScript",
"HTML",
"CSS",
"SQL",
"JavaScript"
]

='[

[
    "TypeScript",
    "HTML",
    "CSS",
    "SQL",
    "JavaScript"
]

nnoremap <key> :s/\s/\r/g<CR>='[

vi[                   " visually select what's between the brackets
:'<,'>s/\%V\s/\r/g    " substitute spaces contained in the visual
                      " selection with \r

vi[
:'<,'>s/\%V\s/§/g
:s/§/\r/g
='[

function! ExpandList()
    silent s/\%V\s/§/g
    silent s/§/\r/g
    silent normal ='[
endfunction
xnoremap <key> :<C-u>call ExpandList()<CR>

function! ExpandList()
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim() })
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

function! ExpandList(type, ...)
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim()})
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

nnoremap <key> :set opfunc=ExpandList<CR>g@

-----------------------

[ "TypeScript",
 "HTML",
 "CSS",
 "SQL",
 "JavaScript" ]

:s/\s/\r/g

[
"TypeScript",
"HTML",
"CSS",
"SQL",
"JavaScript"
]

='[

[
    "TypeScript",
    "HTML",
    "CSS",
    "SQL",
    "JavaScript"
]

nnoremap <key> :s/\s/\r/g<CR>='[

vi[                   " visually select what's between the brackets
:'<,'>s/\%V\s/\r/g    " substitute spaces contained in the visual
                      " selection with \r

vi[
:'<,'>s/\%V\s/§/g
:s/§/\r/g
='[

function! ExpandList()
    silent s/\%V\s/§/g
    silent s/§/\r/g
    silent normal ='[
endfunction
xnoremap <key> :<C-u>call ExpandList()<CR>

function! ExpandList()
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim() })
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

function! ExpandList(type, ...)
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim()})
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

nnoremap <key> :set opfunc=ExpandList<CR>g@

-----------------------

[ "TypeScript",
 "HTML",
 "CSS",
 "SQL",
 "JavaScript" ]

:s/\s/\r/g

[
"TypeScript",
"HTML",
"CSS",
"SQL",
"JavaScript"
]

='[

[
    "TypeScript",
    "HTML",
    "CSS",
    "SQL",
    "JavaScript"
]

nnoremap <key> :s/\s/\r/g<CR>='[

vi[                   " visually select what's between the brackets
:'<,'>s/\%V\s/\r/g    " substitute spaces contained in the visual
                      " selection with \r

vi[
:'<,'>s/\%V\s/§/g
:s/§/\r/g
='[

function! ExpandList()
    silent s/\%V\s/§/g
    silent s/§/\r/g
    silent normal ='[
endfunction
xnoremap <key> :<C-u>call ExpandList()<CR>

function! ExpandList()
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim() })
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

function! ExpandList(type, ...)
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim()})
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

nnoremap <key> :set opfunc=ExpandList<CR>g@

-----------------------

[ "TypeScript",
 "HTML",
 "CSS",
 "SQL",
 "JavaScript" ]

:s/\s/\r/g

[
"TypeScript",
"HTML",
"CSS",
"SQL",
"JavaScript"
]

='[

[
    "TypeScript",
    "HTML",
    "CSS",
    "SQL",
    "JavaScript"
]

nnoremap <key> :s/\s/\r/g<CR>='[

vi[                   " visually select what's between the brackets
:'<,'>s/\%V\s/\r/g    " substitute spaces contained in the visual
                      " selection with \r

vi[
:'<,'>s/\%V\s/§/g
:s/§/\r/g
='[

function! ExpandList()
    silent s/\%V\s/§/g
    silent s/§/\r/g
    silent normal ='[
endfunction
xnoremap <key> :<C-u>call ExpandList()<CR>

function! ExpandList()
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim() })
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

function! ExpandList(type, ...)
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim()})
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

nnoremap <key> :set opfunc=ExpandList<CR>g@

-----------------------

[ "TypeScript",
 "HTML",
 "CSS",
 "SQL",
 "JavaScript" ]

:s/\s/\r/g

[
"TypeScript",
"HTML",
"CSS",
"SQL",
"JavaScript"
]

='[

[
    "TypeScript",
    "HTML",
    "CSS",
    "SQL",
    "JavaScript"
]

nnoremap <key> :s/\s/\r/g<CR>='[

vi[                   " visually select what's between the brackets
:'<,'>s/\%V\s/\r/g    " substitute spaces contained in the visual
                      " selection with \r

vi[
:'<,'>s/\%V\s/§/g
:s/§/\r/g
='[

function! ExpandList()
    silent s/\%V\s/§/g
    silent s/§/\r/g
    silent normal ='[
endfunction
xnoremap <key> :<C-u>call ExpandList()<CR>

function! ExpandList()
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim() })
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

function! ExpandList(type, ...)
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim()})
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

nnoremap <key> :set opfunc=ExpandList<CR>g@

-----------------------

[ "TypeScript",
 "HTML",
 "CSS",
 "SQL",
 "JavaScript" ]

:s/\s/\r/g

[
"TypeScript",
"HTML",
"CSS",
"SQL",
"JavaScript"
]

='[

[
    "TypeScript",
    "HTML",
    "CSS",
    "SQL",
    "JavaScript"
]

nnoremap <key> :s/\s/\r/g<CR>='[

vi[                   " visually select what's between the brackets
:'<,'>s/\%V\s/\r/g    " substitute spaces contained in the visual
                      " selection with \r

vi[
:'<,'>s/\%V\s/§/g
:s/§/\r/g
='[

function! ExpandList()
    silent s/\%V\s/§/g
    silent s/§/\r/g
    silent normal ='[
endfunction
xnoremap <key> :<C-u>call ExpandList()<CR>

function! ExpandList()
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim() })
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

function! ExpandList(type, ...)
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim()})
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

nnoremap <key> :set opfunc=ExpandList<CR>g@

-----------------------

[ "TypeScript",
 "HTML",
 "CSS",
 "SQL",
 "JavaScript" ]

:s/\s/\r/g

[
"TypeScript",
"HTML",
"CSS",
"SQL",
"JavaScript"
]

='[

[
    "TypeScript",
    "HTML",
    "CSS",
    "SQL",
    "JavaScript"
]

nnoremap <key> :s/\s/\r/g<CR>='[

vi[                   " visually select what's between the brackets
:'<,'>s/\%V\s/\r/g    " substitute spaces contained in the visual
                      " selection with \r

vi[
:'<,'>s/\%V\s/§/g
:s/§/\r/g
='[

function! ExpandList()
    silent s/\%V\s/§/g
    silent s/§/\r/g
    silent normal ='[
endfunction
xnoremap <key> :<C-u>call ExpandList()<CR>

function! ExpandList()
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim() })
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

function! ExpandList(type, ...)
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim()})
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

nnoremap <key> :set opfunc=ExpandList<CR>g@

-----------------------

[ "TypeScript",
 "HTML",
 "CSS",
 "SQL",
 "JavaScript" ]

:s/\s/\r/g

[
"TypeScript",
"HTML",
"CSS",
"SQL",
"JavaScript"
]

='[

[
    "TypeScript",
    "HTML",
    "CSS",
    "SQL",
    "JavaScript"
]

nnoremap <key> :s/\s/\r/g<CR>='[

vi[                   " visually select what's between the brackets
:'<,'>s/\%V\s/\r/g    " substitute spaces contained in the visual
                      " selection with \r

vi[
:'<,'>s/\%V\s/§/g
:s/§/\r/g
='[

function! ExpandList()
    silent s/\%V\s/§/g
    silent s/§/\r/g
    silent normal ='[
endfunction
xnoremap <key> :<C-u>call ExpandList()<CR>

function! ExpandList()
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim() })
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

function! ExpandList(type, ...)
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim()})
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

nnoremap <key> :set opfunc=ExpandList<CR>g@

-----------------------

[ "TypeScript",
 "HTML",
 "CSS",
 "SQL",
 "JavaScript" ]

:s/\s/\r/g

[
"TypeScript",
"HTML",
"CSS",
"SQL",
"JavaScript"
]

='[

[
    "TypeScript",
    "HTML",
    "CSS",
    "SQL",
    "JavaScript"
]

nnoremap <key> :s/\s/\r/g<CR>='[

vi[                   " visually select what's between the brackets
:'<,'>s/\%V\s/\r/g    " substitute spaces contained in the visual
                      " selection with \r

vi[
:'<,'>s/\%V\s/§/g
:s/§/\r/g
='[

function! ExpandList()
    silent s/\%V\s/§/g
    silent s/§/\r/g
    silent normal ='[
endfunction
xnoremap <key> :<C-u>call ExpandList()<CR>

function! ExpandList()
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim() })
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

function! ExpandList(type, ...)
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim()})
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

nnoremap <key> :set opfunc=ExpandList<CR>g@

-----------------------

[ "TypeScript",
 "HTML",
 "CSS",
 "SQL",
 "JavaScript" ]

:s/\s/\r/g

[
"TypeScript",
"HTML",
"CSS",
"SQL",
"JavaScript"
]

='[

[
    "TypeScript",
    "HTML",
    "CSS",
    "SQL",
    "JavaScript"
]

nnoremap <key> :s/\s/\r/g<CR>='[

vi[                   " visually select what's between the brackets
:'<,'>s/\%V\s/\r/g    " substitute spaces contained in the visual
                      " selection with \r

vi[
:'<,'>s/\%V\s/§/g
:s/§/\r/g
='[

function! ExpandList()
    silent s/\%V\s/§/g
    silent s/§/\r/g
    silent normal ='[
endfunction
xnoremap <key> :<C-u>call ExpandList()<CR>

function! ExpandList()
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim() })
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

function! ExpandList(type, ...)
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim()})
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

nnoremap <key> :set opfunc=ExpandList<CR>g@

-----------------------

[ |"TypeScript", "HTML", "CSS", "SQL", "JavaScript" ]

[ 
  "TypeScript", 
  "HTML", 
  "CSS", 
  "SQL", 
  "JavaScript" 
]

-----------------------

[ |"TypeScript", "HTML", "CSS", "SQL", "JavaScript" ]

[ 
  "TypeScript", 
  "HTML", 
  "CSS", 
  "SQL", 
  "JavaScript" 
]

renv + venv + jupyterlab + IRkernel: will it blend?

Copy

Download

owd <- setwd(".."); source("renv/activate.R"); setwd(owd)

Minimax returning illegal uci move - move generation doesn't update?

Copy

Download

def minimax(board, depth, is_max):
  if depth == 0: 
    return evaluate(board)
  elif board.fen in searched_position_evals: 
    # board.pop()
    return searched_position_evals[board.fen]
...

Is there a way to use a java object as an argument for a function and return one of said objects's values in GraalJS?

Copy

Download

Bindings bindings = engine.getBindings(ScriptContext.ENGINE_SCOPE);
bindings.put("polyglot.js.allowHostAccess", true);

import org.graalvm.polyglot.HostAccess;
// ...
@HostAccess.Export
public double getSpeed() {
    return this.speed;
}

-----------------------

Bindings bindings = engine.getBindings(ScriptContext.ENGINE_SCOPE);
bindings.put("polyglot.js.allowHostAccess", true);

import org.graalvm.polyglot.HostAccess;
// ...
@HostAccess.Export
public double getSpeed() {
    return this.speed;
}

How to use pomless tycho artifacts in non-tycho project

Copy

Download

@echo off

set MVN_HOME=C:/Tools/apache-maven-3.6.3
set BUNDLES_HOME=C:/Work/workspace-bpms-trunk/bundles
set ECLIPSE_HOME=C:/Tools/eclipse/plugins

set PATH=%MVN_HOME%/bin;%PATH%

for /f "tokens=1,2 delims=:" %%E in (deps.txt) do (
  if exist %BUNDLES_HOME%/%%F (
    for /f "tokens=1,2 delims=: " %%G in (%BUNDLES_HOME%/%%F/META-INF/MANIFEST.MF) do (
      if "%%G" == "Bundle-Version" (
        call mvn install:install-file -DgroupId=%%E -DartifactId=%%F -Dversion=%%~nH-SNAPSHOT -DgeneratePom=true -Dpackaging=jar -Dfile="%BUNDLES_HOME%/%%F/target/%%F-%%~nH-SNAPSHOT.jar"
      )
    )
  ) else (
    for %%G in (%ECLIPSE_HOME%/%%F_*.jar) do (
      for /f "tokens=2 delims=_" %%H in ("%%~nG") do (
        call mvn install:install-file -DgroupId=%%E -DartifactId=%%F -Dversion=%%H -DgeneratePom=true -Dpackaging=jar -Dfile="%ECLIPSE_HOME%/%%~nG.jar"
      )
    )
  )
)

org.eclipse.ocl:org.eclipse.ocl
org.eclipse.ocl:org.eclipse.ocl.common
org.eclipse.ocl:org.eclipse.ocl.ecore
org.eclipse.ocl:org.eclipse.ocl.pivot

@echo off

set BUNDLES_HOME=C:/Work/workspace-bpms-trunk/bundles
set ECLIPSE_HOME=C:/Tools/eclipse/plugins

break > deps-gen.txt

for /f "tokens=1,2 delims=:" %%E in (deps.txt) do (
  if exist %BUNDLES_HOME%/%%F (
    for /f "tokens=1,2 delims=: " %%G in (%BUNDLES_HOME%/%%F/META-INF/MANIFEST.MF) do (
      if "%%G" == "Bundle-Version" (
        echo        ^<dependency^>>> deps-gen.txt
        echo            ^<groupId^>%%E^</groupId^>>> deps-gen.txt
        echo            ^<artifactId^>%%F^</artifactId^>>> deps-gen.txt
        echo            ^<version^>%%~nH-SNAPSHOT^</version^>>> deps-gen.txt
        echo        ^</dependency^>>> deps-gen.txt
      )
    )
  ) else (
    for %%G in (%ECLIPSE_HOME%/%%F_*.jar) do (
      for /f "tokens=2 delims=_" %%H in ("%%~nG") do (
        echo        ^<dependency^>>> deps-gen.txt
        echo            ^<groupId^>%%E^</groupId^>>> deps-gen.txt
        echo            ^<artifactId^>%%F^</artifactId^>>> deps-gen.txt
        echo            ^<version^>%%H^</version^>>> deps-gen.txt
        echo        ^</dependency^>>> deps-gen.txt
      )
    )
  )
)

#!/bin/bash

BUNDLES_HOME=~/workspaces/workspace-bpms-trunk/bundles
ECLIPSE_PLUGINS=~/.p2/pool/plugins

while IFS=":" read -r group artifact || [ -n "$p" ]; do
  artifact="${artifact//[$'\r\n']}"
  if [ "$artifact" = "" ]; then
    :
  elif [ -d "$BUNDLES_HOME/$artifact" ]; then
    while IFS=":" read -r key value || [ -n "$p" ]; do
      if [ "$key" = "Bundle-Version" ]; then
        version="${value//[[:space:]]/}"
        version="${version/.qualifier/-SNAPSHOT}"
        mvn install:install-file -DgroupId=$group -DartifactId=$artifact \
          -Dversion=$version -DgeneratePom=true -Dpackaging=jar \
          -Dfile="$BUNDLES_HOME/$artifact/target/$artifact-$version.jar"
      fi
    done < "$BUNDLES_HOME/$artifact/META-INF/MANIFEST.MF"
  else
    for file in "$ECLIPSE_PLUGINS"/${artifact}_*.jar; do
      version="${file%%.jar}"
      version="${version##*_}"
      mvn install:install-file -DgroupId=$group -DartifactId=$artifact \
        -Dversion=$version -DgeneratePom=true -Dpackaging=jar -Dfile="$file"
    done
  fi
done < deps.txt

#!/bin/bash

BUNDLES_HOME=~/workspaces/workspace-bpms-trunk/bundles
ECLIPSE_PLUGINS=~/.p2/pool/plugins

: > deps-gen.txt

while IFS=":" read -r group artifact || [ -n "$p" ]; do
  artifact="${artifact//[$'\r\n']}"
  if [ "$artifact" = "" ]; then
    echo >> deps-gen.txt
  elif [ -d "$BUNDLES_HOME/$artifact" ]; then
    while IFS=":" read -r key value || [ -n "$p" ]; do
      if [ "$key" = "Bundle-Version" ]; then
        version="${value//[[:space:]]/}"
        version="${version/.qualifier/-SNAPSHOT}"
        echo "        <dependency>" >> deps-gen.txt
        echo "            <groupId>$group</groupId>" >> deps-gen.txt
        echo "            <artifactId>$artifact</artifactId>" >> deps-gen.txt
        echo "            <version>$version</version>" >> deps-gen.txt
        echo "        </dependency>" >> deps-gen.txt
      fi
    done < "$BUNDLES_HOME/$artifact/META-INF/MANIFEST.MF"
  else
    for file in "$ECLIPSE_PLUGINS"/${artifact}_*.jar; do
      version="${file%%.jar}"
      version="${version##*_}"
      echo "        <dependency>" >> deps-gen.txt
      echo "            <groupId>$group</groupId>" >> deps-gen.txt
      echo "            <artifactId>$artifact</artifactId>" >> deps-gen.txt
      echo "            <version>$version</version>" >> deps-gen.txt
      echo "        </dependency>" >> deps-gen.txt
    done
  fi
done < deps.txt

-----------------------

@echo off

set MVN_HOME=C:/Tools/apache-maven-3.6.3
set BUNDLES_HOME=C:/Work/workspace-bpms-trunk/bundles
set ECLIPSE_HOME=C:/Tools/eclipse/plugins

set PATH=%MVN_HOME%/bin;%PATH%

for /f "tokens=1,2 delims=:" %%E in (deps.txt) do (
  if exist %BUNDLES_HOME%/%%F (
    for /f "tokens=1,2 delims=: " %%G in (%BUNDLES_HOME%/%%F/META-INF/MANIFEST.MF) do (
      if "%%G" == "Bundle-Version" (
        call mvn install:install-file -DgroupId=%%E -DartifactId=%%F -Dversion=%%~nH-SNAPSHOT -DgeneratePom=true -Dpackaging=jar -Dfile="%BUNDLES_HOME%/%%F/target/%%F-%%~nH-SNAPSHOT.jar"
      )
    )
  ) else (
    for %%G in (%ECLIPSE_HOME%/%%F_*.jar) do (
      for /f "tokens=2 delims=_" %%H in ("%%~nG") do (
        call mvn install:install-file -DgroupId=%%E -DartifactId=%%F -Dversion=%%H -DgeneratePom=true -Dpackaging=jar -Dfile="%ECLIPSE_HOME%/%%~nG.jar"
      )
    )
  )
)

org.eclipse.ocl:org.eclipse.ocl
org.eclipse.ocl:org.eclipse.ocl.common
org.eclipse.ocl:org.eclipse.ocl.ecore
org.eclipse.ocl:org.eclipse.ocl.pivot

@echo off

set BUNDLES_HOME=C:/Work/workspace-bpms-trunk/bundles
set ECLIPSE_HOME=C:/Tools/eclipse/plugins

break > deps-gen.txt

for /f "tokens=1,2 delims=:" %%E in (deps.txt) do (
  if exist %BUNDLES_HOME%/%%F (
    for /f "tokens=1,2 delims=: " %%G in (%BUNDLES_HOME%/%%F/META-INF/MANIFEST.MF) do (
      if "%%G" == "Bundle-Version" (
        echo        ^<dependency^>>> deps-gen.txt
        echo            ^<groupId^>%%E^</groupId^>>> deps-gen.txt
        echo            ^<artifactId^>%%F^</artifactId^>>> deps-gen.txt
        echo            ^<version^>%%~nH-SNAPSHOT^</version^>>> deps-gen.txt
        echo        ^</dependency^>>> deps-gen.txt
      )
    )
  ) else (
    for %%G in (%ECLIPSE_HOME%/%%F_*.jar) do (
      for /f "tokens=2 delims=_" %%H in ("%%~nG") do (
        echo        ^<dependency^>>> deps-gen.txt
        echo            ^<groupId^>%%E^</groupId^>>> deps-gen.txt
        echo            ^<artifactId^>%%F^</artifactId^>>> deps-gen.txt
        echo            ^<version^>%%H^</version^>>> deps-gen.txt
        echo        ^</dependency^>>> deps-gen.txt
      )
    )
  )
)

#!/bin/bash

BUNDLES_HOME=~/workspaces/workspace-bpms-trunk/bundles
ECLIPSE_PLUGINS=~/.p2/pool/plugins

while IFS=":" read -r group artifact || [ -n "$p" ]; do
  artifact="${artifact//[$'\r\n']}"
  if [ "$artifact" = "" ]; then
    :
  elif [ -d "$BUNDLES_HOME/$artifact" ]; then
    while IFS=":" read -r key value || [ -n "$p" ]; do
      if [ "$key" = "Bundle-Version" ]; then
        version="${value//[[:space:]]/}"
        version="${version/.qualifier/-SNAPSHOT}"
        mvn install:install-file -DgroupId=$group -DartifactId=$artifact \
          -Dversion=$version -DgeneratePom=true -Dpackaging=jar \
          -Dfile="$BUNDLES_HOME/$artifact/target/$artifact-$version.jar"
      fi
    done < "$BUNDLES_HOME/$artifact/META-INF/MANIFEST.MF"
  else
    for file in "$ECLIPSE_PLUGINS"/${artifact}_*.jar; do
      version="${file%%.jar}"
      version="${version##*_}"
      mvn install:install-file -DgroupId=$group -DartifactId=$artifact \
        -Dversion=$version -DgeneratePom=true -Dpackaging=jar -Dfile="$file"
    done
  fi
done < deps.txt

#!/bin/bash

BUNDLES_HOME=~/workspaces/workspace-bpms-trunk/bundles
ECLIPSE_PLUGINS=~/.p2/pool/plugins

: > deps-gen.txt

while IFS=":" read -r group artifact || [ -n "$p" ]; do
  artifact="${artifact//[$'\r\n']}"
  if [ "$artifact" = "" ]; then
    echo >> deps-gen.txt
  elif [ -d "$BUNDLES_HOME/$artifact" ]; then
    while IFS=":" read -r key value || [ -n "$p" ]; do
      if [ "$key" = "Bundle-Version" ]; then
        version="${value//[[:space:]]/}"
        version="${version/.qualifier/-SNAPSHOT}"
        echo "        <dependency>" >> deps-gen.txt
        echo "            <groupId>$group</groupId>" >> deps-gen.txt
        echo "            <artifactId>$artifact</artifactId>" >> deps-gen.txt
        echo "            <version>$version</version>" >> deps-gen.txt
        echo "        </dependency>" >> deps-gen.txt
      fi
    done < "$BUNDLES_HOME/$artifact/META-INF/MANIFEST.MF"
  else
    for file in "$ECLIPSE_PLUGINS"/${artifact}_*.jar; do
      version="${file%%.jar}"
      version="${version##*_}"
      echo "        <dependency>" >> deps-gen.txt
      echo "            <groupId>$group</groupId>" >> deps-gen.txt
      echo "            <artifactId>$artifact</artifactId>" >> deps-gen.txt
      echo "            <version>$version</version>" >> deps-gen.txt
      echo "        </dependency>" >> deps-gen.txt
    done
  fi
done < deps.txt

-----------------------

@echo off

set MVN_HOME=C:/Tools/apache-maven-3.6.3
set BUNDLES_HOME=C:/Work/workspace-bpms-trunk/bundles
set ECLIPSE_HOME=C:/Tools/eclipse/plugins

set PATH=%MVN_HOME%/bin;%PATH%

for /f "tokens=1,2 delims=:" %%E in (deps.txt) do (
  if exist %BUNDLES_HOME%/%%F (
    for /f "tokens=1,2 delims=: " %%G in (%BUNDLES_HOME%/%%F/META-INF/MANIFEST.MF) do (
      if "%%G" == "Bundle-Version" (
        call mvn install:install-file -DgroupId=%%E -DartifactId=%%F -Dversion=%%~nH-SNAPSHOT -DgeneratePom=true -Dpackaging=jar -Dfile="%BUNDLES_HOME%/%%F/target/%%F-%%~nH-SNAPSHOT.jar"
      )
    )
  ) else (
    for %%G in (%ECLIPSE_HOME%/%%F_*.jar) do (
      for /f "tokens=2 delims=_" %%H in ("%%~nG") do (
        call mvn install:install-file -DgroupId=%%E -DartifactId=%%F -Dversion=%%H -DgeneratePom=true -Dpackaging=jar -Dfile="%ECLIPSE_HOME%/%%~nG.jar"
      )
    )
  )
)

org.eclipse.ocl:org.eclipse.ocl
org.eclipse.ocl:org.eclipse.ocl.common
org.eclipse.ocl:org.eclipse.ocl.ecore
org.eclipse.ocl:org.eclipse.ocl.pivot

@echo off

set BUNDLES_HOME=C:/Work/workspace-bpms-trunk/bundles
set ECLIPSE_HOME=C:/Tools/eclipse/plugins

break > deps-gen.txt

for /f "tokens=1,2 delims=:" %%E in (deps.txt) do (
  if exist %BUNDLES_HOME%/%%F (
    for /f "tokens=1,2 delims=: " %%G in (%BUNDLES_HOME%/%%F/META-INF/MANIFEST.MF) do (
      if "%%G" == "Bundle-Version" (
        echo        ^<dependency^>>> deps-gen.txt
        echo            ^<groupId^>%%E^</groupId^>>> deps-gen.txt
        echo            ^<artifactId^>%%F^</artifactId^>>> deps-gen.txt
        echo            ^<version^>%%~nH-SNAPSHOT^</version^>>> deps-gen.txt
        echo        ^</dependency^>>> deps-gen.txt
      )
    )
  ) else (
    for %%G in (%ECLIPSE_HOME%/%%F_*.jar) do (
      for /f "tokens=2 delims=_" %%H in ("%%~nG") do (
        echo        ^<dependency^>>> deps-gen.txt
        echo            ^<groupId^>%%E^</groupId^>>> deps-gen.txt
        echo            ^<artifactId^>%%F^</artifactId^>>> deps-gen.txt
        echo            ^<version^>%%H^</version^>>> deps-gen.txt
        echo        ^</dependency^>>> deps-gen.txt
      )
    )
  )
)

#!/bin/bash

BUNDLES_HOME=~/workspaces/workspace-bpms-trunk/bundles
ECLIPSE_PLUGINS=~/.p2/pool/plugins

while IFS=":" read -r group artifact || [ -n "$p" ]; do
  artifact="${artifact//[$'\r\n']}"
  if [ "$artifact" = "" ]; then
    :
  elif [ -d "$BUNDLES_HOME/$artifact" ]; then
    while IFS=":" read -r key value || [ -n "$p" ]; do
      if [ "$key" = "Bundle-Version" ]; then
        version="${value//[[:space:]]/}"
        version="${version/.qualifier/-SNAPSHOT}"
        mvn install:install-file -DgroupId=$group -DartifactId=$artifact \
          -Dversion=$version -DgeneratePom=true -Dpackaging=jar \
          -Dfile="$BUNDLES_HOME/$artifact/target/$artifact-$version.jar"
      fi
    done < "$BUNDLES_HOME/$artifact/META-INF/MANIFEST.MF"
  else
    for file in "$ECLIPSE_PLUGINS"/${artifact}_*.jar; do
      version="${file%%.jar}"
      version="${version##*_}"
      mvn install:install-file -DgroupId=$group -DartifactId=$artifact \
        -Dversion=$version -DgeneratePom=true -Dpackaging=jar -Dfile="$file"
    done
  fi
done < deps.txt

#!/bin/bash

BUNDLES_HOME=~/workspaces/workspace-bpms-trunk/bundles
ECLIPSE_PLUGINS=~/.p2/pool/plugins

: > deps-gen.txt

while IFS=":" read -r group artifact || [ -n "$p" ]; do
  artifact="${artifact//[$'\r\n']}"
  if [ "$artifact" = "" ]; then
    echo >> deps-gen.txt
  elif [ -d "$BUNDLES_HOME/$artifact" ]; then
    while IFS=":" read -r key value || [ -n "$p" ]; do
      if [ "$key" = "Bundle-Version" ]; then
        version="${value//[[:space:]]/}"
        version="${version/.qualifier/-SNAPSHOT}"
        echo "        <dependency>" >> deps-gen.txt
        echo "            <groupId>$group</groupId>" >> deps-gen.txt
        echo "            <artifactId>$artifact</artifactId>" >> deps-gen.txt
        echo "            <version>$version</version>" >> deps-gen.txt
        echo "        </dependency>" >> deps-gen.txt
      fi
    done < "$BUNDLES_HOME/$artifact/META-INF/MANIFEST.MF"
  else
    for file in "$ECLIPSE_PLUGINS"/${artifact}_*.jar; do
      version="${file%%.jar}"
      version="${version##*_}"
      echo "        <dependency>" >> deps-gen.txt
      echo "            <groupId>$group</groupId>" >> deps-gen.txt
      echo "            <artifactId>$artifact</artifactId>" >> deps-gen.txt
      echo "            <version>$version</version>" >> deps-gen.txt
      echo "        </dependency>" >> deps-gen.txt
    done
  fi
done < deps.txt

-----------------------

@echo off

set MVN_HOME=C:/Tools/apache-maven-3.6.3
set BUNDLES_HOME=C:/Work/workspace-bpms-trunk/bundles
set ECLIPSE_HOME=C:/Tools/eclipse/plugins

set PATH=%MVN_HOME%/bin;%PATH%

for /f "tokens=1,2 delims=:" %%E in (deps.txt) do (
  if exist %BUNDLES_HOME%/%%F (
    for /f "tokens=1,2 delims=: " %%G in (%BUNDLES_HOME%/%%F/META-INF/MANIFEST.MF) do (
      if "%%G" == "Bundle-Version" (
        call mvn install:install-file -DgroupId=%%E -DartifactId=%%F -Dversion=%%~nH-SNAPSHOT -DgeneratePom=true -Dpackaging=jar -Dfile="%BUNDLES_HOME%/%%F/target/%%F-%%~nH-SNAPSHOT.jar"
      )
    )
  ) else (
    for %%G in (%ECLIPSE_HOME%/%%F_*.jar) do (
      for /f "tokens=2 delims=_" %%H in ("%%~nG") do (
        call mvn install:install-file -DgroupId=%%E -DartifactId=%%F -Dversion=%%H -DgeneratePom=true -Dpackaging=jar -Dfile="%ECLIPSE_HOME%/%%~nG.jar"
      )
    )
  )
)

org.eclipse.ocl:org.eclipse.ocl
org.eclipse.ocl:org.eclipse.ocl.common
org.eclipse.ocl:org.eclipse.ocl.ecore
org.eclipse.ocl:org.eclipse.ocl.pivot

@echo off

set BUNDLES_HOME=C:/Work/workspace-bpms-trunk/bundles
set ECLIPSE_HOME=C:/Tools/eclipse/plugins

break > deps-gen.txt

for /f "tokens=1,2 delims=:" %%E in (deps.txt) do (
  if exist %BUNDLES_HOME%/%%F (
    for /f "tokens=1,2 delims=: " %%G in (%BUNDLES_HOME%/%%F/META-INF/MANIFEST.MF) do (
      if "%%G" == "Bundle-Version" (
        echo        ^<dependency^>>> deps-gen.txt
        echo            ^<groupId^>%%E^</groupId^>>> deps-gen.txt
        echo            ^<artifactId^>%%F^</artifactId^>>> deps-gen.txt
        echo            ^<version^>%%~nH-SNAPSHOT^</version^>>> deps-gen.txt
        echo        ^</dependency^>>> deps-gen.txt
      )
    )
  ) else (
    for %%G in (%ECLIPSE_HOME%/%%F_*.jar) do (
      for /f "tokens=2 delims=_" %%H in ("%%~nG") do (
        echo        ^<dependency^>>> deps-gen.txt
        echo            ^<groupId^>%%E^</groupId^>>> deps-gen.txt
        echo            ^<artifactId^>%%F^</artifactId^>>> deps-gen.txt
        echo            ^<version^>%%H^</version^>>> deps-gen.txt
        echo        ^</dependency^>>> deps-gen.txt
      )
    )
  )
)

#!/bin/bash

BUNDLES_HOME=~/workspaces/workspace-bpms-trunk/bundles
ECLIPSE_PLUGINS=~/.p2/pool/plugins

while IFS=":" read -r group artifact || [ -n "$p" ]; do
  artifact="${artifact//[$'\r\n']}"
  if [ "$artifact" = "" ]; then
    :
  elif [ -d "$BUNDLES_HOME/$artifact" ]; then
    while IFS=":" read -r key value || [ -n "$p" ]; do
      if [ "$key" = "Bundle-Version" ]; then
        version="${value//[[:space:]]/}"
        version="${version/.qualifier/-SNAPSHOT}"
        mvn install:install-file -DgroupId=$group -DartifactId=$artifact \
          -Dversion=$version -DgeneratePom=true -Dpackaging=jar \
          -Dfile="$BUNDLES_HOME/$artifact/target/$artifact-$version.jar"
      fi
    done < "$BUNDLES_HOME/$artifact/META-INF/MANIFEST.MF"
  else
    for file in "$ECLIPSE_PLUGINS"/${artifact}_*.jar; do
      version="${file%%.jar}"
      version="${version##*_}"
      mvn install:install-file -DgroupId=$group -DartifactId=$artifact \
        -Dversion=$version -DgeneratePom=true -Dpackaging=jar -Dfile="$file"
    done
  fi
done < deps.txt

#!/bin/bash

BUNDLES_HOME=~/workspaces/workspace-bpms-trunk/bundles
ECLIPSE_PLUGINS=~/.p2/pool/plugins

: > deps-gen.txt

while IFS=":" read -r group artifact || [ -n "$p" ]; do
  artifact="${artifact//[$'\r\n']}"
  if [ "$artifact" = "" ]; then
    echo >> deps-gen.txt
  elif [ -d "$BUNDLES_HOME/$artifact" ]; then
    while IFS=":" read -r key value || [ -n "$p" ]; do
      if [ "$key" = "Bundle-Version" ]; then
        version="${value//[[:space:]]/}"
        version="${version/.qualifier/-SNAPSHOT}"
        echo "        <dependency>" >> deps-gen.txt
        echo "            <groupId>$group</groupId>" >> deps-gen.txt
        echo "            <artifactId>$artifact</artifactId>" >> deps-gen.txt
        echo "            <version>$version</version>" >> deps-gen.txt
        echo "        </dependency>" >> deps-gen.txt
      fi
    done < "$BUNDLES_HOME/$artifact/META-INF/MANIFEST.MF"
  else
    for file in "$ECLIPSE_PLUGINS"/${artifact}_*.jar; do
      version="${file%%.jar}"
      version="${version##*_}"
      echo "        <dependency>" >> deps-gen.txt
      echo "            <groupId>$group</groupId>" >> deps-gen.txt
      echo "            <artifactId>$artifact</artifactId>" >> deps-gen.txt
      echo "            <version>$version</version>" >> deps-gen.txt
      echo "        </dependency>" >> deps-gen.txt
    done
  fi
done < deps.txt

-----------------------

@echo off

set MVN_HOME=C:/Tools/apache-maven-3.6.3
set BUNDLES_HOME=C:/Work/workspace-bpms-trunk/bundles
set ECLIPSE_HOME=C:/Tools/eclipse/plugins

set PATH=%MVN_HOME%/bin;%PATH%

for /f "tokens=1,2 delims=:" %%E in (deps.txt) do (
  if exist %BUNDLES_HOME%/%%F (
    for /f "tokens=1,2 delims=: " %%G in (%BUNDLES_HOME%/%%F/META-INF/MANIFEST.MF) do (
      if "%%G" == "Bundle-Version" (
        call mvn install:install-file -DgroupId=%%E -DartifactId=%%F -Dversion=%%~nH-SNAPSHOT -DgeneratePom=true -Dpackaging=jar -Dfile="%BUNDLES_HOME%/%%F/target/%%F-%%~nH-SNAPSHOT.jar"
      )
    )
  ) else (
    for %%G in (%ECLIPSE_HOME%/%%F_*.jar) do (
      for /f "tokens=2 delims=_" %%H in ("%%~nG") do (
        call mvn install:install-file -DgroupId=%%E -DartifactId=%%F -Dversion=%%H -DgeneratePom=true -Dpackaging=jar -Dfile="%ECLIPSE_HOME%/%%~nG.jar"
      )
    )
  )
)

org.eclipse.ocl:org.eclipse.ocl
org.eclipse.ocl:org.eclipse.ocl.common
org.eclipse.ocl:org.eclipse.ocl.ecore
org.eclipse.ocl:org.eclipse.ocl.pivot

@echo off

set BUNDLES_HOME=C:/Work/workspace-bpms-trunk/bundles
set ECLIPSE_HOME=C:/Tools/eclipse/plugins

break > deps-gen.txt

for /f "tokens=1,2 delims=:" %%E in (deps.txt) do (
  if exist %BUNDLES_HOME%/%%F (
    for /f "tokens=1,2 delims=: " %%G in (%BUNDLES_HOME%/%%F/META-INF/MANIFEST.MF) do (
      if "%%G" == "Bundle-Version" (
        echo        ^<dependency^>>> deps-gen.txt
        echo            ^<groupId^>%%E^</groupId^>>> deps-gen.txt
        echo            ^<artifactId^>%%F^</artifactId^>>> deps-gen.txt
        echo            ^<version^>%%~nH-SNAPSHOT^</version^>>> deps-gen.txt
        echo        ^</dependency^>>> deps-gen.txt
      )
    )
  ) else (
    for %%G in (%ECLIPSE_HOME%/%%F_*.jar) do (
      for /f "tokens=2 delims=_" %%H in ("%%~nG") do (
        echo        ^<dependency^>>> deps-gen.txt
        echo            ^<groupId^>%%E^</groupId^>>> deps-gen.txt
        echo            ^<artifactId^>%%F^</artifactId^>>> deps-gen.txt
        echo            ^<version^>%%H^</version^>>> deps-gen.txt
        echo        ^</dependency^>>> deps-gen.txt
      )
    )
  )
)

#!/bin/bash

BUNDLES_HOME=~/workspaces/workspace-bpms-trunk/bundles
ECLIPSE_PLUGINS=~/.p2/pool/plugins

while IFS=":" read -r group artifact || [ -n "$p" ]; do
  artifact="${artifact//[$'\r\n']}"
  if [ "$artifact" = "" ]; then
    :
  elif [ -d "$BUNDLES_HOME/$artifact" ]; then
    while IFS=":" read -r key value || [ -n "$p" ]; do
      if [ "$key" = "Bundle-Version" ]; then
        version="${value//[[:space:]]/}"
        version="${version/.qualifier/-SNAPSHOT}"
        mvn install:install-file -DgroupId=$group -DartifactId=$artifact \
          -Dversion=$version -DgeneratePom=true -Dpackaging=jar \
          -Dfile="$BUNDLES_HOME/$artifact/target/$artifact-$version.jar"
      fi
    done < "$BUNDLES_HOME/$artifact/META-INF/MANIFEST.MF"
  else
    for file in "$ECLIPSE_PLUGINS"/${artifact}_*.jar; do
      version="${file%%.jar}"
      version="${version##*_}"
      mvn install:install-file -DgroupId=$group -DartifactId=$artifact \
        -Dversion=$version -DgeneratePom=true -Dpackaging=jar -Dfile="$file"
    done
  fi
done < deps.txt

#!/bin/bash

BUNDLES_HOME=~/workspaces/workspace-bpms-trunk/bundles
ECLIPSE_PLUGINS=~/.p2/pool/plugins

: > deps-gen.txt

while IFS=":" read -r group artifact || [ -n "$p" ]; do
  artifact="${artifact//[$'\r\n']}"
  if [ "$artifact" = "" ]; then
    echo >> deps-gen.txt
  elif [ -d "$BUNDLES_HOME/$artifact" ]; then
    while IFS=":" read -r key value || [ -n "$p" ]; do
      if [ "$key" = "Bundle-Version" ]; then
        version="${value//[[:space:]]/}"
        version="${version/.qualifier/-SNAPSHOT}"
        echo "        <dependency>" >> deps-gen.txt
        echo "            <groupId>$group</groupId>" >> deps-gen.txt
        echo "            <artifactId>$artifact</artifactId>" >> deps-gen.txt
        echo "            <version>$version</version>" >> deps-gen.txt
        echo "        </dependency>" >> deps-gen.txt
      fi
    done < "$BUNDLES_HOME/$artifact/META-INF/MANIFEST.MF"
  else
    for file in "$ECLIPSE_PLUGINS"/${artifact}_*.jar; do
      version="${file%%.jar}"
      version="${version##*_}"
      echo "        <dependency>" >> deps-gen.txt
      echo "            <groupId>$group</groupId>" >> deps-gen.txt
      echo "            <artifactId>$artifact</artifactId>" >> deps-gen.txt
      echo "            <version>$version</version>" >> deps-gen.txt
      echo "        </dependency>" >> deps-gen.txt
    done
  fi
done < deps.txt

Karate - want to get url along with query params in a variable

Copy

Download

Scenario: Sample File
* def ScenarioEngine = Java.type('com.intuit.karate.core.ScenarioEngine');
Given url 'https://reqres.in'
And path '/api/users'
And param page = 2
And param pages = 1
When method get
And print ScenarioEngine.get().getRequest().getUrl()

Python chess engine. Alphabeta function exceeding depth call error

Copy

Download

import time

import chess
import chess.pgn


INF = 100000
MATE_SCORE = INF-100
MAX_DEPTH = 16
MAX_TIME_MS = 120000  # 120s or 2m


# Evaluating the board
pawntable = [
    0, 0, 0, 0, 0, 0, 0, 0,
    5, 10, 10, -20, -20, 10, 10, 5,
    5, -5, -10, 0, 0, -10, -5, 5,
    0, 0, 0, 20, 20, 0, 0, 0,
    5, 5, 10, 25, 25, 10, 5, 5,
    10, 10, 20, 30, 30, 20, 10, 10,
    50, 50, 50, 50, 50, 50, 50, 50,
    0, 0, 0, 0, 0, 0, 0, 0]

knightstable = [
    -50, -40, -30, -30, -30, -30, -40, -50,
    -40, -20, 0, 5, 5, 0, -20, -40,
    -30, 5, 10, 15, 15, 10, 5, -30,
    -30, 0, 15, 20, 20, 15, 0, -30,
    -30, 5, 15, 20, 20, 15, 5, -30,
    -30, 0, 10, 15, 15, 10, 0, -30,
    -40, -20, 0, 0, 0, 0, -20, -40,
    -50, -40, -30, -30, -30, -30, -40, -50]

bishopstable = [
    -20, -10, -10, -10, -10, -10, -10, -20,
    -10, 5, 0, 0, 0, 0, 5, -10,
    -10, 10, 10, 10, 10, 10, 10, -10,
    -10, 0, 10, 10, 10, 10, 0, -10,
    -10, 5, 5, 10, 10, 5, 5, -10,
    -10, 0, 5, 10, 10, 5, 0, -10,
    -10, 0, 0, 0, 0, 0, 0, -10,
    -20, -10, -10, -10, -10, -10, -10, -20]

rookstable = [
    0, 0, 0, 5, 5, 0, 0, 0,
    -5, 0, 0, 0, 0, 0, 0, -5,
    -5, 0, 0, 0, 0, 0, 0, -5,
    -5, 0, 0, 0, 0, 0, 0, -5,
    -5, 0, 0, 0, 0, 0, 0, -5,
    -5, 0, 0, 0, 0, 0, 0, -5,
    5, 10, 10, 10, 10, 10, 10, 5,
    0, 0, 0, 0, 0, 0, 0, 0]

queenstable = [
    -20, -10, -10, -5, -5, -10, -10, -20,
    -10, 0, 0, 0, 0, 0, 0, -10,
    -10, 5, 5, 5, 5, 5, 0, -10,
    0, 0, 5, 5, 5, 5, 0, -5,
    -5, 0, 5, 5, 5, 5, 0, -5,
    -10, 0, 5, 5, 5, 5, 0, -10,
    -10, 0, 0, 0, 0, 0, 0, -10,
    -20, -10, -10, -5, -5, -10, -10, -20]

kingstable = [
    20, 30, 10, 0, 0, 10, 30, 20,
    20, 20, 0, 0, 0, 0, 20, 20,
    -10, -20, -20, -20, -20, -20, -20, -10,
    -20, -30, -30, -40, -40, -30, -30, -20,
    -30, -40, -40, -50, -50, -40, -40, -30,
    -30, -40, -40, -50, -50, -40, -40, -30,
    -30, -40, -40, -50, -50, -40, -40, -30,
    -30, -40, -40, -50, -50, -40, -40, -30]


def is_time_limit_reached():
    global start_time
    global timems

    return 1000 * (time.perf_counter() - start_time) >= timems


def evaluate_board(board):
    wp = len(board.pieces(chess.PAWN, chess.WHITE))
    bp = len(board.pieces(chess.PAWN, chess.BLACK))
    wn = len(board.pieces(chess.KNIGHT, chess.WHITE))
    bn = len(board.pieces(chess.KNIGHT, chess.BLACK))
    wb = len(board.pieces(chess.BISHOP, chess.WHITE))
    bb = len(board.pieces(chess.BISHOP, chess.BLACK))
    wr = len(board.pieces(chess.ROOK, chess.WHITE))
    br = len(board.pieces(chess.ROOK, chess.BLACK))
    wq = len(board.pieces(chess.QUEEN, chess.WHITE))
    bq = len(board.pieces(chess.QUEEN, chess.BLACK))

    material = 100 * (wp - bp) + 320 * (wn - bn) + 330 * (wb - bb) + 500 * (wr - br) + 900 * (wq - bq)

    pawnsq = sum([pawntable[i] for i in board.pieces(chess.PAWN, chess.WHITE)])
    pawnsq = pawnsq + sum([-pawntable[chess.square_mirror(i)]
                           for i in board.pieces(chess.PAWN, chess.BLACK)])
    knightsq = sum([knightstable[i] for i in board.pieces(chess.KNIGHT, chess.WHITE)])
    knightsq = knightsq + sum([-knightstable[chess.square_mirror(i)]
                               for i in board.pieces(chess.KNIGHT, chess.BLACK)])
    bishopsq = sum([bishopstable[i] for i in board.pieces(chess.BISHOP, chess.WHITE)])
    bishopsq = bishopsq + sum([-bishopstable[chess.square_mirror(i)]
                               for i in board.pieces(chess.BISHOP, chess.BLACK)])
    rooksq = sum([rookstable[i] for i in board.pieces(chess.ROOK, chess.WHITE)])
    rooksq = rooksq + sum([-rookstable[chess.square_mirror(i)]
                           for i in board.pieces(chess.ROOK, chess.BLACK)])
    queensq = sum([queenstable[i] for i in board.pieces(chess.QUEEN, chess.WHITE)])
    queensq = queensq + sum([-queenstable[chess.square_mirror(i)]
                             for i in board.pieces(chess.QUEEN, chess.BLACK)])
    kingsq = sum([kingstable[i] for i in board.pieces(chess.KING, chess.WHITE)])
    kingsq = kingsq + sum([-kingstable[chess.square_mirror(i)]
                           for i in board.pieces(chess.KING, chess.BLACK)])

    eval = material + pawnsq + knightsq + bishopsq + rooksq + queensq + kingsq

    if board.turn:
        return eval
    return -eval


def value_to_mate(value):
    if (value < -MATE_SCORE):
        return -(INF + value) // 2
    
    elif (value > MATE_SCORE):
        return (INF - value + 1) // 2

    return 0


# Searching the best move using minimax and alphabeta algorithm with negamax implementation
def alphabeta(board, alpha, beta, depth):
    global timems
    global start_time
    global ply

    bestscore = -INF

    if is_time_limit_reached():
        return 0

    if board.can_claim_draw() or board.is_insufficient_material():
        return 0

    incheck = board.is_check()
    if incheck:
        depth += 1

    if (depth < 1):
        return quiesce(board, alpha, beta)

    legal = 0
    for move in board.legal_moves:
        board.push(move)
        ply += 1
        legal += 1

        score = -alphabeta(board, -beta, -alpha, depth - 1)
        board.pop()
        ply -= 1

        if (score >= beta):
            return score

        if (score > bestscore):
            bestscore = score

        if (score > alpha):
            alpha = score

    if legal == 0:
        if incheck:
            return -INF + ply
        else:
            return 0

    return bestscore


def quiesce(board, alpha, beta):
    if is_time_limit_reached():
        return 0

    if board.is_insufficient_material():
        return 0

    stand_pat = evaluate_board(board)
    if (stand_pat >= beta):
        return beta
    if (alpha < stand_pat):
        alpha = stand_pat

    for move in board.legal_moves:
        if board.is_capture(move):
            board.push(move)

            score = -quiesce(board, -beta, -alpha)
            board.pop()

            if (score >= beta):
                return beta

            if (score > alpha):
                alpha = score

    return alpha


def selectmove(board, depth):
    global ply 

    bestMove = chess.Move.null()
    bestValue = -INF
    alpha = -INF
    beta = INF

    for move in board.legal_moves:
        board.push(move)
        ply += 1

        boardValue = -alphabeta(board, -beta, -alpha, depth - 1)
        if boardValue > bestValue:
            bestValue = boardValue
            bestMove = move

        if (boardValue > alpha):
            alpha = boardValue

        board.pop()
        ply -= 1

        if is_time_limit_reached():
            break

    return bestMove, bestValue


if __name__ == '__main__':
    global timems
    global start_time
    global ply

    fen = chess.STARTING_FEN
    # fen = "1k6/7Q/1K6/8/8/8/8/8 w - - 0 1"  # mate in 1
    # fen = "kbK5/pp6/1P6/8/8/8/8/R7 w - - 0 1"  # mate in 2
    # fen = "rnbqkb1r/1p2pppp/p2p1n2/8/3NP3/2N5/PPP2PPP/R1BQKB1R w KQkq - 0 6"  # sicilian
    
    depth = MAX_DEPTH
    timems = MAX_TIME_MS

    board = chess.Board(fen)

    while True:
        userinput = input('> ')
        line = userinput.rstrip()

        if line == 'go':
            bestmove, bestscore = None, None
            start_time = time.perf_counter()
            ply = 0

            if not board.is_game_over():
                for d in range(1, depth+1):
                    move, score = selectmove(board, d)

                    elapse = 1000 * (time.perf_counter() - start_time)

                    if elapse >= timems:
                        break  # Don't overwrite our bestmove from the time-interrupted search.

                    bestmove = move
                    bestscore = score

                    if abs(bestscore) > MATE_SCORE:
                        mate = value_to_mate(bestscore)
                        print(f'info depth {d} score mate {mate} time {int(elapse)} pv {bestmove}')  # time is in millisec
                    else:
                        print(f'info depth {d} score {bestscore} time {int(elapse)} pv {bestmove}')  # time is in millisec

                board.push(bestmove)  # update board with the bestmove
                print(f'info time {int(1000*(time.perf_counter() - start_time))}')
                print(f'bestmove {bestmove}')
            else:
                print('Game is over!')

        elif line == 'new':
            board = chess.Board()
            depth = MAX_DEPTH
            timems = MAX_TIME_MS
            print(board)
            print(f'max depth: {depth}, max time ms: {timems}')

        elif 'position fen ' in line:
            fen = ' '.join(line.split()[2:7])
            board = chess.Board(fen)

        elif line == 'board':
            print(board)

        elif line == 'fen':
            print(board.fen())

        elif line == 'epd':
            print(board.epd())

        elif 'time' in line:
            timems = int(line.split()[1])

        elif 'depth' in line:
            depth = int(line.split()[1])

        elif line == 'game':
            game = chess.pgn.Game()
            print(game.from_board(board))

        elif line == 'quit':
            break

        else:
            # assume user has entered a move
            try:
                board.push(chess.Move.from_uci(line))
            except ValueError:
                print(f'illegal move {line}')

> new
r n b q k b n r
p p p p p p p p
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
P P P P P P P P
R N B Q K B N R
max depth: 16, max time ms: 120000
> time 5000
> e2e4
> go
info depth 1 score 10 time 18 pv g8f6
info depth 2 score -40 time 140 pv g8f6
info depth 3 score 10 time 973 pv g8f6
info time 5001
bestmove g8f6
> board
r n b q k b . r
p p p p p p p p
. . . . . n . .
. . . . . . . .
. . . . P . . .
. . . . . . . .
P P P P . P P P
R N B Q K B N R
> b1c3
> go
info depth 1 score 10 time 19 pv b8c6
info depth 2 score -20 time 421 pv d7d5
info depth 3 score 10 time 2865 pv d7d5
info time 5000
bestmove d7d5
> board
r n b q k b . r
p p p . p p p p
. . . . . n . .
. . . p . . . .
. . . . P . . .
. . N . . . . .
P P P P . P P P
R . B Q K B N R
> game
[Event "?"]
[Site "?"]
[Date "????.??.??"]
[Round "?"]
[White "?"]
[Black "?"]
[Result "*"]

1. e4 Nf6 2. Nc3 d5 *
> quit

> position fen kbK5/pp6/1P6/8/8/8/8/R7 w - - 0 1
> board
k b K . . . . .
p p . . . . . .
. P . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
R . . . . . . .
> time 5000
> go
info depth 1 score 10 time 10 pv a1a5
info depth 2 score 10 time 92 pv a1a5
info depth 3 score mate 2 time 362 pv a1a6
info depth 4 score mate 2 time 2151 pv a1a6
info time 5001
bestmove a1a6
> board
k b K . . . . .
p p . . . . . .
R P . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
> go
info depth 1 score 480 time 5 pv b7a6
info depth 2 score mate -1 time 32 pv b8c7
info depth 3 score mate -1 time 184 pv b8c7
info depth 4 score mate -1 time 1314 pv b8c7
info time 5000
bestmove b8c7
> go
info depth 1 score mate 1 time 4 pv a6a7
info depth 2 score mate 1 time 37 pv a6a7
info depth 3 score mate 1 time 143 pv a6a7
info depth 4 score mate 1 time 878 pv a6a7
info depth 5 score mate 1 time 4305 pv a6a7
info time 5001
bestmove a6a7
> go
Game is over!
>

-----------------------

import time

import chess
import chess.pgn


INF = 100000
MATE_SCORE = INF-100
MAX_DEPTH = 16
MAX_TIME_MS = 120000  # 120s or 2m


# Evaluating the board
pawntable = [
    0, 0, 0, 0, 0, 0, 0, 0,
    5, 10, 10, -20, -20, 10, 10, 5,
    5, -5, -10, 0, 0, -10, -5, 5,
    0, 0, 0, 20, 20, 0, 0, 0,
    5, 5, 10, 25, 25, 10, 5, 5,
    10, 10, 20, 30, 30, 20, 10, 10,
    50, 50, 50, 50, 50, 50, 50, 50,
    0, 0, 0, 0, 0, 0, 0, 0]

knightstable = [
    -50, -40, -30, -30, -30, -30, -40, -50,
    -40, -20, 0, 5, 5, 0, -20, -40,
    -30, 5, 10, 15, 15, 10, 5, -30,
    -30, 0, 15, 20, 20, 15, 0, -30,
    -30, 5, 15, 20, 20, 15, 5, -30,
    -30, 0, 10, 15, 15, 10, 0, -30,
    -40, -20, 0, 0, 0, 0, -20, -40,
    -50, -40, -30, -30, -30, -30, -40, -50]

bishopstable = [
    -20, -10, -10, -10, -10, -10, -10, -20,
    -10, 5, 0, 0, 0, 0, 5, -10,
    -10, 10, 10, 10, 10, 10, 10, -10,
    -10, 0, 10, 10, 10, 10, 0, -10,
    -10, 5, 5, 10, 10, 5, 5, -10,
    -10, 0, 5, 10, 10, 5, 0, -10,
    -10, 0, 0, 0, 0, 0, 0, -10,
    -20, -10, -10, -10, -10, -10, -10, -20]

rookstable = [
    0, 0, 0, 5, 5, 0, 0, 0,
    -5, 0, 0, 0, 0, 0, 0, -5,
    -5, 0, 0, 0, 0, 0, 0, -5,
    -5, 0, 0, 0, 0, 0, 0, -5,
    -5, 0, 0, 0, 0, 0, 0, -5,
    -5, 0, 0, 0, 0, 0, 0, -5,
    5, 10, 10, 10, 10, 10, 10, 5,
    0, 0, 0, 0, 0, 0, 0, 0]

queenstable = [
    -20, -10, -10, -5, -5, -10, -10, -20,
    -10, 0, 0, 0, 0, 0, 0, -10,
    -10, 5, 5, 5, 5, 5, 0, -10,
    0, 0, 5, 5, 5, 5, 0, -5,
    -5, 0, 5, 5, 5, 5, 0, -5,
    -10, 0, 5, 5, 5, 5, 0, -10,
    -10, 0, 0, 0, 0, 0, 0, -10,
    -20, -10, -10, -5, -5, -10, -10, -20]

kingstable = [
    20, 30, 10, 0, 0, 10, 30, 20,
    20, 20, 0, 0, 0, 0, 20, 20,
    -10, -20, -20, -20, -20, -20, -20, -10,
    -20, -30, -30, -40, -40, -30, -30, -20,
    -30, -40, -40, -50, -50, -40, -40, -30,
    -30, -40, -40, -50, -50, -40, -40, -30,
    -30, -40, -40, -50, -50, -40, -40, -30,
    -30, -40, -40, -50, -50, -40, -40, -30]


def is_time_limit_reached():
    global start_time
    global timems

    return 1000 * (time.perf_counter() - start_time) >= timems


def evaluate_board(board):
    wp = len(board.pieces(chess.PAWN, chess.WHITE))
    bp = len(board.pieces(chess.PAWN, chess.BLACK))
    wn = len(board.pieces(chess.KNIGHT, chess.WHITE))
    bn = len(board.pieces(chess.KNIGHT, chess.BLACK))
    wb = len(board.pieces(chess.BISHOP, chess.WHITE))
    bb = len(board.pieces(chess.BISHOP, chess.BLACK))
    wr = len(board.pieces(chess.ROOK, chess.WHITE))
    br = len(board.pieces(chess.ROOK, chess.BLACK))
    wq = len(board.pieces(chess.QUEEN, chess.WHITE))
    bq = len(board.pieces(chess.QUEEN, chess.BLACK))

    material = 100 * (wp - bp) + 320 * (wn - bn) + 330 * (wb - bb) + 500 * (wr - br) + 900 * (wq - bq)

    pawnsq = sum([pawntable[i] for i in board.pieces(chess.PAWN, chess.WHITE)])
    pawnsq = pawnsq + sum([-pawntable[chess.square_mirror(i)]
                           for i in board.pieces(chess.PAWN, chess.BLACK)])
    knightsq = sum([knightstable[i] for i in board.pieces(chess.KNIGHT, chess.WHITE)])
    knightsq = knightsq + sum([-knightstable[chess.square_mirror(i)]
                               for i in board.pieces(chess.KNIGHT, chess.BLACK)])
    bishopsq = sum([bishopstable[i] for i in board.pieces(chess.BISHOP, chess.WHITE)])
    bishopsq = bishopsq + sum([-bishopstable[chess.square_mirror(i)]
                               for i in board.pieces(chess.BISHOP, chess.BLACK)])
    rooksq = sum([rookstable[i] for i in board.pieces(chess.ROOK, chess.WHITE)])
    rooksq = rooksq + sum([-rookstable[chess.square_mirror(i)]
                           for i in board.pieces(chess.ROOK, chess.BLACK)])
    queensq = sum([queenstable[i] for i in board.pieces(chess.QUEEN, chess.WHITE)])
    queensq = queensq + sum([-queenstable[chess.square_mirror(i)]
                             for i in board.pieces(chess.QUEEN, chess.BLACK)])
    kingsq = sum([kingstable[i] for i in board.pieces(chess.KING, chess.WHITE)])
    kingsq = kingsq + sum([-kingstable[chess.square_mirror(i)]
                           for i in board.pieces(chess.KING, chess.BLACK)])

    eval = material + pawnsq + knightsq + bishopsq + rooksq + queensq + kingsq

    if board.turn:
        return eval
    return -eval


def value_to_mate(value):
    if (value < -MATE_SCORE):
        return -(INF + value) // 2
    
    elif (value > MATE_SCORE):
        return (INF - value + 1) // 2

    return 0


# Searching the best move using minimax and alphabeta algorithm with negamax implementation
def alphabeta(board, alpha, beta, depth):
    global timems
    global start_time
    global ply

    bestscore = -INF

    if is_time_limit_reached():
        return 0

    if board.can_claim_draw() or board.is_insufficient_material():
        return 0

    incheck = board.is_check()
    if incheck:
        depth += 1

    if (depth < 1):
        return quiesce(board, alpha, beta)

    legal = 0
    for move in board.legal_moves:
        board.push(move)
        ply += 1
        legal += 1

        score = -alphabeta(board, -beta, -alpha, depth - 1)
        board.pop()
        ply -= 1

        if (score >= beta):
            return score

        if (score > bestscore):
            bestscore = score

        if (score > alpha):
            alpha = score

    if legal == 0:
        if incheck:
            return -INF + ply
        else:
            return 0

    return bestscore


def quiesce(board, alpha, beta):
    if is_time_limit_reached():
        return 0

    if board.is_insufficient_material():
        return 0

    stand_pat = evaluate_board(board)
    if (stand_pat >= beta):
        return beta
    if (alpha < stand_pat):
        alpha = stand_pat

    for move in board.legal_moves:
        if board.is_capture(move):
            board.push(move)

            score = -quiesce(board, -beta, -alpha)
            board.pop()

            if (score >= beta):
                return beta

            if (score > alpha):
                alpha = score

    return alpha


def selectmove(board, depth):
    global ply 

    bestMove = chess.Move.null()
    bestValue = -INF
    alpha = -INF
    beta = INF

    for move in board.legal_moves:
        board.push(move)
        ply += 1

        boardValue = -alphabeta(board, -beta, -alpha, depth - 1)
        if boardValue > bestValue:
            bestValue = boardValue
            bestMove = move

        if (boardValue > alpha):
            alpha = boardValue

        board.pop()
        ply -= 1

        if is_time_limit_reached():
            break

    return bestMove, bestValue


if __name__ == '__main__':
    global timems
    global start_time
    global ply

    fen = chess.STARTING_FEN
    # fen = "1k6/7Q/1K6/8/8/8/8/8 w - - 0 1"  # mate in 1
    # fen = "kbK5/pp6/1P6/8/8/8/8/R7 w - - 0 1"  # mate in 2
    # fen = "rnbqkb1r/1p2pppp/p2p1n2/8/3NP3/2N5/PPP2PPP/R1BQKB1R w KQkq - 0 6"  # sicilian
    
    depth = MAX_DEPTH
    timems = MAX_TIME_MS

    board = chess.Board(fen)

    while True:
        userinput = input('> ')
        line = userinput.rstrip()

        if line == 'go':
            bestmove, bestscore = None, None
            start_time = time.perf_counter()
            ply = 0

            if not board.is_game_over():
                for d in range(1, depth+1):
                    move, score = selectmove(board, d)

                    elapse = 1000 * (time.perf_counter() - start_time)

                    if elapse >= timems:
                        break  # Don't overwrite our bestmove from the time-interrupted search.

                    bestmove = move
                    bestscore = score

                    if abs(bestscore) > MATE_SCORE:
                        mate = value_to_mate(bestscore)
                        print(f'info depth {d} score mate {mate} time {int(elapse)} pv {bestmove}')  # time is in millisec
                    else:
                        print(f'info depth {d} score {bestscore} time {int(elapse)} pv {bestmove}')  # time is in millisec

                board.push(bestmove)  # update board with the bestmove
                print(f'info time {int(1000*(time.perf_counter() - start_time))}')
                print(f'bestmove {bestmove}')
            else:
                print('Game is over!')

        elif line == 'new':
            board = chess.Board()
            depth = MAX_DEPTH
            timems = MAX_TIME_MS
            print(board)
            print(f'max depth: {depth}, max time ms: {timems}')

        elif 'position fen ' in line:
            fen = ' '.join(line.split()[2:7])
            board = chess.Board(fen)

        elif line == 'board':
            print(board)

        elif line == 'fen':
            print(board.fen())

        elif line == 'epd':
            print(board.epd())

        elif 'time' in line:
            timems = int(line.split()[1])

        elif 'depth' in line:
            depth = int(line.split()[1])

        elif line == 'game':
            game = chess.pgn.Game()
            print(game.from_board(board))

        elif line == 'quit':
            break

        else:
            # assume user has entered a move
            try:
                board.push(chess.Move.from_uci(line))
            except ValueError:
                print(f'illegal move {line}')

> new
r n b q k b n r
p p p p p p p p
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
P P P P P P P P
R N B Q K B N R
max depth: 16, max time ms: 120000
> time 5000
> e2e4
> go
info depth 1 score 10 time 18 pv g8f6
info depth 2 score -40 time 140 pv g8f6
info depth 3 score 10 time 973 pv g8f6
info time 5001
bestmove g8f6
> board
r n b q k b . r
p p p p p p p p
. . . . . n . .
. . . . . . . .
. . . . P . . .
. . . . . . . .
P P P P . P P P
R N B Q K B N R
> b1c3
> go
info depth 1 score 10 time 19 pv b8c6
info depth 2 score -20 time 421 pv d7d5
info depth 3 score 10 time 2865 pv d7d5
info time 5000
bestmove d7d5
> board
r n b q k b . r
p p p . p p p p
. . . . . n . .
. . . p . . . .
. . . . P . . .
. . N . . . . .
P P P P . P P P
R . B Q K B N R
> game
[Event "?"]
[Site "?"]
[Date "????.??.??"]
[Round "?"]
[White "?"]
[Black "?"]
[Result "*"]

1. e4 Nf6 2. Nc3 d5 *
> quit

> position fen kbK5/pp6/1P6/8/8/8/8/R7 w - - 0 1
> board
k b K . . . . .
p p . . . . . .
. P . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
R . . . . . . .
> time 5000
> go
info depth 1 score 10 time 10 pv a1a5
info depth 2 score 10 time 92 pv a1a5
info depth 3 score mate 2 time 362 pv a1a6
info depth 4 score mate 2 time 2151 pv a1a6
info time 5001
bestmove a1a6
> board
k b K . . . . .
p p . . . . . .
R P . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
> go
info depth 1 score 480 time 5 pv b7a6
info depth 2 score mate -1 time 32 pv b8c7
info depth 3 score mate -1 time 184 pv b8c7
info depth 4 score mate -1 time 1314 pv b8c7
info time 5000
bestmove b8c7
> go
info depth 1 score mate 1 time 4 pv a6a7
info depth 2 score mate 1 time 37 pv a6a7
info depth 3 score mate 1 time 143 pv a6a7
info depth 4 score mate 1 time 878 pv a6a7
info depth 5 score mate 1 time 4305 pv a6a7
info time 5001
bestmove a6a7
> go
Game is over!
>

-----------------------

import time

import chess
import chess.pgn


INF = 100000
MATE_SCORE = INF-100
MAX_DEPTH = 16
MAX_TIME_MS = 120000  # 120s or 2m


# Evaluating the board
pawntable = [
    0, 0, 0, 0, 0, 0, 0, 0,
    5, 10, 10, -20, -20, 10, 10, 5,
    5, -5, -10, 0, 0, -10, -5, 5,
    0, 0, 0, 20, 20, 0, 0, 0,
    5, 5, 10, 25, 25, 10, 5, 5,
    10, 10, 20, 30, 30, 20, 10, 10,
    50, 50, 50, 50, 50, 50, 50, 50,
    0, 0, 0, 0, 0, 0, 0, 0]

knightstable = [
    -50, -40, -30, -30, -30, -30, -40, -50,
    -40, -20, 0, 5, 5, 0, -20, -40,
    -30, 5, 10, 15, 15, 10, 5, -30,
    -30, 0, 15, 20, 20, 15, 0, -30,
    -30, 5, 15, 20, 20, 15, 5, -30,
    -30, 0, 10, 15, 15, 10, 0, -30,
    -40, -20, 0, 0, 0, 0, -20, -40,
    -50, -40, -30, -30, -30, -30, -40, -50]

bishopstable = [
    -20, -10, -10, -10, -10, -10, -10, -20,
    -10, 5, 0, 0, 0, 0, 5, -10,
    -10, 10, 10, 10, 10, 10, 10, -10,
    -10, 0, 10, 10, 10, 10, 0, -10,
    -10, 5, 5, 10, 10, 5, 5, -10,
    -10, 0, 5, 10, 10, 5, 0, -10,
    -10, 0, 0, 0, 0, 0, 0, -10,
    -20, -10, -10, -10, -10, -10, -10, -20]

rookstable = [
    0, 0, 0, 5, 5, 0, 0, 0,
    -5, 0, 0, 0, 0, 0, 0, -5,
    -5, 0, 0, 0, 0, 0, 0, -5,
    -5, 0, 0, 0, 0, 0, 0, -5,
    -5, 0, 0, 0, 0, 0, 0, -5,
    -5, 0, 0, 0, 0, 0, 0, -5,
    5, 10, 10, 10, 10, 10, 10, 5,
    0, 0, 0, 0, 0, 0, 0, 0]

queenstable = [
    -20, -10, -10, -5, -5, -10, -10, -20,
    -10, 0, 0, 0, 0, 0, 0, -10,
    -10, 5, 5, 5, 5, 5, 0, -10,
    0, 0, 5, 5, 5, 5, 0, -5,
    -5, 0, 5, 5, 5, 5, 0, -5,
    -10, 0, 5, 5, 5, 5, 0, -10,
    -10, 0, 0, 0, 0, 0, 0, -10,
    -20, -10, -10, -5, -5, -10, -10, -20]

kingstable = [
    20, 30, 10, 0, 0, 10, 30, 20,
    20, 20, 0, 0, 0, 0, 20, 20,
    -10, -20, -20, -20, -20, -20, -20, -10,
    -20, -30, -30, -40, -40, -30, -30, -20,
    -30, -40, -40, -50, -50, -40, -40, -30,
    -30, -40, -40, -50, -50, -40, -40, -30,
    -30, -40, -40, -50, -50, -40, -40, -30,
    -30, -40, -40, -50, -50, -40, -40, -30]


def is_time_limit_reached():
    global start_time
    global timems

    return 1000 * (time.perf_counter() - start_time) >= timems


def evaluate_board(board):
    wp = len(board.pieces(chess.PAWN, chess.WHITE))
    bp = len(board.pieces(chess.PAWN, chess.BLACK))
    wn = len(board.pieces(chess.KNIGHT, chess.WHITE))
    bn = len(board.pieces(chess.KNIGHT, chess.BLACK))
    wb = len(board.pieces(chess.BISHOP, chess.WHITE))
    bb = len(board.pieces(chess.BISHOP, chess.BLACK))
    wr = len(board.pieces(chess.ROOK, chess.WHITE))
    br = len(board.pieces(chess.ROOK, chess.BLACK))
    wq = len(board.pieces(chess.QUEEN, chess.WHITE))
    bq = len(board.pieces(chess.QUEEN, chess.BLACK))

    material = 100 * (wp - bp) + 320 * (wn - bn) + 330 * (wb - bb) + 500 * (wr - br) + 900 * (wq - bq)

    pawnsq = sum([pawntable[i] for i in board.pieces(chess.PAWN, chess.WHITE)])
    pawnsq = pawnsq + sum([-pawntable[chess.square_mirror(i)]
                           for i in board.pieces(chess.PAWN, chess.BLACK)])
    knightsq = sum([knightstable[i] for i in board.pieces(chess.KNIGHT, chess.WHITE)])
    knightsq = knightsq + sum([-knightstable[chess.square_mirror(i)]
                               for i in board.pieces(chess.KNIGHT, chess.BLACK)])
    bishopsq = sum([bishopstable[i] for i in board.pieces(chess.BISHOP, chess.WHITE)])
    bishopsq = bishopsq + sum([-bishopstable[chess.square_mirror(i)]
                               for i in board.pieces(chess.BISHOP, chess.BLACK)])
    rooksq = sum([rookstable[i] for i in board.pieces(chess.ROOK, chess.WHITE)])
    rooksq = rooksq + sum([-rookstable[chess.square_mirror(i)]
                           for i in board.pieces(chess.ROOK, chess.BLACK)])
    queensq = sum([queenstable[i] for i in board.pieces(chess.QUEEN, chess.WHITE)])
    queensq = queensq + sum([-queenstable[chess.square_mirror(i)]
                             for i in board.pieces(chess.QUEEN, chess.BLACK)])
    kingsq = sum([kingstable[i] for i in board.pieces(chess.KING, chess.WHITE)])
    kingsq = kingsq + sum([-kingstable[chess.square_mirror(i)]
                           for i in board.pieces(chess.KING, chess.BLACK)])

    eval = material + pawnsq + knightsq + bishopsq + rooksq + queensq + kingsq

    if board.turn:
        return eval
    return -eval


def value_to_mate(value):
    if (value < -MATE_SCORE):
        return -(INF + value) // 2
    
    elif (value > MATE_SCORE):
        return (INF - value + 1) // 2

    return 0


# Searching the best move using minimax and alphabeta algorithm with negamax implementation
def alphabeta(board, alpha, beta, depth):
    global timems
    global start_time
    global ply

    bestscore = -INF

    if is_time_limit_reached():
        return 0

    if board.can_claim_draw() or board.is_insufficient_material():
        return 0

    incheck = board.is_check()
    if incheck:
        depth += 1

    if (depth < 1):
        return quiesce(board, alpha, beta)

    legal = 0
    for move in board.legal_moves:
        board.push(move)
        ply += 1
        legal += 1

        score = -alphabeta(board, -beta, -alpha, depth - 1)
        board.pop()
        ply -= 1

        if (score >= beta):
            return score

        if (score > bestscore):
            bestscore = score

        if (score > alpha):
            alpha = score

    if legal == 0:
        if incheck:
            return -INF + ply
        else:
            return 0

    return bestscore


def quiesce(board, alpha, beta):
    if is_time_limit_reached():
        return 0

    if board.is_insufficient_material():
        return 0

    stand_pat = evaluate_board(board)
    if (stand_pat >= beta):
        return beta
    if (alpha < stand_pat):
        alpha = stand_pat

    for move in board.legal_moves:
        if board.is_capture(move):
            board.push(move)

            score = -quiesce(board, -beta, -alpha)
            board.pop()

            if (score >= beta):
                return beta

            if (score > alpha):
                alpha = score

    return alpha


def selectmove(board, depth):
    global ply 

    bestMove = chess.Move.null()
    bestValue = -INF
    alpha = -INF
    beta = INF

    for move in board.legal_moves:
        board.push(move)
        ply += 1

        boardValue = -alphabeta(board, -beta, -alpha, depth - 1)
        if boardValue > bestValue:
            bestValue = boardValue
            bestMove = move

        if (boardValue > alpha):
            alpha = boardValue

        board.pop()
        ply -= 1

        if is_time_limit_reached():
            break

    return bestMove, bestValue


if __name__ == '__main__':
    global timems
    global start_time
    global ply

    fen = chess.STARTING_FEN
    # fen = "1k6/7Q/1K6/8/8/8/8/8 w - - 0 1"  # mate in 1
    # fen = "kbK5/pp6/1P6/8/8/8/8/R7 w - - 0 1"  # mate in 2
    # fen = "rnbqkb1r/1p2pppp/p2p1n2/8/3NP3/2N5/PPP2PPP/R1BQKB1R w KQkq - 0 6"  # sicilian
    
    depth = MAX_DEPTH
    timems = MAX_TIME_MS

    board = chess.Board(fen)

    while True:
        userinput = input('> ')
        line = userinput.rstrip()

        if line == 'go':
            bestmove, bestscore = None, None
            start_time = time.perf_counter()
            ply = 0

            if not board.is_game_over():
                for d in range(1, depth+1):
                    move, score = selectmove(board, d)

                    elapse = 1000 * (time.perf_counter() - start_time)

                    if elapse >= timems:
                        break  # Don't overwrite our bestmove from the time-interrupted search.

                    bestmove = move
                    bestscore = score

                    if abs(bestscore) > MATE_SCORE:
                        mate = value_to_mate(bestscore)
                        print(f'info depth {d} score mate {mate} time {int(elapse)} pv {bestmove}')  # time is in millisec
                    else:
                        print(f'info depth {d} score {bestscore} time {int(elapse)} pv {bestmove}')  # time is in millisec

                board.push(bestmove)  # update board with the bestmove
                print(f'info time {int(1000*(time.perf_counter() - start_time))}')
                print(f'bestmove {bestmove}')
            else:
                print('Game is over!')

        elif line == 'new':
            board = chess.Board()
            depth = MAX_DEPTH
            timems = MAX_TIME_MS
            print(board)
            print(f'max depth: {depth}, max time ms: {timems}')

        elif 'position fen ' in line:
            fen = ' '.join(line.split()[2:7])
            board = chess.Board(fen)

        elif line == 'board':
            print(board)

        elif line == 'fen':
            print(board.fen())

        elif line == 'epd':
            print(board.epd())

        elif 'time' in line:
            timems = int(line.split()[1])

        elif 'depth' in line:
            depth = int(line.split()[1])

        elif line == 'game':
            game = chess.pgn.Game()
            print(game.from_board(board))

        elif line == 'quit':
            break

        else:
            # assume user has entered a move
            try:
                board.push(chess.Move.from_uci(line))
            except ValueError:
                print(f'illegal move {line}')

> new
r n b q k b n r
p p p p p p p p
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
P P P P P P P P
R N B Q K B N R
max depth: 16, max time ms: 120000
> time 5000
> e2e4
> go
info depth 1 score 10 time 18 pv g8f6
info depth 2 score -40 time 140 pv g8f6
info depth 3 score 10 time 973 pv g8f6
info time 5001
bestmove g8f6
> board
r n b q k b . r
p p p p p p p p
. . . . . n . .
. . . . . . . .
. . . . P . . .
. . . . . . . .
P P P P . P P P
R N B Q K B N R
> b1c3
> go
info depth 1 score 10 time 19 pv b8c6
info depth 2 score -20 time 421 pv d7d5
info depth 3 score 10 time 2865 pv d7d5
info time 5000
bestmove d7d5
> board
r n b q k b . r
p p p . p p p p
. . . . . n . .
. . . p . . . .
. . . . P . . .
. . N . . . . .
P P P P . P P P
R . B Q K B N R
> game
[Event "?"]
[Site "?"]
[Date "????.??.??"]
[Round "?"]
[White "?"]
[Black "?"]
[Result "*"]

1. e4 Nf6 2. Nc3 d5 *
> quit

> position fen kbK5/pp6/1P6/8/8/8/8/R7 w - - 0 1
> board
k b K . . . . .
p p . . . . . .
. P . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
R . . . . . . .
> time 5000
> go
info depth 1 score 10 time 10 pv a1a5
info depth 2 score 10 time 92 pv a1a5
info depth 3 score mate 2 time 362 pv a1a6
info depth 4 score mate 2 time 2151 pv a1a6
info time 5001
bestmove a1a6
> board
k b K . . . . .
p p . . . . . .
R P . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
> go
info depth 1 score 480 time 5 pv b7a6
info depth 2 score mate -1 time 32 pv b8c7
info depth 3 score mate -1 time 184 pv b8c7
info depth 4 score mate -1 time 1314 pv b8c7
info time 5000
bestmove b8c7
> go
info depth 1 score mate 1 time 4 pv a6a7
info depth 2 score mate 1 time 37 pv a6a7
info depth 3 score mate 1 time 143 pv a6a7
info depth 4 score mate 1 time 878 pv a6a7
info depth 5 score mate 1 time 4305 pv a6a7
info time 5001
bestmove a6a7
> go
Game is over!
>

I have to store a particular value in response of one API into two arrays in karate where array length can be even or odd number

Copy

Download

* def list = [1, 2, 3, 4]
* def odd1 = list.filter(x => x % 2)
* match odd1 == [1, 3]
* def odd2 = karate.filter(list, function(x){ return x % 2 != 0 })
* match odd2 == [1, 3]
* def even = list.filter((x, i) => i % 2)
* match even == [2, 4]

* def odd = []
* def list = [1, 2, 3, 4]
* list.forEach(x => {if (x % 2) odd.push(x)})
* match odd == [1, 3]

-----------------------

* def list = [1, 2, 3, 4]
* def odd1 = list.filter(x => x % 2)
* match odd1 == [1, 3]
* def odd2 = karate.filter(list, function(x){ return x % 2 != 0 })
* match odd2 == [1, 3]
* def even = list.filter((x, i) => i % 2)
* match even == [2, 4]

* def odd = []
* def list = [1, 2, 3, 4]
* list.forEach(x => {if (x % 2) odd.push(x)})
* match odd == [1, 3]

How to apply if condition on the basis of response header in karate

Copy

Download

* if (karate.get("responseHeaders['APP-ID'][0]")) karate.call('called.feature', { id: 'foo' })

See all related Code Snippets

Community Discussions

Trending Discussions on polyglot

Karate - Get CSV column value having space
Using GraalVM (scripting) within Wildfly/JBoss
vim - How to Split single line Array literal into multiple lines?
renv + venv + jupyterlab + IRkernel: will it blend?
Defining two o more functions in karate-config.js
Does GraalVM use same thread and heap space when calling polyglot functions?
Minimax returning illegal uci move - move generation doesn't update?
Is there a way to use a java object as an argument for a function and return one of said objects's values in GraalJS?
How to use pomless tycho artifacts in non-tycho project
Karate - want to get url along with query params in a variable

Trending Discussions on polyglot

QUESTION

Karate - Get CSV column value having space

Asked 2022-Mar-25 at 12:52

I want to get the 'Instrument ID' column value of the below CSV data where the CSV column header having spaces

Instrument ID, Instrument Name
SS-01,TestData

This is my code

* json csvContents = read('instument-info.csv')
* print csvContents
* print csvContents[0] 
* print csvContents[0].Instrument ID

But its throws the below error

01: karate.log('[print]',csvContents[0].Instrument ID)
<<<<
org.graalvm.polyglot.PolyglotException: SyntaxError: Unnamed:1:43 Expected , but found ID
karate.log('[print]',csvContents[0].Instrument ID)

ANSWER

Answered 2022-Mar-25 at 12:52

Use the JS "bracket" notation. For example, try this:

* csv data = 
"""
Instrument ID, Instrument Name
SS-01,TestData
"""
* match data[0]['Instrument ID'] == 'SS-01'

Source https://stackoverflow.com/questions/71616479

QUESTION

vim - How to Split single line Array literal into multiple lines?

Asked 2022-Mar-06 at 16:33

Say I have this:

[ |"TypeScript", "HTML", "CSS", "SQL", "JavaScript" ]

Is there a quick way to bring me to this:

[ 
  |"TypeScript", 
  "HTML", 
  "CSS", 
  "SQL", 
  "JavaScript" 
]

I don't really care about where the cursor ends up, I just want to efficiently switch to/from single line to multi line.

The one solution I've found online is to do a search and replace. This hasn't helped me so far because the indenting rules are not respected. If I could find a search and replace technique that respected indenting I'd be happy to make a mapping and use that. So far the search and replace I've found looks like '<,'>s/,/,\r/g, and using the above example, would result in:

[ 
|"TypeScript", 
"HTML", 
"CSS", 
"SQL", 
"JavaScript" 
]

I know there's a way to do this because I've pressed whatever key combo this is by accident in the past and seen the desired effect, but not known what I accidentally pressed. It's possible it's in one of my plugins, so I've posted my plugins below.

My plugins:

'tpope/vim-commentary'
'tpope/vim-fugitive'
'tpope/vim-rhubarb'
'shumphrey/fugitive-gitlab.vim'
'terryma/vim-multiple-cursors'
'rhysd/committia.vim'
'tommcdo/vim-lion'
'elmcast/elm-vim'
'sheerun/vim-polyglot'
'tmsvg/pear-tree'
'tpope/vim-surround'
'Valloric/YouCompleteMe',
'ctrlpvim/ctrlp.vim',
'scrooloose/nerdtree',
'nathanaelkane/vim-indent-guides'
'fholgado/minibufexpl.vim'
'SirVer/ultisnips'
'honza/vim-snippets'

I'd also be happy to be exposed to another plugin that has the desired behavior.

Thanks!

ANSWER

Answered 2022-Mar-06 at 11:26

Well, '<,'>s/,/,\r/g actually results in:

[ "TypeScript",
 "HTML",
 "CSS",
 "SQL",
 "JavaScript" ]

which is even farther from the desired result than what you posted.

If we stick with simple substitutions, the commas are irrelevant, here. It's the spaces that must be substituted:

:s/\s/\r/g

which results in:

[
"TypeScript",
"HTML",
"CSS",
"SQL",
"JavaScript"
]

with, the cursor on the ].

The next step is to reindent the lines you just changed:

='[

which gives you the desired result:

[
    "TypeScript",
    "HTML",
    "CSS",
    "SQL",
    "JavaScript"
]

See :help = and :help '[.

This is easy to map to something shorter:

nnoremap <key> :s/\s/\r/g<CR>='[

but it will do more harm than good in scenarios that vary, even slightly, from the one in your question.

What can we do to make this more generic?

First, instead of doing the substitution on a whole line, we can make a visual selection and restrict the substitution to that visual selection:

vi[                   " visually select what's between the brackets
:'<,'>s/\%V\s/\r/g    " substitute spaces contained in the visual
                      " selection with \r

This doesn't work, sadly, because the boundaries of \%V don't move with the text as we do our substitution. As soon as the first space is substituted, the rest goes one line below the selection and there is no space left to substitute in the visual area. Bummer.

Still keeping our substitutions short, we can work around that situation by going at it in two steps:

substitute spaces with an exotic character that's unlikely to appear elsewhere in the line,
substitute that fancy character with \r.

vi[
:'<,'>s/\%V\s/§/g
:s/§/\r/g
='[

This works relatively well so we can change our previous mapping:

function! ExpandList()
    silent s/\%V\s/§/g
    silent s/§/\r/g
    silent normal ='[
endfunction
xnoremap <key> :<C-u>call ExpandList()<CR>

our normal mode mapping becomes a visual mode mapping,
instead of having a complicated RHS, we call a function that does the heavy lifting,
the function handles the three steps described earlier without messing with :help 'hlsearch',
the commands are silenced for improved comfort.

At this point, we can solve our problem by:

making a visual selection,
pressing the mapping above,

which is not too shabby.

Note that there is still room for improvement:

the initial pattern, \s, won't handle uneven spacing well,
we could make a custom operator instead of/as well as a visual mode mapping.

The first "issue" can be dealt with by sprinkling a little bit of vimscript over our substitutions:

function! ExpandList()
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim() })
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

instead of the two-steps hack from earlier, we use a single substitution on the whole visual selection,
the replace part of the substitution is an expression where…
- submatch(0) represents the whole match,
- split(',') splits the string on commas (which became relevant again!) into a list,
- map({ i, v -> v->trim() }) removes any whitespace padding from each entry in the list, this is done to address possible unevenness in the original text (think ["foo","bar" , "baz" ]),
- join(",\r") puts it all back into a single string, separated with commas and \r,
- additional \rs are added at the beginning and the end of the replacement string to ensure that the brackets are on their own lines.

See :help sub-replace-expression, :help split(), :help map(), :help trim(), and :help join().

Since we are at it, why don't we deal with the second "issue"?

The "operator+motion" model is one of those life-changing Vim features. Instead of

select some text and then do something with it

which is where we currently are, we

do something with some text

which manages to be both succinct and expressive at the same time.

And Vim indeed lets us create our own operators: :help map-operator.

As per the documentation above, we only need to do some minor modifications to our function definition:

function! ExpandList(type, ...)
    silent s/\%V.*\%V/\="\r" . submatch(0)
            \ ->split(',')
            \ ->map({ i, v -> v->trim()})
            \ ->join(",\r") . "\r"/g
    silent normal ='[
endfunction

and to our mapping:

nnoremap <key> :set opfunc=ExpandList<CR>g@

And we have a pretty clean and idiomatic solution: our own "Expand list" operator:

Source https://stackoverflow.com/questions/71368046

QUESTION

renv + venv + jupyterlab + IRkernel: will it blend?

Asked 2022-Feb-24 at 20:06

Short version

What is the simple and elegant way to use renv, venv and jupyterlab with IRkernel together? In particular, how to automatically activate renv from jupyter notebook that is not in the root directory?

Long version

I'm embracing a "polyglot" data science style, which means using both python and R in tandem. Now venv is awesome, and renv is awesome, and jupyterlab is awesome, so I'm trying to figure out what is the neat way to use them all together.

I almost have it, so probably a few hints would be enough to finish this setup. Here's where I'm at.

System

Start with a clean OS, and install system level requirements: R + renv and Python + venv. For example on Ubuntu it would be approximatelly like that:

# R
sudo apt install r-base
sudo R -e "install.packages('renv')"

# Python
sudo apt install python3.8
sudo apt install python3.8-venv

Project

Now create a bare bones project jupyrenv with two files:

jupyrenv/
├── DESCRIPTION
└── requirements.txt

DESCRIPTION contains R dependencies:

Suggests:
    IRkernel,
    fortunes

requirements.txt contains python dependencies:

jupyterlab

Create virtual environments and install dependencies (order matters, R has to follow python):

# Python
python3.8 -m venv venv
source venv/bin/activate
pip install -r requirements.txt

# R
R -e "renv::init(bare=TRUE)"
R -e "renv::install()"
R -e "IRkernel::installspec()"

Very neat so far!

Jupyter

launch jupyter from the command line and rejoice, it works!

jupyter-lab

What's not to like?

Unfortunatelly, if I create a folder (say notebooks) and launch an R notebook there, it does not work :(

[I 2022-02-23 19:07:24.628 ServerApp] Creating new directory in 
[I 2022-02-23 19:07:31.159 ServerApp] Creating new notebook in /notebooks
[I 2022-02-23 19:07:31.416 ServerApp] Kernel started: 0aa2c276-18dc-4511-b308-e78234fa71d4
Error in loadNamespace(name) : there is no package called ‘IRkernel’
Calls: :: ... loadNamespace -> withRestarts -> withOneRestart -> doWithOneRestart
Execution halted

Attempt to fix

It seems that renv is not used from a subfolder, so we need to hint the R process to use it. I tried to add an extra .Rprofile file the notebooks subfolder:

jupyrenv/
├── DESCRIPTION
├── requirements.txt
├── renv
├── venv
├── notebooks
│   ├── .Rprofile
│   └── Untitled.ipynb
├── .Rprofile
└── Untitled.ipynb

With the following contents:

.Rprofile:

source("../renv/activate.R")

And it kind of works, but not really. First, when trying to create an R notebook in the notebooks directory, it creates a new renv:

[I 2022-02-23 19:22:28.986 ServerApp] Creating new notebook in /notebooks
[I 2022-02-23 19:22:29.298 ServerApp] Kernel started: b40a88b3-b0bb-4839-af45-85811ec3073c
# Bootstrapping renv 0.15.2 --------------------------------------------------
* Downloading renv 0.15.2 ... OK (downloaded source)
* Installing renv 0.15.2 ... Done!
* Successfully installed and loaded renv 0.15.2.

Then that instance of jupyter works, and I can use it, but if I restart, it stops working and get's back to the missing IRkernel error:

[I 2022-02-23 19:24:58.912 ServerApp] Kernel started: 822d9372-47fd-43f5-8ac7-77895ef124dc
Error in loadNamespace(name) : there is no package called ‘IRkernel’
Calls: :: ... loadNamespace -> withRestarts -> withOneRestart -> doWithOneRestart

What am I missing?

ANSWER

Answered 2022-Feb-24 at 20:06

I opened this question as an issue in the renv github repo, and maintainers kindly provided a workaround. The contents of the notebooks/.Rprofile should be as follows:

owd <- setwd(".."); source("renv/activate.R"); setwd(owd)

It blends! 🎉

Source https://stackoverflow.com/questions/71242328

QUESTION

Does GraalVM use same thread and heap space when calling polyglot functions?

Asked 2022-Feb-02 at 20:50

If I call R code from Java within GraalVM (using GraalVM's polyglot function), does the R code and the Java code run on the same Java thread (ie there's no switching between OS or Java threads etc?) Also, is it the same "memory/heap" space? That is, in the example code below (which I took from https://www.baeldung.com/java-r-integration)

public double mean(int[] values) {
    Context polyglot = Context.newBuilder().allowAllAccess(true).build();
    String meanScriptContent = RUtils.getMeanScriptContent(); 
    polyglot.eval("R", meanScriptContent);
    Value rBindings = polyglot.getBindings("R");
    Value rInput = rBindings.getMember("c").execute(values);
    return rBindings.getMember("customMean").execute(rInput).asDouble();
}

does the call rBindings.getMember("c").execute(values) cause the values object (an array of ints) to be copied? Or is GraalVM smart enough to consider it a pointer to the same memory space? If it's a copy, is the copying time the same (or similar, ie within say 20%) time as if I were to a normal java clone() operation? Finally, does calling a polyglot function (in this case customMean implemented in R) have the same overhead as calling a native Java function? Bonus question: can the GraalVM JIT compiler even compile accross the layers, eg say I had this:

final long sum = IntStream.range(0,10000)
.stream()
.map(x -> x+4)
.map(x -> <<<FastR version of the following inverse operation: x-4 >>>)
.sum();

would the GraalVM compiler be as smart as say a normal Java JIT compiler and realize that the whole above statement can be simply written without the two map operations (Since they cancel each other out)?

FYI: I'm considering using GraalVM to run both my Java code and my R code, once the issue I identified here is resolved (Why is FASTR (ie GraalVM version of R) 10x *slower* compared to normal R despite Oracle's claim of 40x *faster*?) and one of the motivitations is that I hope to eliminate the 50% of time that calling R (using RServe()) from Java is spent on network IO (because Java communicates with RServer over TCP/IP and RServe and Java are on different threads and memory spaces etc etc.)

ANSWER

Answered 2022-Feb-02 at 20:50

does the R code and the Java code run on the same Java thread. Also, is it the same "memory/heap" space?

Yes and yes. You can even use GraalVM VisualVM to inspect the heap: it provides standard Java view where you can see instances of FastR internal representations like RIntVector mingled with the rest of the other Java objects, or R view where you can see integer vectors, lists, environments, ...

does the call rBindings.getMember("c").execute(values) cause the values object (an array of ints) to be copied?

In general yes: most objects are passed to R as-is. Inside R you have two choices:

Explicitly convert them to some concrete type, i.e., as.integer(arg), which does not make a copy, but tells R explicitly how you want that value to be treated as "native" R type including R's value semantics.
Leave it up to the default rules, which will be applied once your objects is passed to some R builtin, e.g., int[] is treated as integer vector (but note that treating it as a list would be also reasonable in some cases). Again no copies here. And the object itself keeps its reference semantics.

However, sometimes FastR needs to make a copy:

some builtin functions cannot handle foreign objects yet
R language often implicitly copies vectors, because of its value semantics, arguments coercion, etc.
when a vector is passed to native R extension, we need to move its data to off heap memory

I would say that if you happen to have a very large vector, say GBs of data, you need to be very careful about it even in regular R. Note: FastR vectors are by default backed by Java arrays, so their size limitations apply to FastR vectors too.

Finally, does calling a polyglot function (in this case customMean implemented in R) have the same overhead as calling a native Java function?

Mostly yes, except that the function cannot be pulled and inlined into the surrounding Java code(+). The call itself is as fast as regular Java call. For the example you give: it cannot be optimized as you suggest, because the R function cannot be inlined(+). However, I would be very skeptical that any compiler can optimize this as you suggest even if both functions where pure Java code. That being said, yes: some things that compiler can optimize, like eliminating some useless computations that it can analyze well, is not going to work because of the impossibility to inline code across the Java <-> R boundary(+).

(+) Unless you'd run the Java code with Espresso (Java on Truffle), but then you would not be using Context API but Espresso's interop support.

Source https://stackoverflow.com/questions/70927140

QUESTION

Minimax returning illegal uci move - move generation doesn't update?

Asked 2022-Jan-27 at 13:08

When I test my code with the position r1bqkbr1/pp2pppp/2n1p2n/2p5/3P4/7N/PPP2PPP/RNBQKB1R w KQq - 3 6 the code below outputs ValueError: illegal uci: 'd8d7' in r1bqkbr1/pp2pppp/2n1p2n/2p5/3P4/7N/PPP2PPP/RNBQKB1R w KQq - 3 6 when run. The issue seems to be that the board is not updating after I push a new move (it still generates legal moves thinking it is black to move, when it is actually white to move). How do I fix this?

import random
import chess
import chess.polyglot as book
from evaluate import *

searched_position_evals = {}

def choose_move(board, depth, is_max):
  # TODO: endgame database
  best_move = ""
  best_eval = float('inf')
  if not is_max: best_eval *= -1
  if check_opening_book(board)[0]: return check_opening_book(board)[1].uci()
  for move in list(board.legal_moves):
    print(f"evaluating {move}")
    board.push_uci(move.uci())
    eval = minimax(board, depth, board.turn == chess.WHITE)
    if is_max: best_eval = max(best_eval, eval) 
    else: best_eval = min(best_eval, eval)
    if best_eval == eval: best_move = move
    board.pop()
  return best_move

def check_opening_book(board):
  with book.open_reader("assets/openings.bin") as reader:
    if len(list(reader.find_all(board))) == 0:
      return (False, "")
    else:
      return (True, list(reader.find_all(board))[random.choice(range(0, len(list(reader.find_all(board)))))].move)

def minimax(board, depth, is_max):
  if depth == 0: 
    return evaluate(board)
  elif board.fen in searched_position_evals: 
    board.pop()
    return searched_position_evals[board.fen]
  else:
    if is_max:
      max_eval = -float('inf')
      for move in list(board.legal_moves):
        board.push_uci(move.uci())
        searched_eval = minimax(board, depth - 1, False)
        searched_position_evals[board.fen] = searched_eval
        max_eval = max(max_eval, searched_eval)
        board.pop()
      return max_eval
    else:
      min_eval = float('inf')
      for move in list(board.legal_moves):
        board.push_uci(move.uci())
        searched_eval = minimax(board, depth - 1, True)
        searched_position_evals[board.fen] = searched_eval
        min_eval = min(min_eval, searched_eval)
        board.pop()
      return min_eval

print(choose_move(chess.Board("r1bqkb1r/pp2pppp/2n1p2n/2p5/3P4/7N/PPP2PPP/RNBQKB1R b KQkq - 2 5"), 3, False))

ANSWER

Answered 2022-Jan-27 at 13:08

Comment out the board.pop() in the following.

def minimax(board, depth, is_max):
  if depth == 0: 
    return evaluate(board)
  elif board.fen in searched_position_evals: 
    # board.pop()
    return searched_position_evals[board.fen]
...

Source https://stackoverflow.com/questions/70877974

QUESTION

Is there a way to use a java object as an argument for a function and return one of said objects's values in GraalJS?

Asked 2022-Jan-13 at 16:45

I want to use a Java object new Train() as an argument to pass into a JavaScript function, here is the Java code

public void execute() {

        File script = new File("/Test.js");

        ScriptEngine engine = new ScriptEngineManager().getEngineByName("graal.js");

        try {
            engine.eval(new FileReader(script));
            Invocable invocable = (Invocable)engine;
            
            Object result = invocable.invokeFunction("fun1", new Train());
            System.out.println(result);
        } catch(Exception e) {
            e.printStackTrace();
        }

}

public class Train {

     private double speed = 0.0D;
     
     public Train() {
          this.speed = 10.5D;
     }

     public double getSpeed() {
          return this.speed;
     }
}

JavaScript code

var fun1 = function test(train) {
    print(train.getSpeed());
    return train.getSpeed();
}

As of right now it puts this error in the console

[16:56:42] [INFO]: [STDERR]: javax.script.ScriptException: org.graalvm.polyglot.PolyglotException: TypeError: invokeMember (getSpeed) on ScriptExecutor$Train@429b2a7b failed due to: Unknown identifier: getSpeed [16:56:42] [INFO]: [STDERR]: at com.oracle.truffle.js.scriptengine.GraalJSScriptEngine.toScriptException(GraalJSScriptEngine.java:483) [16:56:42] [INFO]: [STDERR]: at com.oracle.truffle.js.scriptengine.GraalJSScriptEngine.invokeFunction(GraalJSScriptEngine.java:558)

Is there any way to make this work?

ANSWER

Answered 2022-Jan-13 at 16:45

GraalJS (and GraalVM in general) has tight security/access controls by default. GraalJS is not exposing getSpeed() (or any other field or method) on the Train instance to JavaScript.

You can open up access to all host fields/methods with a configuration setting:

Bindings bindings = engine.getBindings(ScriptContext.ENGINE_SCOPE);
bindings.put("polyglot.js.allowHostAccess", true);

or instead enable it on a more granular level by decorating getSpeed() in Train:

import org.graalvm.polyglot.HostAccess;
// ...
@HostAccess.Export
public double getSpeed() {
    return this.speed;
}

Source https://stackoverflow.com/questions/70689954

QUESTION

How to use pomless tycho artifacts in non-tycho project

Asked 2022-Jan-06 at 14:26

I have two projects:

An Eclipse project build with pomless Tycho approach
A plain Java project build with plain Maven, no OSGI, no Tycho

I need to use some of the bundles from the 1st project in the 2nd project. I tried to install the jar files from the 1st project into a local maven repository using mvn clean install. And tried to reference them from the 2nd project. But I get the following error:

Failed to execute goal on project ...: Could not resolve dependencies for project ...: Failed to collect dependencies at bpms:bpms.util.jdk:jar:0.1.0-SNAPSHOT: Failed to read artifact descriptor for bpms:bpms.util.jdk:jar:0.1.0-SNAPSHOT: Failure to find bpms:bundles:pom:1.0.0-SNAPSHOT in https://repo.maven.apache.org/maven2 was cached in the local repository, the resolution will not be reattempted until the update interval of central has elapsed or updates are forced -> [Help 1]

The bpms.util.jdk-0.1.0-SNAPSHOT.pom file contains the following:

<?xml version="1.0" encoding="UTF-8"?>
<project xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 https://maven.apache.org/xsd/maven-4.0.0.xsd" xmlns="http://maven.apache.org/POM/4.0.0"
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
  <modelVersion>4.0.0</modelVersion>
  <parent>
    <groupId>bpms</groupId>
    <artifactId>bundles</artifactId>
    <version>1.0.0-SNAPSHOT</version>
    <relativePath>..\.polyglot.pom.tycho</relativePath>
  </parent>
  <artifactId>bpms.util.jdk</artifactId>
  <version>0.1.0-SNAPSHOT</version>
  <packaging>eclipse-plugin</packaging>
  <name>jdk utils</name>
</project>

It seems that the problem is caused by the parent artifact. Is it possible to install my artifacts as standalone artifacts without reference to parent bundles?

What is the right approach? I can't use a pomless Tycho and should define a separate pom.xml for each bundle?

ANSWER

Answered 2022-Jan-06 at 14:26

It seems that the simplest approach is to install jar files using mvn install:install-file. Here is a bat-file that could be useful for someone:

@echo off

set MVN_HOME=C:/Tools/apache-maven-3.6.3
set BUNDLES_HOME=C:/Work/workspace-bpms-trunk/bundles
set ECLIPSE_HOME=C:/Tools/eclipse/plugins

set PATH=%MVN_HOME%/bin;%PATH%

for /f "tokens=1,2 delims=:" %%E in (deps.txt) do (
  if exist %BUNDLES_HOME%/%%F (
    for /f "tokens=1,2 delims=: " %%G in (%BUNDLES_HOME%/%%F/META-INF/MANIFEST.MF) do (
      if "%%G" == "Bundle-Version" (
        call mvn install:install-file -DgroupId=%%E -DartifactId=%%F -Dversion=%%~nH-SNAPSHOT -DgeneratePom=true -Dpackaging=jar -Dfile="%BUNDLES_HOME%/%%F/target/%%F-%%~nH-SNAPSHOT.jar"
      )
    )
  ) else (
    for %%G in (%ECLIPSE_HOME%/%%F_*.jar) do (
      for /f "tokens=2 delims=_" %%H in ("%%~nG") do (
        call mvn install:install-file -DgroupId=%%E -DartifactId=%%F -Dversion=%%H -DgeneratePom=true -Dpackaging=jar -Dfile="%ECLIPSE_HOME%/%%~nG.jar"
      )
    )
  )
)

It reads groupId and artifactId from deps.txt file of the following format:

org.eclipse.ocl:org.eclipse.ocl
org.eclipse.ocl:org.eclipse.ocl.common
org.eclipse.ocl:org.eclipse.ocl.ecore
org.eclipse.ocl:org.eclipse.ocl.pivot

At first it tries to find a bundle in BUNDLES_HOME. If found then it reads a bundle version from META-INF/MANIFEST.MF and installs jar into a local maven repository. pom-files are generated.

If the bundle not found in BUNDLES_HOME then it tries to find it in ECLIPSE_HOME.

The second script reads deps.txt and generates a list of dependencies for pom.xml:

@echo off

set BUNDLES_HOME=C:/Work/workspace-bpms-trunk/bundles
set ECLIPSE_HOME=C:/Tools/eclipse/plugins

break > deps-gen.txt

for /f "tokens=1,2 delims=:" %%E in (deps.txt) do (
  if exist %BUNDLES_HOME%/%%F (
    for /f "tokens=1,2 delims=: " %%G in (%BUNDLES_HOME%/%%F/META-INF/MANIFEST.MF) do (
      if "%%G" == "Bundle-Version" (
        echo        ^<dependency^>>> deps-gen.txt
        echo            ^<groupId^>%%E^</groupId^>>> deps-gen.txt
        echo            ^<artifactId^>%%F^</artifactId^>>> deps-gen.txt
        echo            ^<version^>%%~nH-SNAPSHOT^</version^>>> deps-gen.txt
        echo        ^</dependency^>>> deps-gen.txt
      )
    )
  ) else (
    for %%G in (%ECLIPSE_HOME%/%%F_*.jar) do (
      for /f "tokens=2 delims=_" %%H in ("%%~nG") do (
        echo        ^<dependency^>>> deps-gen.txt
        echo            ^<groupId^>%%E^</groupId^>>> deps-gen.txt
        echo            ^<artifactId^>%%F^</artifactId^>>> deps-gen.txt
        echo            ^<version^>%%H^</version^>>> deps-gen.txt
        echo        ^</dependency^>>> deps-gen.txt
      )
    )
  )
)

A similar installer for Linux:

#!/bin/bash

BUNDLES_HOME=~/workspaces/workspace-bpms-trunk/bundles
ECLIPSE_PLUGINS=~/.p2/pool/plugins

while IFS=":" read -r group artifact || [ -n "$p" ]; do
  artifact="${artifact//[$'\r\n']}"
  if [ "$artifact" = "" ]; then
    :
  elif [ -d "$BUNDLES_HOME/$artifact" ]; then
    while IFS=":" read -r key value || [ -n "$p" ]; do
      if [ "$key" = "Bundle-Version" ]; then
        version="${value//[[:space:]]/}"
        version="${version/.qualifier/-SNAPSHOT}"
        mvn install:install-file -DgroupId=$group -DartifactId=$artifact \
          -Dversion=$version -DgeneratePom=true -Dpackaging=jar \
          -Dfile="$BUNDLES_HOME/$artifact/target/$artifact-$version.jar"
      fi
    done < "$BUNDLES_HOME/$artifact/META-INF/MANIFEST.MF"
  else
    for file in "$ECLIPSE_PLUGINS"/${artifact}_*.jar; do
      version="${file%%.jar}"
      version="${version##*_}"
      mvn install:install-file -DgroupId=$group -DartifactId=$artifact \
        -Dversion=$version -DgeneratePom=true -Dpackaging=jar -Dfile="$file"
    done
  fi
done < deps.txt

And pom-file dependency generator:

#!/bin/bash

BUNDLES_HOME=~/workspaces/workspace-bpms-trunk/bundles
ECLIPSE_PLUGINS=~/.p2/pool/plugins

: > deps-gen.txt

while IFS=":" read -r group artifact || [ -n "$p" ]; do
  artifact="${artifact//[$'\r\n']}"
  if [ "$artifact" = "" ]; then
    echo >> deps-gen.txt
  elif [ -d "$BUNDLES_HOME/$artifact" ]; then
    while IFS=":" read -r key value || [ -n "$p" ]; do
      if [ "$key" = "Bundle-Version" ]; then
        version="${value//[[:space:]]/}"
        version="${version/.qualifier/-SNAPSHOT}"
        echo "        <dependency>" >> deps-gen.txt
        echo "            <groupId>$group</groupId>" >> deps-gen.txt
        echo "            <artifactId>$artifact</artifactId>" >> deps-gen.txt
        echo "            <version>$version</version>" >> deps-gen.txt
        echo "        </dependency>" >> deps-gen.txt
      fi
    done < "$BUNDLES_HOME/$artifact/META-INF/MANIFEST.MF"
  else
    for file in "$ECLIPSE_PLUGINS"/${artifact}_*.jar; do
      version="${file%%.jar}"
      version="${version##*_}"
      echo "        <dependency>" >> deps-gen.txt
      echo "            <groupId>$group</groupId>" >> deps-gen.txt
      echo "            <artifactId>$artifact</artifactId>" >> deps-gen.txt
      echo "            <version>$version</version>" >> deps-gen.txt
      echo "        </dependency>" >> deps-gen.txt
    done
  fi
done < deps.txt

Source https://stackoverflow.com/questions/70156835

Community Discussions, Code Snippets contain sources that include Stack Exchange Network

Vulnerabilities

No vulnerabilities reported

Install polyglot

You can install using 'pip install polyglot' or download it from GitHub, PyPI.
You can use polyglot like any standard Python library. You will need to make sure that you have a development environment consisting of a Python distribution including header files, a compiler, pip, and git installed. Make sure that your pip, setuptools, and wheel are up to date. When using pip it is generally recommended to install packages in a virtual environment to avoid changes to the system.

Support

For any new features, suggestions and bugs create an issue on GitHub. If you have any questions check and ask questions on community page Stack Overflow .

DOWNLOAD this Library from

Reuse Trending Solutions

14 best Python Telegram Bot

21 best C# Game Development

Build AI Fake News Detector

Build Text Summarizer in Python

Getting Started with Web3

24 best Python Blockchain

26 best Python Face Recognition

Build Ludo Game in Python

Build Location Based AR App

Build AI Study Assistant Bot

Find, review, and download reusable Libraries, Code Snippets, Cloud APIs from
over 430 million Knowledge Items

Find more libraries

Reuse Solution Kits and Libraries Curated by Popular Use Cases

Save this library and start creating your kit

Explore Related Topics

Artificial Intelligence

Natural Language Processing

Share this Page

Reuse Pre-built Kits with polyglot

Getting started with NLP (Library Overview)

NLP : Projects Building Libraries

NLP Tools For Language Detection

See all related Kits

Reuse Natural Language Processing Kits

Build AI Virtual Assistant

Build NLP Paraphrase Generator

19 best Python NLP

15 best Python Topic Modelling

11 best Java Ethereum

See all related Kits

Reuse Artificial Intelligence Kits

Build Text Summarizer in Python

26 best Python Face Recognition

Build AI Study Assistant Bot

Resolving Gender Bias in AI

Stop words : NLP

See all related Kits

Consider Popular Natural Language Processing Libraries

transformers

by huggingface

funNLP

by fighting41love

bert

by google-research

Python

by geekcomputers

HanLP

by hankcs

See all Natural Language Processing Libraries

Try Top Libraries by aboSamoor

pycld2

by aboSamoor C++

lydia

by aboSamoor Python

Filebench

by aboSamoor C

TMN-Project

by aboSamoor Python

CompGeometry

by aboSamoor Python

See all Libraries by this author

Compare Natural Language Processing Libraries with Highest Support

transformers

by huggingface

bert

by google-research

allennlp

by allenai

text

by pytorch

flair

by flairNLP

See all Natural Language Processing Libraries

Compare Natural Language Processing Libraries with Highest Quality

nadia

by mmberg

MinorThird

by TeamCohen

baseqa

by oaqa

SmithHeilmann_fork

by kutschkem

wikientities

by xiaoganghan

See all Natural Language Processing Libraries

Compare Natural Language Processing Libraries with Highest Security

stanbol-freeling

by insideout10

CLAVIN-NERD

by Novetta

nadia

by mmberg

coreNlp

by jconwell

corenlp-examples

by drewfarris

See all Natural Language Processing Libraries

Compare Natural Language Processing Libraries with Permissive License

nadia

by mmberg

coreNlp

by jconwell

LrcParser

by authorfu

allsummarizer

by kariminf

Xponents

by OpenSextant

See all Natural Language Processing Libraries

Compare Natural Language Processing Libraries with Highest Reuse

elasticsearch-analysis-decompound

by jprante

elasticsearch-analysis-turkishstemmer

by skroutz

semantic

by crm416

treetools

by wmaier

esperanto-analyzer

by fidelisrafael

See all Natural Language Processing Libraries

Find, review, and download reusable Libraries, Code Snippets, Cloud APIs from
over 430 million Knowledge Items

Find more libraries

Reuse Solution Kits and Libraries Curated by Popular Use Cases

Save this library and start creating your kit

© 2022 Open Weaver Inc.

© 2022 Open Weaver Inc.