Skip to content

More efficient computation of splitting point for recursive parsing #2

More efficient computation of splitting point for recursive parsing

More efficient computation of splitting point for recursive parsing #2

Workflow file for this run

name: Java CI build and test
on: [push]
jobs:
test:
runs-on: ${{ matrix.os }}
strategy:
matrix:
os: [ ubuntu-latest ]
java: [ 20 ]
arch: [ x64 ]
dist: [ zulu ]
fail-fast: false
max-parallel: 4
name: Test JDK ${{ matrix.java }}, ${{ matrix.os }}, ${{ matrix.arch }}
steps:
- uses: actions/checkout@v3
- name: Set up JDK ${{ matrix.java }}
uses: actions/setup-java@v3
with:
java-version: ${{ matrix.java }}
architecture: ${{ matrix.arch }}
distribution: ${{ matrix.dist }}
- name: Show where Java Home is
run: echo JAVA_HOME=$JAVA_HOME
- name: Build with Maven
run: mvn --batch-mode --update-snapshots --errors package
- name: Performance Test [0,1)
run: java -XX:CompileCommand=inline,java/lang/String.charAt --enable-preview -p fastdoubleparserdemo/target:fastdoubleparser/target -m ch.randelshofer.fastdoubleparserdemo/ch.randelshofer.fastdoubleparserdemo.Main
- name: Performance Test canada.txt
run: java -XX:CompileCommand=inline,java/lang/String.charAt --enable-preview -p fastdoubleparserdemo/target:fastdoubleparser/target -m ch.randelshofer.fastdoubleparserdemo/ch.randelshofer.fastdoubleparserdemo.Main fastdoubleparserdemo/data/canada.txt
- name: Performance Test canada_hex.txt
run: java -XX:CompileCommand=inline,java/lang/String.charAt --enable-preview -p fastdoubleparserdemo/target:fastdoubleparser/target -m ch.randelshofer.fastdoubleparserdemo/ch.randelshofer.fastdoubleparserdemo.Main fastdoubleparserdemo/data/canada_hex.txt
...