Created
June 10, 2020 11:25
-
-
Save spmallette/48a725498809fab4c0141cc73c3613e7 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
travis_fold:start:worker_info | |
[0K[33;1mWorker information[0m | |
hostname: a9e8c3e9-1f04-4f3b-b109-0bdb5c2056e5@1.worker-org-676f4fdd9b-4ghmv.gce-production-2 | |
version: v6.2.8 https://github.com/travis-ci/worker/tree/6d3048d96b26562be21fa1a8b8144f4c4cecd083 | |
instance: travis-job-fedfca6f-6cbc-4029-8f33-64049d9e9128 travis-ci-sardonyx-xenial-1582021189-ed2d6fb2 (via amqp) | |
startup: 6.321786906s | |
travis_fold:end:worker_info | |
[0Ktravis_time:start:12323274 | |
[0Ktravis_time:end:12323274:start=1591787171080381506,finish=1591787171259676815,duration=179295309,event=no_world_writable_dirs | |
[0Ktravis_time:start:00550d70 | |
[0Ktravis_time:end:00550d70:start=1591787171263801605,finish=1591787171272680793,duration=8879188,event=agent | |
[0Ktravis_time:start:05df4177 | |
[0Ktravis_time:end:05df4177:start=1591787171276096571,finish=1591787171279011965,duration=2915394,event=check_unsupported | |
[0Ktravis_time:start:261ca8f2 | |
[0Ktravis_fold:start:system_info | |
[0K[33;1mBuild system information[0m | |
Build language: java | |
Build dist: xenial | |
Build id: 694831017 | |
Job id: 694831019 | |
Runtime kernel version: 4.15.0-1055-gcp | |
travis-build version: 07730dca | |
[34m[1mBuild image provisioning date and time[0m | |
Tue Feb 18 10:44:28 UTC 2020 | |
[34m[1mOperating System Details[0m | |
Distributor ID: Ubuntu | |
Description: Ubuntu 16.04.6 LTS | |
Release: 16.04 | |
Codename: xenial | |
[34m[1mSystemd Version[0m | |
systemd 229 | |
[34m[1mCookbooks Version[0m | |
9a55ad7 https://github.com/travis-ci/travis-cookbooks/tree/9a55ad7 | |
[34m[1mgit version[0m | |
git version 2.25.0 | |
[34m[1mbash version[0m | |
GNU bash, version 4.3.48(1)-release (x86_64-pc-linux-gnu) | |
[34m[1mgcc version[0m | |
gcc (Ubuntu 5.4.0-6ubuntu1~16.04.12) 5.4.0 20160609 | |
[34m[1mdocker version[0m | |
Client: | |
Version: 18.06.0-ce | |
API version: 1.38 | |
Go version: go1.10.3 | |
Git commit: 0ffa825 | |
Built: Wed Jul 18 19:11:02 2018 | |
OS/Arch: linux/amd64 | |
Experimental: false | |
Server: | |
Engine: | |
Version: 18.06.0-ce | |
API version: 1.38 (minimum version 1.12) | |
Go version: go1.10.3 | |
Git commit: 0ffa825 | |
Built: Wed Jul 18 19:09:05 2018 | |
OS/Arch: linux/amd64 | |
Experimental: false | |
[34m[1mclang version[0m | |
clang version 7.0.0 (tags/RELEASE_700/final) | |
[34m[1mjq version[0m | |
jq-1.5 | |
[34m[1mbats version[0m | |
Bats 0.4.0 | |
[34m[1mshellcheck version[0m | |
0.7.0 | |
[34m[1mshfmt version[0m | |
v2.6.3 | |
[34m[1mccache version[0m | |
3.2.4 | |
[34m[1mcmake version[0m | |
cmake version 3.12.4 | |
[34m[1mheroku version[0m | |
heroku/7.38.1 linux-x64 node-v12.13.0 | |
[34m[1mimagemagick version[0m | |
Version: ImageMagick 6.8.9-9 Q16 x86_64 2019-11-12 http://www.imagemagick.org | |
[34m[1mmd5deep version[0m | |
4.4 | |
[34m[1mmercurial version[0m | |
version 4.8 | |
[34m[1mmysql version[0m | |
mysql Ver 14.14 Distrib 5.7.29, for Linux (x86_64) using EditLine wrapper | |
[34m[1mopenssl version[0m | |
OpenSSL 1.0.2g 1 Mar 2016 | |
[34m[1mpacker version[0m | |
1.3.3 | |
[34m[1mpostgresql client version[0m | |
psql (PostgreSQL) 10.12 (Ubuntu 10.12-1.pgdg16.04+1) | |
[34m[1mragel version[0m | |
Ragel State Machine Compiler version 6.8 Feb 2013 | |
[34m[1msudo version[0m | |
1.8.16 | |
[34m[1mgzip version[0m | |
gzip 1.6 | |
[34m[1mzip version[0m | |
Zip 3.0 | |
[34m[1mvim version[0m | |
VIM - Vi IMproved 7.4 (2013 Aug 10, compiled Jun 07 2019 15:35:43) | |
[34m[1miptables version[0m | |
iptables v1.6.0 | |
[34m[1mcurl version[0m | |
curl 7.47.0 (x86_64-pc-linux-gnu) libcurl/7.47.0 GnuTLS/3.4.10 zlib/1.2.8 libidn/1.32 librtmp/2.3 | |
[34m[1mwget version[0m | |
GNU Wget 1.17.1 built on linux-gnu. | |
[34m[1mrsync version[0m | |
rsync version 3.1.1 protocol version 31 | |
[34m[1mgimme version[0m | |
v1.5.3 | |
[34m[1mnvm version[0m | |
0.35.2 | |
[34m[1mperlbrew version[0m | |
/home/travis/perl5/perlbrew/bin/perlbrew - App::perlbrew/0.88 | |
[34m[1mphpenv version[0m | |
rbenv 1.1.2-26-gc6324ff | |
[34m[1mrvm version[0m | |
rvm 1.29.9 (latest) by Michal Papis, Piotr Kuczynski, Wayne E. Seguin [https://rvm.io] | |
[34m[1mdefault ruby version[0m | |
ruby 2.5.3p105 (2018-10-18 revision 65156) [x86_64-linux] | |
[34m[1mCouchDB version[0m | |
couchdb 1.6.1 | |
[34m[1mElasticSearch version[0m | |
5.5.0 | |
[34m[1mInstalled Firefox version[0m | |
firefox 63.0.1 | |
[34m[1mMongoDB version[0m | |
MongoDB 4.0.16 | |
[34m[1mPhantomJS version[0m | |
2.1.1 | |
[34m[1mPre-installed PostgreSQL versions[0m | |
9.4.26 | |
9.5.21 | |
9.6.17 | |
[34m[1mRedis version[0m | |
redis-server 5.0.7 | |
[34m[1mPre-installed Go versions[0m | |
1.11.1 | |
[34m[1mant version[0m | |
Apache Ant(TM) version 1.9.6 compiled on July 20 2018 | |
[34m[1mmvn version[0m | |
Apache Maven 3.6.3 (cecedd343002696d0abb50b32b541b8a6ba2883f) | |
[34m[1mgradle version[0m | |
Gradle 5.1.1! | |
[34m[1mlein version[0m | |
Leiningen 2.9.1 on Java 11.0.2 OpenJDK 64-Bit Server VM | |
[34m[1mPre-installed Node.js versions[0m | |
v10.19.0 | |
v11.15.0 | |
v12.13.1 | |
v12.16.0 | |
v13.3.0 | |
v4.9.1 | |
v6.17.1 | |
v8.16.0 | |
v8.17.0 | |
v8.9 | |
[34m[1mphpenv versions[0m | |
system | |
5.6 | |
5.6.40 | |
7.1 | |
7.1.33 | |
7.2 | |
* 7.2.27 (set by /home/travis/.phpenv/version) | |
7.3 | |
7.3.14 | |
7.4 | |
7.4.2 | |
hhvm | |
hhvm-stable | |
[34m[1mcomposer --version[0m | |
Composer version 1.9.2 2020-01-14 16:30:31 | |
[34m[1mPre-installed Ruby versions[0m | |
ruby-2.3.8 | |
ruby-2.4.5 | |
ruby-2.4.9 | |
ruby-2.5.3 | |
ruby-2.5.7 | |
ruby-2.6.5 | |
ruby-2.7.0 | |
travis_fold:end:system_info | |
[0K | |
travis_time:end:261ca8f2:start=1591787171282431126,finish=1591787171290384807,duration=7953681,event=show_system_info | |
[0Ktravis_time:start:1cb8677b | |
[0Ktravis_time:end:1cb8677b:start=1591787171294070772,finish=1591787171308774391,duration=14703619,event=rm_riak_source | |
[0Ktravis_time:start:05152b38 | |
[0Ktravis_time:end:05152b38:start=1591787171312955540,finish=1591787171320119865,duration=7164325,event=fix_rwky_redis | |
[0Ktravis_time:start:02eb2db0 | |
[0Ktravis_time:end:02eb2db0:start=1591787171324195061,finish=1591787171947525538,duration=623330477,event=wait_for_network | |
[0Ktravis_time:start:01bd7ad3 | |
[0Ktravis_time:end:01bd7ad3:start=1591787171951173408,finish=1591787172185320569,duration=234147161,event=update_apt_keys | |
[0Ktravis_time:start:1817648d | |
[0Ktravis_time:end:1817648d:start=1591787172188924523,finish=1591787172246416121,duration=57491598,event=fix_hhvm_source | |
[0Ktravis_time:start:17072188 | |
[0Ktravis_time:end:17072188:start=1591787172249996686,finish=1591787172253019745,duration=3023059,event=update_mongo_arch | |
[0Ktravis_time:start:1c3f68ae | |
[0Ktravis_time:end:1c3f68ae:start=1591787172256473953,finish=1591787172300735362,duration=44261409,event=fix_sudo_enabled_trusty | |
[0Ktravis_time:start:26538060 | |
[0Ktravis_time:end:26538060:start=1591787172304745025,finish=1591787172307531453,duration=2786428,event=update_glibc | |
[0Ktravis_time:start:2278b3c0 | |
[0Ktravis_time:end:2278b3c0:start=1591787172310913719,finish=1591787172320061687,duration=9147968,event=clean_up_path | |
[0Ktravis_time:start:2036b96c | |
[0Ktravis_time:end:2036b96c:start=1591787172323472204,finish=1591787172333779949,duration=10307745,event=fix_resolv_conf | |
[0Ktravis_time:start:1105a484 | |
[0Ktravis_time:end:1105a484:start=1591787172337750596,finish=1591787172348884727,duration=11134131,event=fix_etc_hosts | |
[0Ktravis_time:start:00b3eac8 | |
[0Ktravis_time:end:00b3eac8:start=1591787172352942587,finish=1591787172363869808,duration=10927221,event=fix_mvn_settings_xml | |
[0Ktravis_time:start:13b13006 | |
[0Ktravis_time:end:13b13006:start=1591787172367388276,finish=1591787172378145979,duration=10757703,event=no_ipv6_localhost | |
[0Ktravis_time:start:00836ee3 | |
[0Ktravis_time:end:00836ee3:start=1591787172381676623,finish=1591787172384465028,duration=2788405,event=fix_etc_mavenrc | |
[0Ktravis_time:start:1e21ba5e | |
[0Ktravis_time:end:1e21ba5e:start=1591787172388262483,finish=1591787172391946232,duration=3683749,event=fix_wwdr_certificate | |
[0Ktravis_time:start:0cfa3c54 | |
[0Ktravis_time:end:0cfa3c54:start=1591787172395690835,finish=1591787172423328618,duration=27637783,event=put_localhost_first | |
[0Ktravis_time:start:1a19f722 | |
[0Ktravis_time:end:1a19f722:start=1591787172426897661,finish=1591787172431476655,duration=4578994,event=home_paths | |
[0Ktravis_time:start:1368410c | |
[0Ktravis_time:end:1368410c:start=1591787172435191337,finish=1591787172449142341,duration=13951004,event=disable_initramfs | |
[0Ktravis_time:start:152eb5d9 | |
[0Ktravis_time:end:152eb5d9:start=1591787172452792555,finish=1591787172846929190,duration=394136635,event=disable_ssh_roaming | |
[0Ktravis_time:start:307dbd5b | |
[0Ktravis_time:end:307dbd5b:start=1591787172850281936,finish=1591787172852666202,duration=2384266,event=debug_tools | |
[0Ktravis_time:start:133648ed | |
[0Ktravis_time:end:133648ed:start=1591787172855787827,finish=1591787172859037329,duration=3249502,event=uninstall_oclint | |
[0Ktravis_time:start:1b5c547f | |
[0Ktravis_time:end:1b5c547f:start=1591787172862177968,finish=1591787172865228841,duration=3050873,event=rvm_use | |
[0Ktravis_time:start:3bceb5fe | |
[0Ktravis_time:end:3bceb5fe:start=1591787172868626083,finish=1591787172876830793,duration=8204710,event=rm_etc_boto_cfg | |
[0Ktravis_time:start:0d2b2c24 | |
[0Ktravis_time:end:0d2b2c24:start=1591787172880186870,finish=1591787172884280564,duration=4093694,event=rm_oraclejdk8_symlink | |
[0Ktravis_time:start:1e7f5aa4 | |
[0Ktravis_time:end:1e7f5aa4:start=1591787172887779303,finish=1591787173016830687,duration=129051384,event=enable_i386 | |
[0Ktravis_time:start:0bd9afb8 | |
[0Ktravis_time:end:0bd9afb8:start=1591787173020356023,finish=1591787173025663370,duration=5307347,event=update_rubygems | |
[0Ktravis_time:start:1cacf260 | |
[0Ktravis_time:end:1cacf260:start=1591787173029576652,finish=1591787173875846763,duration=846270111,event=ensure_path_components | |
[0Ktravis_time:start:10dd4582 | |
[0Ktravis_time:end:10dd4582:start=1591787173879225593,finish=1591787173881672931,duration=2447338,event=redefine_curl | |
[0Ktravis_time:start:02685b34 | |
[0Ktravis_time:end:02685b34:start=1591787173884781316,finish=1591787173887179900,duration=2398584,event=nonblock_pipe | |
[0Ktravis_time:start:19ade3ac | |
[0Ktravis_time:end:19ade3ac:start=1591787173890284999,finish=1591787179923589046,duration=6033304047,event=apt_get_update | |
[0Ktravis_time:start:03bc0956 | |
[0Ktravis_time:end:03bc0956:start=1591787179926948416,finish=1591787179929574380,duration=2625964,event=deprecate_xcode_64 | |
[0Ktravis_time:start:03f0dcf2 | |
[0Ktravis_time:end:03f0dcf2:start=1591787179932693587,finish=1591787182453550050,duration=2520856463,event=update_heroku | |
[0Ktravis_time:start:15c07aaf | |
[0Ktravis_time:end:15c07aaf:start=1591787182456846707,finish=1591787182459264571,duration=2417864,event=shell_session_update | |
[0Ktravis_time:start:03782a79 | |
[0Ktravis_fold:start:docker_mtu | |
[0Ktravis_fold:end:docker_mtu | |
[0Ktravis_time:end:03782a79:start=1591787182462470119,finish=1591787184819793569,duration=2357323450,event=set_docker_mtu | |
[0Ktravis_time:start:1d71b498 | |
[0Ktravis_fold:start:resolvconf | |
[0Ktravis_fold:end:resolvconf | |
[0Ktravis_time:end:1d71b498:start=1591787184824862677,finish=1591787184895381832,duration=70519155,event=resolvconf | |
[0Ktravis_time:start:005becf6 | |
[0Ktravis_time:end:005becf6:start=1591787184902500491,finish=1591787185050760739,duration=148260248,event=maven_central_mirror | |
[0Ktravis_time:start:24495762 | |
[0Ktravis_time:end:24495762:start=1591787185054131915,finish=1591787185154007561,duration=99875646,event=maven_https | |
[0K | |
travis_fold:start:install_jdk | |
[0K[33;1mInstalling openjdk8[0m | |
travis_fold:end:install_jdk | |
[0Ktravis_fold:start:apt | |
[0K[33;1mAdding APT Sources[0m | |
travis_time:start:2ccb38b4 | |
[0K$ sudo -E apt-add-repository -y "ppa:deadsnakes/ppa" | |
gpg: keyring `/tmp/tmpe33hdfie/secring.gpg' created | |
gpg: keyring `/tmp/tmpe33hdfie/pubring.gpg' created | |
gpg: requesting key 6A755776 from hkp server keyserver.ubuntu.com | |
gpg: /tmp/tmpe33hdfie/trustdb.gpg: trustdb created | |
gpg: key 6A755776: public key "Launchpad PPA for deadsnakes" imported | |
gpg: Total number processed: 1 | |
gpg: imported: 1 (RSA: 1) | |
OK | |
travis_time:end:2ccb38b4:start=1591787185164634577,finish=1591787186660856469,duration=1496221892,event=prepare | |
[0Ktravis_time:start:22c86924 | |
[0K$ travis_apt_get_update | |
travis_time:end:22c86924:start=1591787186664940561,finish=1591787197885099495,duration=11220158934,event=prepare | |
[0Ktravis_fold:end:apt | |
[0Ktravis_time:start:2969b13e | |
[0Ktravis_fold:start:services | |
[0Ktravis_time:start:0039d8db | |
[0K$ sudo systemctl start docker | |
travis_time:end:0039d8db:start=1591787197892139868,finish=1591787197903332338,duration=11192470,event=prepare | |
[0Ktravis_fold:end:services | |
[0Ktravis_time:end:0039d8db:start=1591787197892139868,finish=1591787200908003206,duration=3015863338,event=services | |
[0Ktravis_time:start:01b6e300 | |
[0Ktravis_time:end:01b6e300:start=1591787200911442010,finish=1591787200913853654,duration=2411644,event=fix_ps4 | |
[0Ktravis_time:start:02359f98 | |
[0K | |
travis_fold:start:git.checkout | |
[0Ktravis_time:start:27caa04a | |
[0K$ git clone --depth=50 https://github.com/apache/tinkerpop.git apache/tinkerpop | |
Cloning into 'apache/tinkerpop'... | |
remote: Enumerating objects: 11474, done.[K | |
remote: Counting objects: 0% (1/11474)[K | |
remote: Counting objects: 1% (115/11474)[K | |
remote: Counting objects: 2% (230/11474)[K | |
remote: Counting objects: 3% (345/11474)[K | |
remote: Counting objects: 4% (459/11474)[K | |
remote: Counting objects: 5% (574/11474)[K | |
remote: Counting objects: 6% (689/11474)[K | |
remote: Counting objects: 7% (804/11474)[K | |
remote: Counting objects: 8% (918/11474)[K | |
remote: Counting objects: 9% (1033/11474)[K | |
remote: Counting objects: 10% (1148/11474)[K | |
remote: Counting objects: 11% (1263/11474)[K | |
remote: Counting objects: 12% (1377/11474)[K | |
remote: Counting objects: 13% (1492/11474)[K | |
remote: Counting objects: 14% (1607/11474)[K | |
remote: Counting objects: 15% (1722/11474)[K | |
remote: Counting objects: 16% (1836/11474)[K | |
remote: Counting objects: 17% (1951/11474)[K | |
remote: Counting objects: 18% (2066/11474)[K | |
remote: Counting objects: 19% (2181/11474)[K | |
remote: Counting objects: 20% (2295/11474)[K | |
remote: Counting objects: 21% (2410/11474)[K | |
remote: Counting objects: 22% (2525/11474)[K | |
remote: Counting objects: 23% (2640/11474)[K | |
remote: Counting objects: 24% (2754/11474)[K | |
remote: Counting objects: 25% (2869/11474)[K | |
remote: Counting objects: 26% (2984/11474)[K | |
remote: Counting objects: 27% (3098/11474)[K | |
remote: Counting objects: 28% (3213/11474)[K | |
remote: Counting objects: 29% (3328/11474)[K | |
remote: Counting objects: 30% (3443/11474)[K | |
remote: Counting objects: 31% (3557/11474)[K | |
remote: Counting objects: 32% (3672/11474)[K | |
remote: Counting objects: 33% (3787/11474)[K | |
remote: Counting objects: 34% (3902/11474)[K | |
remote: Counting objects: 35% (4016/11474)[K | |
remote: Counting objects: 36% (4131/11474)[K | |
remote: Counting objects: 37% (4246/11474)[K | |
remote: Counting objects: 38% (4361/11474)[K | |
remote: Counting objects: 39% (4475/11474)[K | |
remote: Counting objects: 40% (4590/11474)[K | |
remote: Counting objects: 41% (4705/11474)[K | |
remote: Counting objects: 42% (4820/11474)[K | |
remote: Counting objects: 43% (4934/11474)[K | |
remote: Counting objects: 44% (5049/11474)[K | |
remote: Counting objects: 45% (5164/11474)[K | |
remote: Counting objects: 46% (5279/11474)[K | |
remote: Counting objects: 47% (5393/11474)[K | |
remote: Counting objects: 48% (5508/11474)[K | |
remote: Counting objects: 49% (5623/11474)[K | |
remote: Counting objects: 50% (5737/11474)[K | |
remote: Counting objects: 51% (5852/11474)[K | |
remote: Counting objects: 52% (5967/11474)[K | |
remote: Counting objects: 53% (6082/11474)[K | |
remote: Counting objects: 54% (6196/11474)[K | |
remote: Counting objects: 55% (6311/11474)[K | |
remote: Counting objects: 56% (6426/11474)[K | |
remote: Counting objects: 57% (6541/11474)[K | |
remote: Counting objects: 58% (6655/11474)[K | |
remote: Counting objects: 59% (6770/11474)[K | |
remote: Counting objects: 60% (6885/11474)[K | |
remote: Counting objects: 61% (7000/11474)[K | |
remote: Counting objects: 62% (7114/11474)[K | |
remote: Counting objects: 63% (7229/11474)[K | |
remote: Counting objects: 64% (7344/11474)[K | |
remote: Counting objects: 65% (7459/11474)[K | |
remote: Counting objects: 66% (7573/11474)[K | |
remote: Counting objects: 67% (7688/11474)[K | |
remote: Counting objects: 68% (7803/11474)[K | |
remote: Counting objects: 69% (7918/11474)[K | |
remote: Counting objects: 70% (8032/11474)[K | |
remote: Counting objects: 71% (8147/11474)[K | |
remote: Counting objects: 72% (8262/11474)[K | |
remote: Counting objects: 73% (8377/11474)[K | |
remote: Counting objects: 74% (8491/11474)[K | |
remote: Counting objects: 75% (8606/11474)[K | |
remote: Counting objects: 76% (8721/11474)[K | |
remote: Counting objects: 77% (8835/11474)[K | |
remote: Counting objects: 78% (8950/11474)[K | |
remote: Counting objects: 79% (9065/11474)[K | |
remote: Counting objects: 80% (9180/11474)[K | |
remote: Counting objects: 81% (9294/11474)[K | |
remote: Counting objects: 82% (9409/11474)[K | |
remote: Counting objects: 83% (9524/11474)[K | |
remote: Counting objects: 84% (9639/11474)[K | |
remote: Counting objects: 85% (9753/11474)[K | |
remote: Counting objects: 86% (9868/11474)[K | |
remote: Counting objects: 87% (9983/11474)[K | |
remote: Counting objects: 88% (10098/11474)[K | |
remote: Counting objects: 89% (10212/11474)[K | |
remote: Counting objects: 90% (10327/11474)[K | |
remote: Counting objects: 91% (10442/11474)[K | |
remote: Counting objects: 92% (10557/11474)[K | |
remote: Counting objects: 93% (10671/11474)[K | |
remote: Counting objects: 94% (10786/11474)[K | |
remote: Counting objects: 95% (10901/11474)[K | |
remote: Counting objects: 96% (11016/11474)[K | |
remote: Counting objects: 97% (11130/11474)[K | |
remote: Counting objects: 98% (11245/11474)[K | |
remote: Counting objects: 99% (11360/11474)[K | |
remote: Counting objects: 100% (11474/11474)[K | |
remote: Counting objects: 100% (11474/11474), done.[K | |
remote: Compressing objects: 0% (1/6092)[K | |
remote: Compressing objects: 1% (61/6092)[K | |
remote: Compressing objects: 2% (122/6092)[K | |
remote: Compressing objects: 3% (183/6092)[K | |
remote: Compressing objects: 4% (244/6092)[K | |
remote: Compressing objects: 5% (305/6092)[K | |
remote: Compressing objects: 6% (366/6092)[K | |
remote: Compressing objects: 7% (427/6092)[K | |
remote: Compressing objects: 8% (488/6092)[K | |
remote: Compressing objects: 9% (549/6092)[K | |
remote: Compressing objects: 10% (610/6092)[K | |
remote: Compressing objects: 11% (671/6092)[K | |
remote: Compressing objects: 12% (732/6092)[K | |
remote: Compressing objects: 13% (792/6092)[K | |
remote: Compressing objects: 14% (853/6092)[K | |
remote: Compressing objects: 15% (914/6092)[K | |
remote: Compressing objects: 16% (975/6092)[K | |
remote: Compressing objects: 17% (1036/6092)[K | |
remote: Compressing objects: 18% (1097/6092)[K | |
remote: Compressing objects: 19% (1158/6092)[K | |
remote: Compressing objects: 20% (1219/6092)[K | |
remote: Compressing objects: 21% (1280/6092)[K | |
remote: Compressing objects: 22% (1341/6092)[K | |
remote: Compressing objects: 23% (1402/6092)[K | |
remote: Compressing objects: 24% (1463/6092)[K | |
remote: Compressing objects: 25% (1523/6092)[K | |
remote: Compressing objects: 26% (1584/6092)[K | |
remote: Compressing objects: 27% (1645/6092)[K | |
remote: Compressing objects: 28% (1706/6092)[K | |
remote: Compressing objects: 29% (1767/6092)[K | |
remote: Compressing objects: 30% (1828/6092)[K | |
remote: Compressing objects: 31% (1889/6092)[K | |
remote: Compressing objects: 32% (1950/6092)[K | |
remote: Compressing objects: 33% (2011/6092)[K | |
remote: Compressing objects: 34% (2072/6092)[K | |
remote: Compressing objects: 35% (2133/6092)[K | |
remote: Compressing objects: 36% (2194/6092)[K | |
remote: Compressing objects: 37% (2255/6092)[K | |
remote: Compressing objects: 38% (2315/6092)[K | |
remote: Compressing objects: 39% (2376/6092)[K | |
remote: Compressing objects: 40% (2437/6092)[K | |
remote: Compressing objects: 41% (2498/6092)[K | |
remote: Compressing objects: 42% (2559/6092)[K | |
remote: Compressing objects: 43% (2620/6092)[K | |
remote: Compressing objects: 44% (2681/6092)[K | |
remote: Compressing objects: 45% (2742/6092)[K | |
remote: Compressing objects: 46% (2803/6092)[K | |
remote: Compressing objects: 47% (2864/6092)[K | |
remote: Compressing objects: 48% (2925/6092)[K | |
remote: Compressing objects: 49% (2986/6092)[K | |
remote: Compressing objects: 50% (3046/6092)[K | |
remote: Compressing objects: 51% (3107/6092)[K | |
remote: Compressing objects: 52% (3168/6092)[K | |
remote: Compressing objects: 53% (3229/6092)[K | |
remote: Compressing objects: 54% (3290/6092)[K | |
remote: Compressing objects: 55% (3351/6092)[K | |
remote: Compressing objects: 55% (3367/6092)[K | |
remote: Compressing objects: 56% (3412/6092)[K | |
remote: Compressing objects: 57% (3473/6092)[K | |
remote: Compressing objects: 58% (3534/6092)[K | |
remote: Compressing objects: 59% (3595/6092)[K | |
remote: Compressing objects: 60% (3656/6092)[K | |
remote: Compressing objects: 61% (3717/6092)[K | |
remote: Compressing objects: 62% (3778/6092)[K | |
remote: Compressing objects: 63% (3838/6092)[K | |
remote: Compressing objects: 64% (3899/6092)[K | |
remote: Compressing objects: 65% (3960/6092)[K | |
remote: Compressing objects: 66% (4021/6092)[K | |
remote: Compressing objects: 67% (4082/6092)[K | |
remote: Compressing objects: 68% (4143/6092)[K | |
remote: Compressing objects: 69% (4204/6092)[K | |
remote: Compressing objects: 70% (4265/6092)[K | |
remote: Compressing objects: 71% (4326/6092)[K | |
remote: Compressing objects: 72% (4387/6092)[K | |
remote: Compressing objects: 73% (4448/6092)[K | |
remote: Compressing objects: 74% (4509/6092)[K | |
remote: Compressing objects: 75% (4569/6092)[K | |
remote: Compressing objects: 76% (4630/6092)[K | |
remote: Compressing objects: 77% (4691/6092)[K | |
remote: Compressing objects: 78% (4752/6092)[K | |
remote: Compressing objects: 79% (4813/6092)[K | |
remote: Compressing objects: 80% (4874/6092)[K | |
remote: Compressing objects: 81% (4935/6092)[K | |
remote: Compressing objects: 82% (4996/6092)[K | |
remote: Compressing objects: 83% (5057/6092)[K | |
remote: Compressing objects: 84% (5118/6092)[K | |
remote: Compressing objects: 85% (5179/6092)[K | |
remote: Compressing objects: 86% (5240/6092)[K | |
remote: Compressing objects: 87% (5301/6092)[K | |
remote: Compressing objects: 88% (5361/6092)[K | |
remote: Compressing objects: 89% (5422/6092)[K | |
remote: Compressing objects: 90% (5483/6092)[K | |
remote: Compressing objects: 91% (5544/6092)[K | |
remote: Compressing objects: 92% (5605/6092)[K | |
remote: Compressing objects: 93% (5666/6092)[K | |
remote: Compressing objects: 94% (5727/6092)[K | |
remote: Compressing objects: 95% (5788/6092)[K | |
remote: Compressing objects: 96% (5849/6092)[K | |
remote: Compressing objects: 97% (5910/6092)[K | |
remote: Compressing objects: 98% (5971/6092)[K | |
remote: Compressing objects: 99% (6032/6092)[K | |
remote: Compressing objects: 100% (6092/6092)[K | |
remote: Compressing objects: 100% (6092/6092), done.[K | |
Receiving objects: 0% (1/11474) | |
Receiving objects: 1% (115/11474) | |
Receiving objects: 2% (230/11474) | |
Receiving objects: 3% (345/11474) | |
Receiving objects: 4% (459/11474) | |
Receiving objects: 5% (574/11474) | |
Receiving objects: 6% (689/11474) | |
Receiving objects: 7% (804/11474) | |
Receiving objects: 8% (918/11474) | |
Receiving objects: 9% (1033/11474) | |
Receiving objects: 10% (1148/11474) | |
Receiving objects: 11% (1263/11474) | |
Receiving objects: 12% (1377/11474) | |
Receiving objects: 13% (1492/11474) | |
Receiving objects: 14% (1607/11474) | |
Receiving objects: 15% (1722/11474) | |
Receiving objects: 16% (1836/11474) | |
Receiving objects: 17% (1951/11474) | |
Receiving objects: 18% (2066/11474) | |
Receiving objects: 19% (2181/11474) | |
Receiving objects: 20% (2295/11474) | |
Receiving objects: 21% (2410/11474) | |
Receiving objects: 22% (2525/11474) | |
Receiving objects: 23% (2640/11474) | |
Receiving objects: 24% (2754/11474) | |
Receiving objects: 25% (2869/11474) | |
Receiving objects: 26% (2984/11474) | |
Receiving objects: 27% (3098/11474) | |
Receiving objects: 28% (3213/11474) | |
Receiving objects: 29% (3328/11474) | |
Receiving objects: 30% (3443/11474) | |
Receiving objects: 31% (3557/11474) | |
Receiving objects: 32% (3672/11474) | |
Receiving objects: 33% (3787/11474) | |
Receiving objects: 34% (3902/11474) | |
Receiving objects: 35% (4016/11474) | |
Receiving objects: 36% (4131/11474) | |
Receiving objects: 37% (4246/11474) | |
Receiving objects: 38% (4361/11474) | |
Receiving objects: 39% (4475/11474) | |
Receiving objects: 40% (4590/11474) | |
Receiving objects: 41% (4705/11474) | |
Receiving objects: 42% (4820/11474) | |
Receiving objects: 43% (4934/11474), 6.85 MiB | 13.69 MiB/s | |
Receiving objects: 44% (5049/11474), 6.85 MiB | 13.69 MiB/s | |
Receiving objects: 45% (5164/11474), 6.85 MiB | 13.69 MiB/s | |
Receiving objects: 46% (5279/11474), 6.85 MiB | 13.69 MiB/s | |
Receiving objects: 47% (5393/11474), 6.85 MiB | 13.69 MiB/s | |
Receiving objects: 47% (5426/11474), 30.28 MiB | 30.27 MiB/s | |
Receiving objects: 48% (5508/11474), 30.28 MiB | 30.27 MiB/s | |
Receiving objects: 48% (5531/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 49% (5623/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 50% (5737/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 51% (5852/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 52% (5967/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 53% (6082/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 54% (6196/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 55% (6311/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 56% (6426/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 57% (6541/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 58% (6655/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 59% (6770/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 60% (6885/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 61% (7000/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 62% (7114/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 63% (7229/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 64% (7344/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 65% (7459/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 66% (7573/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 67% (7688/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 68% (7803/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 69% (7918/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 70% (8032/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 71% (8147/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 72% (8262/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 73% (8377/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 74% (8491/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 75% (8606/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 76% (8721/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 77% (8835/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 78% (8950/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 79% (9065/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 80% (9180/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 81% (9294/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 82% (9409/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 83% (9524/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 84% (9639/11474), 49.75 MiB | 27.58 MiB/s | |
Receiving objects: 85% (9753/11474), 62.11 MiB | 26.95 MiB/s | |
Receiving objects: 86% (9868/11474), 62.11 MiB | 26.95 MiB/s | |
Receiving objects: 87% (9983/11474), 62.11 MiB | 26.95 MiB/s | |
Receiving objects: 88% (10098/11474), 62.11 MiB | 26.95 MiB/s | |
Receiving objects: 89% (10212/11474), 62.11 MiB | 26.95 MiB/s | |
Receiving objects: 90% (10327/11474), 62.11 MiB | 26.95 MiB/s | |
Receiving objects: 91% (10442/11474), 62.11 MiB | 26.95 MiB/s | |
Receiving objects: 92% (10557/11474), 62.11 MiB | 26.95 MiB/s | |
Receiving objects: 93% (10671/11474), 62.11 MiB | 26.95 MiB/s | |
Receiving objects: 94% (10786/11474), 62.11 MiB | 26.95 MiB/s | |
Receiving objects: 95% (10901/11474), 62.11 MiB | 26.95 MiB/s | |
Receiving objects: 96% (11016/11474), 62.11 MiB | 26.95 MiB/s | |
Receiving objects: 97% (11130/11474), 62.11 MiB | 26.95 MiB/s | |
remote: Total 11474 (delta 5878), reused 7851 (delta 3452), pack-reused 0[K | |
Receiving objects: 98% (11245/11474), 62.11 MiB | 26.95 MiB/s | |
Receiving objects: 99% (11360/11474), 62.11 MiB | 26.95 MiB/s | |
Receiving objects: 100% (11474/11474), 62.11 MiB | 26.95 MiB/s | |
Receiving objects: 100% (11474/11474), 63.12 MiB | 26.32 MiB/s, done. | |
Resolving deltas: 0% (0/5878) | |
Resolving deltas: 1% (63/5878) | |
Resolving deltas: 2% (122/5878) | |
Resolving deltas: 3% (177/5878) | |
Resolving deltas: 4% (236/5878) | |
Resolving deltas: 5% (297/5878) | |
Resolving deltas: 6% (354/5878) | |
Resolving deltas: 7% (417/5878) | |
Resolving deltas: 8% (474/5878) | |
Resolving deltas: 9% (533/5878) | |
Resolving deltas: 10% (628/5878) | |
Resolving deltas: 11% (664/5878) | |
Resolving deltas: 12% (707/5878) | |
Resolving deltas: 13% (772/5878) | |
Resolving deltas: 14% (823/5878) | |
Resolving deltas: 15% (883/5878) | |
Resolving deltas: 16% (941/5878) | |
Resolving deltas: 17% (1018/5878) | |
Resolving deltas: 18% (1059/5878) | |
Resolving deltas: 19% (1122/5878) | |
Resolving deltas: 20% (1200/5878) | |
Resolving deltas: 21% (1240/5878) | |
Resolving deltas: 22% (1295/5878) | |
Resolving deltas: 23% (1352/5878) | |
Resolving deltas: 24% (1413/5878) | |
Resolving deltas: 25% (1472/5878) | |
Resolving deltas: 26% (1531/5878) | |
Resolving deltas: 27% (1588/5878) | |
Resolving deltas: 28% (1664/5878) | |
Resolving deltas: 29% (1707/5878) | |
Resolving deltas: 30% (1783/5878) | |
Resolving deltas: 31% (1829/5878) | |
Resolving deltas: 32% (1881/5878) | |
Resolving deltas: 33% (1940/5878) | |
Resolving deltas: 34% (2018/5878) | |
Resolving deltas: 35% (2058/5878) | |
Resolving deltas: 36% (2118/5878) | |
Resolving deltas: 37% (2180/5878) | |
Resolving deltas: 38% (2238/5878) | |
Resolving deltas: 39% (2297/5878) | |
Resolving deltas: 40% (2352/5878) | |
Resolving deltas: 41% (2416/5878) | |
Resolving deltas: 42% (2469/5878) | |
Resolving deltas: 43% (2529/5878) | |
Resolving deltas: 44% (2633/5878) | |
Resolving deltas: 45% (2680/5878) | |
Resolving deltas: 48% (2876/5878) | |
Resolving deltas: 49% (2886/5878) | |
Resolving deltas: 50% (2948/5878) | |
Resolving deltas: 51% (3021/5878) | |
Resolving deltas: 52% (3066/5878) | |
Resolving deltas: 53% (3117/5878) | |
Resolving deltas: 54% (3176/5878) | |
Resolving deltas: 55% (3233/5878) | |
Resolving deltas: 56% (3295/5878) | |
Resolving deltas: 57% (3356/5878) | |
Resolving deltas: 58% (3419/5878) | |
Resolving deltas: 59% (3469/5878) | |
Resolving deltas: 60% (3560/5878) | |
Resolving deltas: 61% (3607/5878) | |
Resolving deltas: 62% (3648/5878) | |
Resolving deltas: 63% (3705/5878) | |
Resolving deltas: 64% (3767/5878) | |
Resolving deltas: 65% (3821/5878) | |
Resolving deltas: 66% (3884/5878) | |
Resolving deltas: 67% (3941/5878) | |
Resolving deltas: 68% (4000/5878) | |
Resolving deltas: 69% (4057/5878) | |
Resolving deltas: 70% (4115/5878) | |
Resolving deltas: 71% (4175/5878) | |
Resolving deltas: 72% (4233/5878) | |
Resolving deltas: 73% (4291/5878) | |
Resolving deltas: 74% (4356/5878) | |
Resolving deltas: 75% (4411/5878) | |
Resolving deltas: 76% (4468/5878) | |
Resolving deltas: 77% (4547/5878) | |
Resolving deltas: 78% (4590/5878) | |
Resolving deltas: 79% (4664/5878) | |
Resolving deltas: 80% (4706/5878) | |
Resolving deltas: 81% (4763/5878) | |
Resolving deltas: 82% (4821/5878) | |
Resolving deltas: 83% (4886/5878) | |
Resolving deltas: 84% (4939/5878) | |
Resolving deltas: 85% (4999/5878) | |
Resolving deltas: 86% (5061/5878) | |
Resolving deltas: 87% (5114/5878) | |
Resolving deltas: 88% (5174/5878) | |
Resolving deltas: 89% (5250/5878) | |
Resolving deltas: 90% (5303/5878) | |
Resolving deltas: 91% (5368/5878) | |
Resolving deltas: 92% (5410/5878) | |
Resolving deltas: 93% (5473/5878) | |
Resolving deltas: 94% (5526/5878) | |
Resolving deltas: 95% (5589/5878) | |
Resolving deltas: 96% (5653/5878) | |
Resolving deltas: 97% (5704/5878) | |
Resolving deltas: 98% (5764/5878) | |
Resolving deltas: 99% (5821/5878) | |
Resolving deltas: 100% (5878/5878) | |
Resolving deltas: 100% (5878/5878), done. | |
travis_time:end:27caa04a:start=1591787200920962593,finish=1591787206487373367,duration=5566410774,event=checkout | |
[0K$ cd apache/tinkerpop | |
travis_time:start:12b7b9a0 | |
[0K$ git fetch origin +refs/pull/1292/merge: | |
remote: Enumerating objects: 295, done.[K | |
remote: Counting objects: 0% (1/238)[K | |
remote: Counting objects: 1% (3/238)[K | |
remote: Counting objects: 2% (5/238)[K | |
remote: Counting objects: 3% (8/238)[K | |
remote: Counting objects: 4% (10/238)[K | |
remote: Counting objects: 5% (12/238)[K | |
remote: Counting objects: 6% (15/238)[K | |
remote: Counting objects: 7% (17/238)[K | |
remote: Counting objects: 8% (20/238)[K | |
remote: Counting objects: 9% (22/238)[K | |
remote: Counting objects: 10% (24/238)[K | |
remote: Counting objects: 11% (27/238)[K | |
remote: Counting objects: 12% (29/238)[K | |
remote: Counting objects: 13% (31/238)[K | |
remote: Counting objects: 14% (34/238)[K | |
remote: Counting objects: 15% (36/238)[K | |
remote: Counting objects: 16% (39/238)[K | |
remote: Counting objects: 17% (41/238)[K | |
remote: Counting objects: 18% (43/238)[K | |
remote: Counting objects: 19% (46/238)[K | |
remote: Counting objects: 20% (48/238)[K | |
remote: Counting objects: 21% (50/238)[K | |
remote: Counting objects: 22% (53/238)[K | |
remote: Counting objects: 23% (55/238)[K | |
remote: Counting objects: 24% (58/238)[K | |
remote: Counting objects: 25% (60/238)[K | |
remote: Counting objects: 26% (62/238)[K | |
remote: Counting objects: 27% (65/238)[K | |
remote: Counting objects: 28% (67/238)[K | |
remote: Counting objects: 29% (70/238)[K | |
remote: Counting objects: 30% (72/238)[K | |
remote: Counting objects: 31% (74/238)[K | |
remote: Counting objects: 32% (77/238)[K | |
remote: Counting objects: 33% (79/238)[K | |
remote: Counting objects: 34% (81/238)[K | |
remote: Counting objects: 35% (84/238)[K | |
remote: Counting objects: 36% (86/238)[K | |
remote: Counting objects: 37% (89/238)[K | |
remote: Counting objects: 38% (91/238)[K | |
remote: Counting objects: 39% (93/238)[K | |
remote: Counting objects: 40% (96/238)[K | |
remote: Counting objects: 41% (98/238)[K | |
remote: Counting objects: 42% (100/238)[K | |
remote: Counting objects: 43% (103/238)[K | |
remote: Counting objects: 44% (105/238)[K | |
remote: Counting objects: 45% (108/238)[K | |
remote: Counting objects: 46% (110/238)[K | |
remote: Counting objects: 47% (112/238)[K | |
remote: Counting objects: 48% (115/238)[K | |
remote: Counting objects: 49% (117/238)[K | |
remote: Counting objects: 50% (119/238)[K | |
remote: Counting objects: 51% (122/238)[K | |
remote: Counting objects: 52% (124/238)[K | |
remote: Counting objects: 53% (127/238)[K | |
remote: Counting objects: 54% (129/238)[K | |
remote: Counting objects: 55% (131/238)[K | |
remote: Counting objects: 56% (134/238)[K | |
remote: Counting objects: 57% (136/238)[K | |
remote: Counting objects: 58% (139/238)[K | |
remote: Counting objects: 59% (141/238)[K | |
remote: Counting objects: 60% (143/238)[K | |
remote: Counting objects: 61% (146/238)[K | |
remote: Counting objects: 62% (148/238)[K | |
remote: Counting objects: 63% (150/238)[K | |
remote: Counting objects: 64% (153/238)[K | |
remote: Counting objects: 65% (155/238)[K | |
remote: Counting objects: 66% (158/238)[K | |
remote: Counting objects: 67% (160/238)[K | |
remote: Counting objects: 68% (162/238)[K | |
remote: Counting objects: 69% (165/238)[K | |
remote: Counting objects: 70% (167/238)[K | |
remote: Counting objects: 71% (169/238)[K | |
remote: Counting objects: 72% (172/238)[K | |
remote: Counting objects: 73% (174/238)[K | |
remote: Counting objects: 74% (177/238)[K | |
remote: Counting objects: 75% (179/238)[K | |
remote: Counting objects: 76% (181/238)[K | |
remote: Counting objects: 77% (184/238)[K | |
remote: Counting objects: 78% (186/238)[K | |
remote: Counting objects: 79% (189/238)[K | |
remote: Counting objects: 80% (191/238)[K | |
remote: Counting objects: 81% (193/238)[K | |
remote: Counting objects: 82% (196/238)[K | |
remote: Counting objects: 83% (198/238)[K | |
remote: Counting objects: 84% (200/238)[K | |
remote: Counting objects: 85% (203/238)[K | |
remote: Counting objects: 86% (205/238)[K | |
remote: Counting objects: 87% (208/238)[K | |
remote: Counting objects: 88% (210/238)[K | |
remote: Counting objects: 89% (212/238)[K | |
remote: Counting objects: 90% (215/238)[K | |
remote: Counting objects: 91% (217/238)[K | |
remote: Counting objects: 92% (219/238)[K | |
remote: Counting objects: 93% (222/238)[K | |
remote: Counting objects: 94% (224/238)[K | |
remote: Counting objects: 95% (227/238)[K | |
remote: Counting objects: 96% (229/238)[K | |
remote: Counting objects: 97% (231/238)[K | |
remote: Counting objects: 98% (234/238)[K | |
remote: Counting objects: 99% (236/238)[K | |
remote: Counting objects: 100% (238/238)[K | |
remote: Counting objects: 100% (238/238), done.[K | |
remote: Compressing objects: 3% (1/33)[K | |
remote: Compressing objects: 6% (2/33)[K | |
remote: Compressing objects: 9% (3/33)[K | |
remote: Compressing objects: 12% (4/33)[K | |
remote: Compressing objects: 15% (5/33)[K | |
remote: Compressing objects: 18% (6/33)[K | |
remote: Compressing objects: 21% (7/33)[K | |
remote: Compressing objects: 24% (8/33)[K | |
remote: Compressing objects: 27% (9/33)[K | |
remote: Compressing objects: 30% (10/33)[K | |
remote: Compressing objects: 33% (11/33)[K | |
remote: Compressing objects: 36% (12/33)[K | |
remote: Compressing objects: 39% (13/33)[K | |
remote: Compressing objects: 42% (14/33)[K | |
remote: Compressing objects: 45% (15/33)[K | |
remote: Compressing objects: 48% (16/33)[K | |
remote: Compressing objects: 51% (17/33)[K | |
remote: Compressing objects: 54% (18/33)[K | |
remote: Compressing objects: 57% (19/33)[K | |
remote: Compressing objects: 60% (20/33)[K | |
remote: Compressing objects: 63% (21/33)[K | |
remote: Compressing objects: 66% (22/33)[K | |
remote: Compressing objects: 69% (23/33)[K | |
remote: Compressing objects: 72% (24/33)[K | |
remote: Compressing objects: 75% (25/33)[K | |
remote: Compressing objects: 78% (26/33)[K | |
remote: Compressing objects: 81% (27/33)[K | |
remote: Compressing objects: 84% (28/33)[K | |
remote: Compressing objects: 87% (29/33)[K | |
remote: Compressing objects: 90% (30/33)[K | |
remote: Compressing objects: 93% (31/33)[K | |
remote: Compressing objects: 96% (32/33)[K | |
remote: Compressing objects: 100% (33/33)[K | |
remote: Compressing objects: 100% (33/33), done.[K | |
remote: Total 99 (delta 57), reused 75 (delta 43), pack-reused 0[K | |
Unpacking objects: 1% (1/99) | |
Unpacking objects: 2% (2/99) | |
Unpacking objects: 3% (3/99) | |
Unpacking objects: 4% (4/99) | |
Unpacking objects: 5% (5/99) | |
Unpacking objects: 6% (6/99) | |
Unpacking objects: 7% (7/99) | |
Unpacking objects: 8% (8/99) | |
Unpacking objects: 9% (9/99) | |
Unpacking objects: 10% (10/99) | |
Unpacking objects: 11% (11/99) | |
Unpacking objects: 12% (12/99) | |
Unpacking objects: 13% (13/99) | |
Unpacking objects: 14% (14/99) | |
Unpacking objects: 15% (15/99) | |
Unpacking objects: 16% (16/99) | |
Unpacking objects: 17% (17/99) | |
Unpacking objects: 18% (18/99) | |
Unpacking objects: 19% (19/99) | |
Unpacking objects: 20% (20/99) | |
Unpacking objects: 21% (21/99) | |
Unpacking objects: 22% (22/99) | |
Unpacking objects: 23% (23/99) | |
Unpacking objects: 24% (24/99) | |
Unpacking objects: 25% (25/99) | |
Unpacking objects: 26% (26/99) | |
Unpacking objects: 27% (27/99) | |
Unpacking objects: 28% (28/99) | |
Unpacking objects: 29% (29/99) | |
Unpacking objects: 30% (30/99) | |
Unpacking objects: 31% (31/99) | |
Unpacking objects: 32% (32/99) | |
Unpacking objects: 33% (33/99) | |
Unpacking objects: 34% (34/99) | |
Unpacking objects: 35% (35/99) | |
Unpacking objects: 36% (36/99) | |
Unpacking objects: 37% (37/99) | |
Unpacking objects: 38% (38/99) | |
Unpacking objects: 39% (39/99) | |
Unpacking objects: 40% (40/99) | |
Unpacking objects: 41% (41/99) | |
Unpacking objects: 42% (42/99) | |
Unpacking objects: 43% (43/99) | |
Unpacking objects: 44% (44/99) | |
Unpacking objects: 45% (45/99) | |
Unpacking objects: 46% (46/99) | |
Unpacking objects: 47% (47/99) | |
Unpacking objects: 48% (48/99) | |
Unpacking objects: 49% (49/99) | |
Unpacking objects: 50% (50/99) | |
Unpacking objects: 51% (51/99) | |
Unpacking objects: 52% (52/99) | |
Unpacking objects: 53% (53/99) | |
Unpacking objects: 54% (54/99) | |
Unpacking objects: 55% (55/99) | |
Unpacking objects: 56% (56/99) | |
Unpacking objects: 57% (57/99) | |
Unpacking objects: 58% (58/99) | |
Unpacking objects: 59% (59/99) | |
Unpacking objects: 60% (60/99) | |
Unpacking objects: 61% (61/99) | |
Unpacking objects: 62% (62/99) | |
Unpacking objects: 63% (63/99) | |
Unpacking objects: 64% (64/99) | |
Unpacking objects: 65% (65/99) | |
Unpacking objects: 66% (66/99) | |
Unpacking objects: 67% (67/99) | |
Unpacking objects: 68% (68/99) | |
Unpacking objects: 69% (69/99) | |
Unpacking objects: 70% (70/99) | |
Unpacking objects: 71% (71/99) | |
Unpacking objects: 72% (72/99) | |
Unpacking objects: 73% (73/99) | |
Unpacking objects: 74% (74/99) | |
Unpacking objects: 75% (75/99) | |
Unpacking objects: 76% (76/99) | |
Unpacking objects: 77% (77/99) | |
Unpacking objects: 78% (78/99) | |
Unpacking objects: 79% (79/99) | |
Unpacking objects: 80% (80/99) | |
Unpacking objects: 81% (81/99) | |
Unpacking objects: 82% (82/99) | |
Unpacking objects: 83% (83/99) | |
Unpacking objects: 84% (84/99) | |
Unpacking objects: 85% (85/99) | |
Unpacking objects: 86% (86/99) | |
Unpacking objects: 87% (87/99) | |
Unpacking objects: 88% (88/99) | |
Unpacking objects: 89% (89/99) | |
Unpacking objects: 90% (90/99) | |
Unpacking objects: 91% (91/99) | |
Unpacking objects: 92% (92/99) | |
Unpacking objects: 93% (93/99) | |
Unpacking objects: 94% (94/99) | |
Unpacking objects: 95% (95/99) | |
Unpacking objects: 96% (96/99) | |
Unpacking objects: 97% (97/99) | |
Unpacking objects: 98% (98/99) | |
Unpacking objects: 100% (99/99) | |
Unpacking objects: 100% (99/99), 11.06 KiB | 306.00 KiB/s, done. | |
From https://github.com/apache/tinkerpop | |
* branch refs/pull/1292/merge -> FETCH_HEAD | |
travis_time:end:12b7b9a0:start=1591787206491708953,finish=1591787207278584531,duration=786875578,event=checkout | |
[0K$ git checkout -qf FETCH_HEAD | |
travis_fold:end:git.checkout | |
[0K | |
travis_time:end:12b7b9a0:start=1591787206491708953,finish=1591787207861655645,duration=1369946692,event=checkout | |
[0Ktravis_time:start:02c70fde | |
[0Ktravis_time:end:02c70fde:start=1591787207867659957,finish=1591787207876724876,duration=9064919,event=env | |
[0Ktravis_fold:start:cache.1 | |
[0KSetting up build cache | |
$ export CASHER_DIR=${TRAVIS_HOME}/.casher | |
travis_time:start:24c24170 | |
[0K$ Installing caching utilities | |
travis_time:end:24c24170:start=1591787208696758935,finish=1591787208864891387,duration=168132452,event=setup_casher | |
[0Ktravis_time:start:072baae0 | |
[0Ktravis_time:end:072baae0:start=1591787208869839402,finish=1591787208872875404,duration=3036002,event=setup_casher | |
[0Ktravis_time:start:1b4cd3c0 | |
[0Kattempting to download cache archive[0m | |
[32;1mfetching PR.1292/cache--linux-xenial-e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855--jdk-openjdk8.tgz[0m | |
[32;1mfetching PR.1292/cache-linux-xenial-e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855--jdk-openjdk8.tgz[0m | |
[32;1mfetching PR.1292/cache--jdk-openjdk8.tgz[0m | |
[32;1mfetching master/cache--linux-xenial-e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855--jdk-openjdk8.tgz[0m | |
[32;1mfound cache[0m | |
travis_time:end:1b4cd3c0:start=1591787208876930137,finish=1591787211778279817,duration=2901349680,event=setup_casher | |
[0Ktravis_time:start:049fddd0 | |
[0Ktravis_time:end:049fddd0:start=1591787211782491271,finish=1591787211785486792,duration=2995521,event=setup_casher | |
[0Ktravis_time:start:1085c418 | |
[0Kadding /home/travis/mvn-home to cache[0m | |
creating directory /home/travis/mvn-home[0m | |
travis_time:end:1085c418:start=1591787211789185253,finish=1591787212917239004,duration=1128053751,event=setup_casher | |
[0Ktravis_fold:end:cache.1 | |
[0K | |
$ java -Xmx32m -version | |
openjdk version "1.8.0_242" | |
OpenJDK Runtime Environment (build 1.8.0_242-8u242-b08-0ubuntu3~16.04-b08) | |
OpenJDK 64-Bit Server VM (build 25.242-b08, mixed mode) | |
$ javac -J-Xmx32m -version | |
javac 1.8.0_242 | |
travis_fold:start:before_install.1 | |
[0Ktravis_time:start:0a0cff04 | |
[0K$ wget -q https://packages.microsoft.com/config/ubuntu/18.04/packages-microsoft-prod.deb -O packages-microsoft-prod.deb | |
travis_time:end:0a0cff04:start=1591787213511816857,finish=1591787213695156509,duration=183339652,event=before_install | |
[0Ktravis_fold:end:before_install.1 | |
[0Ktravis_fold:start:before_install.2 | |
[0Ktravis_time:start:09cc8b80 | |
[0K$ sudo dpkg -i packages-microsoft-prod.deb | |
Selecting previously unselected package packages-microsoft-prod. | |
(Reading database ... | |
(Reading database ... 5% | |
(Reading database ... 10% | |
(Reading database ... 15% | |
(Reading database ... 20% | |
(Reading database ... 25% | |
(Reading database ... 30% | |
(Reading database ... 35% | |
(Reading database ... 40% | |
(Reading database ... 45% | |
(Reading database ... 50% | |
(Reading database ... 55% | |
(Reading database ... 60% | |
(Reading database ... 65% | |
(Reading database ... 70% | |
(Reading database ... 75% | |
(Reading database ... 80% | |
(Reading database ... 85% | |
(Reading database ... 90% | |
(Reading database ... 95% | |
(Reading database ... 100% | |
(Reading database ... 124360 files and directories currently installed.) | |
Preparing to unpack packages-microsoft-prod.deb ... | |
Unpacking packages-microsoft-prod (1.0-ubuntu18.04.2) ... | |
Setting up packages-microsoft-prod (1.0-ubuntu18.04.2) ... | |
travis_time:end:09cc8b80:start=1591787213699689682,finish=1591787214510712410,duration=811022728,event=before_install | |
[0Ktravis_fold:end:before_install.2 | |
[0Ktravis_fold:start:before_install.3 | |
[0Ktravis_time:start:133e5db4 | |
[0K$ sudo add-apt-repository universe | |
'universe' distribution component is already enabled for all sources. | |
travis_time:end:133e5db4:start=1591787214515172858,finish=1591787214807134865,duration=291962007,event=before_install | |
[0Ktravis_fold:end:before_install.3 | |
[0Ktravis_fold:start:before_install.4 | |
[0Ktravis_time:start:03bcee5a | |
[0K$ sudo apt update | |
[33m | |
0% [Working][0m | |
Hit:1 http://security.ubuntu.com/ubuntu xenial-security InRelease | |
[33m | |
0% [Connecting to archive.ubuntu.com (91.189.88.152)] [Connecting to ppa.launch[0m[33m | |
0% [1 InRelease gpgv 109 kB] [Connecting to archive.ubuntu.com (91.189.88.152)][0m | |
Get:2 https://packages.microsoft.com/ubuntu/18.04/prod bionic InRelease [4,003 B] | |
[33m | |
0% [1 InRelease gpgv 109 kB] [Waiting for headers] [Waiting for headers] [2 InR[0m[33m | |
0% [1 InRelease gpgv 109 kB] [Waiting for headers] [Waiting for headers] [Conne[0m[33m | |
0% [Waiting for headers] [Waiting for headers] [Waiting for headers][0m[33m | |
0% [2 InRelease gpgv 4,003 B] [Waiting for headers] [Waiting for headers] [Wait[0m | |
Hit:3 http://archive.ubuntu.com/ubuntu xenial InRelease | |
[33m | |
0% [2 InRelease gpgv 4,003 B] [Waiting for headers] [Waiting for headers] [Wait[0m | |
Hit:4 http://ppa.launchpad.net/deadsnakes/ppa/ubuntu xenial InRelease | |
[33m | |
0% [2 InRelease gpgv 4,003 B] [Waiting for headers] [Waiting for headers][0m[33m | |
0% [Waiting for headers] [Waiting for headers][0m[33m | |
0% [3 InRelease gpgv 247 kB] [Waiting for headers] [Waiting for headers][0m | |
Get:5 https://packages.microsoft.com/ubuntu/18.04/prod bionic/main amd64 Packages [129 kB] | |
[33m | |
0% [3 InRelease gpgv 247 kB] [Waiting for headers] [5 Packages 16.0 kB/129 kB 1[0m | |
Hit:6 http://apt.postgresql.org/pub/repos/apt xenial-pgdg InRelease | |
[33m | |
0% [3 InRelease gpgv 247 kB] [Waiting for headers] [5 Packages 81.6 kB/129 kB 6[0m[33m | |
0% [3 InRelease gpgv 247 kB] [Waiting for headers][0m[33m | |
0% [5 Packages store 0 B] [3 InRelease gpgv 247 kB] [Waiting for headers][0m | |
Hit:7 http://archive.ubuntu.com/ubuntu xenial-updates InRelease | |
[33m | |
0% [5 Packages store 0 B] [3 InRelease gpgv 247 kB][0m[33m | |
0% [3 InRelease gpgv 247 kB] [Waiting for headers][0m[33m | |
0% [Waiting for headers][0m[33m | |
0% [4 InRelease gpgv 18.0 kB] [Waiting for headers][0m[33m | |
0% [Waiting for headers][0m[33m | |
0% [6 InRelease gpgv 66.6 kB] [Waiting for headers][0m | |
Hit:8 http://archive.ubuntu.com/ubuntu xenial-backports InRelease | |
[33m | |
0% [6 InRelease gpgv 66.6 kB][0m[33m | |
0% [Working][0m[33m | |
0% [7 InRelease gpgv 109 kB][0m[33m | |
0% [Working][0m[33m | |
0% [8 InRelease gpgv 107 kB][0m[33m | |
100% [Working][0m | |
Fetched 133 kB in 0s (210 kB/s) | |
Reading package lists... 0% | |
Reading package lists... 0% | |
Reading package lists... 1% | |
Reading package lists... 3% | |
Reading package lists... 3% | |
Reading package lists... 7% | |
Reading package lists... 7% | |
Reading package lists... 9% | |
Reading package lists... 9% | |
Reading package lists... 9% | |
Reading package lists... 9% | |
Reading package lists... 9% | |
Reading package lists... 9% | |
Reading package lists... 9% | |
Reading package lists... 9% | |
Reading package lists... 31% | |
Reading package lists... 31% | |
Reading package lists... 42% | |
Reading package lists... 52% | |
Reading package lists... 52% | |
Reading package lists... 65% | |
Reading package lists... 65% | |
Reading package lists... 65% | |
Reading package lists... 65% | |
Reading package lists... 65% | |
Reading package lists... 65% | |
Reading package lists... 66% | |
Reading package lists... 66% | |
Reading package lists... 70% | |
Reading package lists... 70% | |
Reading package lists... 73% | |
Reading package lists... 73% | |
Reading package lists... 77% | |
Reading package lists... 77% | |
Reading package lists... 77% | |
Reading package lists... 77% | |
Reading package lists... 77% | |
Reading package lists... 77% | |
Reading package lists... 77% | |
Reading package lists... 77% | |
Reading package lists... 80% | |
Reading package lists... 80% | |
Reading package lists... 82% | |
Reading package lists... 82% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 87% | |
Reading package lists... 87% | |
Reading package lists... 90% | |
Reading package lists... 90% | |
Reading package lists... 93% | |
Reading package lists... 93% | |
Reading package lists... 93% | |
Reading package lists... 93% | |
Reading package lists... 93% | |
Reading package lists... 93% | |
Reading package lists... 93% | |
Reading package lists... 93% | |
Reading package lists... 95% | |
Reading package lists... 95% | |
Reading package lists... 96% | |
Reading package lists... 96% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 98% | |
Reading package lists... 98% | |
Reading package lists... 98% | |
Reading package lists... 98% | |
Reading package lists... 98% | |
Reading package lists... 98% | |
Reading package lists... 98% | |
Reading package lists... 98% | |
Reading package lists... 99% | |
Reading package lists... 99% | |
Reading package lists... Done | |
Building dependency tree... 0% | |
Building dependency tree... 0% | |
Building dependency tree... 1% | |
Building dependency tree... 50% | |
Building dependency tree... 50% | |
Building dependency tree | |
Reading state information... 0% | |
Reading state information... 0% | |
Reading state information... Done | |
151 packages can be upgraded. Run 'apt list --upgradable' to see them. | |
travis_time:end:03bcee5a:start=1591787214811753041,finish=1591787220764174544,duration=5952421503,event=before_install | |
[0Ktravis_fold:end:before_install.4 | |
[0Ktravis_fold:start:before_install.5 | |
[0Ktravis_time:start:2967c1c0 | |
[0K$ sudo apt install apt-transport-https | |
Reading package lists... 0% | |
Reading package lists... 100% | |
Reading package lists... Done | |
Building dependency tree... 0% | |
Building dependency tree... 0% | |
Building dependency tree... 50% | |
Building dependency tree... 50% | |
Building dependency tree | |
Reading state information... 0% | |
Reading state information... 0% | |
Reading state information... Done | |
The following packages will be upgraded: | |
apt-transport-https | |
1 upgraded, 0 newly installed, 0 to remove and 150 not upgraded. | |
Need to get 26.7 kB of archives. | |
After this operation, 0 B of additional disk space will be used. | |
[33m | |
0% [Working][0m | |
Get:1 http://archive.ubuntu.com/ubuntu xenial-updates/main amd64 apt-transport-https amd64 1.2.32ubuntu0.1 [26.7 kB] | |
[33m | |
38% [1 apt-transport-https 12.6 kB/26.7 kB 47%][0m[33m | |
100% [Working][0m | |
Fetched 26.7 kB in 0s (77.1 kB/s) | |
7[0;39r8[1A(Reading database ... | |
(Reading database ... 5% | |
(Reading database ... 10% | |
(Reading database ... 15% | |
(Reading database ... 20% | |
(Reading database ... 25% | |
(Reading database ... 30% | |
(Reading database ... 35% | |
(Reading database ... 40% | |
(Reading database ... 45% | |
(Reading database ... 50% | |
(Reading database ... 55% | |
(Reading database ... 60% | |
(Reading database ... 65% | |
(Reading database ... 70% | |
(Reading database ... 75% | |
(Reading database ... 80% | |
(Reading database ... 85% | |
(Reading database ... 90% | |
(Reading database ... 95% | |
(Reading database ... 100% | |
(Reading database ... 124368 files and directories currently installed.) | |
Preparing to unpack .../apt-transport-https_1.2.32ubuntu0.1_amd64.deb ... | |
7[40;0f[42m[30mProgress: [ 0%][49m[39m [..........................................................] 87[40;0f[42m[30mProgress: [ 16%][49m[39m [##########................................................] 8Unpacking apt-transport-https (1.2.32ubuntu0.1) over (1.2.32) ... | |
7[40;0f[42m[30mProgress: [ 33%][49m[39m [####################......................................] 87[40;0f[42m[30mProgress: [ 50%][49m[39m [#############################.............................] 8Setting up apt-transport-https (1.2.32ubuntu0.1) ... | |
7[40;0f[42m[30mProgress: [ 66%][49m[39m [#######################################...................] 87[40;0f[42m[30mProgress: [ 83%][49m[39m [#################################################.........] 8 | |
7[0;40r8[1A[Jtravis_time:end:2967c1c0:start=1591787220768973109,finish=1591787223737197002,duration=2968223893,event=before_install | |
[0Ktravis_fold:end:before_install.5 | |
[0Ktravis_fold:start:before_install.6 | |
[0Ktravis_time:start:01d80d28 | |
[0K$ sudo apt update | |
[33m | |
0% [Working][0m | |
Hit:1 http://security.ubuntu.com/ubuntu xenial-security InRelease | |
[33m | |
0% [Connecting to archive.ubuntu.com (91.189.88.152)] [Connecting to ppa.launch[0m[33m | |
0% [1 InRelease gpgv 109 kB] [Connecting to archive.ubuntu.com (91.189.88.152)][0m | |
Hit:2 http://apt.postgresql.org/pub/repos/apt xenial-pgdg InRelease | |
[33m | |
0% [1 InRelease gpgv 109 kB] [Connecting to archive.ubuntu.com (91.189.88.152)][0m | |
Hit:3 https://packages.microsoft.com/ubuntu/18.04/prod bionic InRelease | |
[33m | |
0% [1 InRelease gpgv 109 kB] [Waiting for headers] [Waiting for headers][0m[33m | |
0% [Waiting for headers] [Waiting for headers][0m[33m | |
0% [2 InRelease gpgv 66.6 kB] [Waiting for headers] [Waiting for headers][0m | |
Hit:4 http://ppa.launchpad.net/deadsnakes/ppa/ubuntu xenial InRelease | |
[33m | |
0% [2 InRelease gpgv 66.6 kB] [Waiting for headers][0m | |
Hit:5 http://archive.ubuntu.com/ubuntu xenial InRelease | |
[33m | |
0% [2 InRelease gpgv 66.6 kB] [Waiting for headers][0m[33m | |
0% [Waiting for headers][0m[33m | |
0% [3 InRelease gpgv 4,003 B] [Waiting for headers][0m[33m | |
0% [Waiting for headers][0m[33m | |
0% [4 InRelease gpgv 18.0 kB] [Waiting for headers][0m | |
Hit:6 http://archive.ubuntu.com/ubuntu xenial-updates InRelease | |
[33m | |
0% [4 InRelease gpgv 18.0 kB][0m[33m | |
0% [Waiting for headers][0m[33m | |
0% [5 InRelease gpgv 247 kB] [Waiting for headers][0m | |
Hit:7 http://archive.ubuntu.com/ubuntu xenial-backports InRelease | |
[33m | |
0% [5 InRelease gpgv 247 kB][0m[33m | |
0% [Working][0m[33m | |
0% [6 InRelease gpgv 109 kB][0m[33m | |
0% [Working][0m[33m | |
0% [7 InRelease gpgv 107 kB][0m[33m | |
20% [Working][0m | |
Reading package lists... 0% | |
Reading package lists... 0% | |
Reading package lists... 1% | |
Reading package lists... 3% | |
Reading package lists... 3% | |
Reading package lists... 7% | |
Reading package lists... 7% | |
Reading package lists... 9% | |
Reading package lists... 9% | |
Reading package lists... 9% | |
Reading package lists... 9% | |
Reading package lists... 9% | |
Reading package lists... 9% | |
Reading package lists... 9% | |
Reading package lists... 9% | |
Reading package lists... 31% | |
Reading package lists... 31% | |
Reading package lists... 41% | |
Reading package lists... 52% | |
Reading package lists... 52% | |
Reading package lists... 65% | |
Reading package lists... 65% | |
Reading package lists... 65% | |
Reading package lists... 65% | |
Reading package lists... 65% | |
Reading package lists... 65% | |
Reading package lists... 66% | |
Reading package lists... 66% | |
Reading package lists... 70% | |
Reading package lists... 70% | |
Reading package lists... 73% | |
Reading package lists... 73% | |
Reading package lists... 77% | |
Reading package lists... 77% | |
Reading package lists... 77% | |
Reading package lists... 77% | |
Reading package lists... 77% | |
Reading package lists... 77% | |
Reading package lists... 77% | |
Reading package lists... 77% | |
Reading package lists... 80% | |
Reading package lists... 80% | |
Reading package lists... 82% | |
Reading package lists... 82% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 84% | |
Reading package lists... 87% | |
Reading package lists... 87% | |
Reading package lists... 90% | |
Reading package lists... 90% | |
Reading package lists... 93% | |
Reading package lists... 93% | |
Reading package lists... 93% | |
Reading package lists... 93% | |
Reading package lists... 93% | |
Reading package lists... 93% | |
Reading package lists... 93% | |
Reading package lists... 93% | |
Reading package lists... 95% | |
Reading package lists... 95% | |
Reading package lists... 96% | |
Reading package lists... 96% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 97% | |
Reading package lists... 98% | |
Reading package lists... 98% | |
Reading package lists... 98% | |
Reading package lists... 98% | |
Reading package lists... 98% | |
Reading package lists... 98% | |
Reading package lists... 98% | |
Reading package lists... 98% | |
Reading package lists... 98% | |
Reading package lists... 99% | |
Reading package lists... 99% | |
Reading package lists... Done | |
Building dependency tree... 0% | |
Building dependency tree... 0% | |
Building dependency tree... 1% | |
Building dependency tree... 50% | |
Building dependency tree... 50% | |
Building dependency tree | |
Reading state information... 0% | |
Reading state information... 0% | |
Reading state information... Done | |
150 packages can be upgraded. Run 'apt list --upgradable' to see them. | |
travis_time:end:01d80d28:start=1591787223741693158,finish=1591787226426340518,duration=2684647360,event=before_install | |
[0Ktravis_fold:end:before_install.6 | |
[0Ktravis_fold:start:before_install.7 | |
[0Ktravis_time:start:00631de8 | |
[0K$ sudo apt install dotnet-sdk-3.1 | |
Reading package lists... 0% | |
Reading package lists... 100% | |
Reading package lists... Done | |
Building dependency tree... 0% | |
Building dependency tree... 0% | |
Building dependency tree... 50% | |
Building dependency tree... 50% | |
Building dependency tree | |
Reading state information... 0% | |
Reading state information... 0% | |
Reading state information... Done | |
The following additional packages will be installed: | |
aspnetcore-runtime-3.1 aspnetcore-targeting-pack-3.1 dotnet-apphost-pack-3.1 | |
dotnet-host dotnet-hostfxr-3.1 dotnet-runtime-3.1 dotnet-runtime-deps-3.1 | |
dotnet-targeting-pack-3.1 netstandard-targeting-pack-2.1 | |
The following NEW packages will be installed: | |
aspnetcore-runtime-3.1 aspnetcore-targeting-pack-3.1 dotnet-apphost-pack-3.1 | |
dotnet-host dotnet-hostfxr-3.1 dotnet-runtime-3.1 dotnet-runtime-deps-3.1 | |
dotnet-sdk-3.1 dotnet-targeting-pack-3.1 netstandard-targeting-pack-2.1 | |
0 upgraded, 10 newly installed, 0 to remove and 150 not upgraded. | |
Need to get 78.7 MB of archives. | |
After this operation, 337 MB of additional disk space will be used. | |
[33m | |
0% [Working][0m | |
Get:1 https://packages.microsoft.com/ubuntu/18.04/prod bionic/main amd64 dotnet-host amd64 3.1.5-1 [32.8 kB] | |
[33m | |
0% [1 dotnet-host 16.0 kB/32.8 kB 49%][0m[33m | |
2% [Working][0m | |
Get:2 https://packages.microsoft.com/ubuntu/18.04/prod bionic/main amd64 dotnet-hostfxr-3.1 amd64 3.1.5-1 [121 kB] | |
[33m | |
2% [2 dotnet-hostfxr-3.1 4,096 B/121 kB 3%][0m[33m | |
4% [Working][0m | |
Get:3 https://packages.microsoft.com/ubuntu/18.04/prod bionic/main amd64 dotnet-runtime-deps-3.1 amd64 3.1.5-1 [2,664 B] | |
[33m | |
4% [3 dotnet-runtime-deps-3.1 2,664 B/2,664 B 100%][0m[33m | |
6% [Working][0m | |
Get:4 https://packages.microsoft.com/ubuntu/18.04/prod bionic/main amd64 dotnet-runtime-3.1 amd64 3.1.5-1 [21.8 MB] | |
[33m | |
6% [4 dotnet-runtime-3.1 16.0 kB/21.8 MB 0%][0m[33m | |
30% [Working][0m | |
Get:5 https://packages.microsoft.com/ubuntu/18.04/prod bionic/main amd64 aspnetcore-runtime-3.1 amd64 3.1.5-1 [5,760 kB] | |
[33m | |
30% [5 aspnetcore-runtime-3.1 16.0 kB/5,760 kB 0%][0m[33m | |
38% [Working][0m | |
Get:6 https://packages.microsoft.com/ubuntu/18.04/prod bionic/main amd64 dotnet-targeting-pack-3.1 amd64 3.1.0-1 [1,988 kB] | |
[33m | |
38% [6 dotnet-targeting-pack-3.1 16.0 kB/1,988 kB 1%][0m[33m | |
42% [Working][0m | |
Get:7 https://packages.microsoft.com/ubuntu/18.04/prod bionic/main amd64 aspnetcore-targeting-pack-3.1 amd64 3.1.3-1 [949 kB] | |
[33m | |
42% [7 aspnetcore-targeting-pack-3.1 16.0 kB/949 kB 2%][0m[33m | |
45% [Working][0m | |
Get:8 https://packages.microsoft.com/ubuntu/18.04/prod bionic/main amd64 dotnet-apphost-pack-3.1 amd64 3.1.5-1 [42.7 kB] | |
[33m | |
45% [8 dotnet-apphost-pack-3.1 16.0 kB/42.7 kB 38%][0m[33m | |
47% [Working][0m | |
Get:9 https://packages.microsoft.com/ubuntu/18.04/prod bionic/main amd64 netstandard-targeting-pack-2.1 amd64 2.1.0-1 [1,476 kB] | |
[33m | |
47% [9 netstandard-targeting-pack-2.1 16.0 kB/1,476 kB 1%][0m[33m | |
51% [Working][0m | |
Get:10 https://packages.microsoft.com/ubuntu/18.04/prod bionic/main amd64 dotnet-sdk-3.1 amd64 3.1.301-1 [46.6 MB] | |
[33m | |
51% [10 dotnet-sdk-3.1 16.0 kB/46.6 MB 0%][0m[33m | |
88% [10 dotnet-sdk-3.1 36.7 MB/46.6 MB 79%][0m[33m | |
100% [Working][0m | |
Fetched 78.7 MB in 1s (48.4 MB/s) | |
7[0;39r8[1ASelecting previously unselected package dotnet-host. | |
(Reading database ... | |
(Reading database ... 5% | |
(Reading database ... 10% | |
(Reading database ... 15% | |
(Reading database ... 20% | |
(Reading database ... 25% | |
(Reading database ... 30% | |
(Reading database ... 35% | |
(Reading database ... 40% | |
(Reading database ... 45% | |
(Reading database ... 50% | |
(Reading database ... 55% | |
(Reading database ... 60% | |
(Reading database ... 65% | |
(Reading database ... 70% | |
(Reading database ... 75% | |
(Reading database ... 80% | |
(Reading database ... 85% | |
(Reading database ... 90% | |
(Reading database ... 95% | |
(Reading database ... 100% | |
(Reading database ... 124368 files and directories currently installed.) | |
Preparing to unpack .../dotnet-host_3.1.5-1_amd64.deb ... | |
7[40;0f[42m[30mProgress: [ 0%][49m[39m [..........................................................] 87[40;0f[42m[30mProgress: [ 1%][49m[39m [##........................................................] 8Unpacking dotnet-host (3.1.5-1) ... | |
7[40;0f[42m[30mProgress: [ 3%][49m[39m [###.......................................................] 87[40;0f[42m[30mProgress: [ 5%][49m[39m [####......................................................] 8Selecting previously unselected package dotnet-hostfxr-3.1. | |
Preparing to unpack .../dotnet-hostfxr-3.1_3.1.5-1_amd64.deb ... | |
7[40;0f[42m[30mProgress: [ 7%][49m[39m [#####.....................................................] 8Unpacking dotnet-hostfxr-3.1 (3.1.5-1) ... | |
7[40;0f[42m[30mProgress: [ 9%][49m[39m [######....................................................] 87[40;0f[42m[30mProgress: [ 11%][49m[39m [#######...................................................] 8Selecting previously unselected package dotnet-runtime-deps-3.1. | |
Preparing to unpack .../dotnet-runtime-deps-3.1_3.1.5-1_amd64.deb ... | |
7[40;0f[42m[30mProgress: [ 13%][49m[39m [########..................................................] 8Unpacking dotnet-runtime-deps-3.1 (3.1.5-1) ... | |
7[40;0f[42m[30mProgress: [ 15%][49m[39m [##########................................................] 87[40;0f[42m[30mProgress: [ 17%][49m[39m [###########...............................................] 8Selecting previously unselected package dotnet-runtime-3.1. | |
Preparing to unpack .../dotnet-runtime-3.1_3.1.5-1_amd64.deb ... | |
7[40;0f[42m[30mProgress: [ 19%][49m[39m [############..............................................] 8Unpacking dotnet-runtime-3.1 (3.1.5-1) ... | |
7[40;0f[42m[30mProgress: [ 21%][49m[39m [#############.............................................] 87[40;0f[42m[30mProgress: [ 23%][49m[39m [##############............................................] 8Selecting previously unselected package aspnetcore-runtime-3.1. | |
Preparing to unpack .../aspnetcore-runtime-3.1_3.1.5-1_amd64.deb ... | |
7[40;0f[42m[30mProgress: [ 25%][49m[39m [###############...........................................] 8Unpacking aspnetcore-runtime-3.1 (3.1.5-1) ... | |
7[40;0f[42m[30mProgress: [ 27%][49m[39m [################..........................................] 87[40;0f[42m[30mProgress: [ 29%][49m[39m [##################........................................] 8Selecting previously unselected package dotnet-targeting-pack-3.1. | |
Preparing to unpack .../dotnet-targeting-pack-3.1_3.1.0-1_amd64.deb ... | |
7[40;0f[42m[30mProgress: [ 31%][49m[39m [###################.......................................] 8Unpacking dotnet-targeting-pack-3.1 (3.1.0-1) ... | |
7[40;0f[42m[30mProgress: [ 33%][49m[39m [####################......................................] 87[40;0f[42m[30mProgress: [ 35%][49m[39m [#####################.....................................] 8Selecting previously unselected package aspnetcore-targeting-pack-3.1. | |
Preparing to unpack .../aspnetcore-targeting-pack-3.1_3.1.3-1_amd64.deb ... | |
7[40;0f[42m[30mProgress: [ 37%][49m[39m [######################....................................] 8Unpacking aspnetcore-targeting-pack-3.1 (3.1.3-1) ... | |
7[40;0f[42m[30mProgress: [ 39%][49m[39m [#######################...................................] 87[40;0f[42m[30mProgress: [ 41%][49m[39m [########################..................................] 8Selecting previously unselected package dotnet-apphost-pack-3.1. | |
Preparing to unpack .../dotnet-apphost-pack-3.1_3.1.5-1_amd64.deb ... | |
7[40;0f[42m[30mProgress: [ 43%][49m[39m [##########################................................] 8Unpacking dotnet-apphost-pack-3.1 (3.1.5-1) ... | |
7[40;0f[42m[30mProgress: [ 45%][49m[39m [###########################...............................] 87[40;0f[42m[30mProgress: [ 47%][49m[39m [############################..............................] 8Selecting previously unselected package netstandard-targeting-pack-2.1. | |
Preparing to unpack .../netstandard-targeting-pack-2.1_2.1.0-1_amd64.deb ... | |
7[40;0f[42m[30mProgress: [ 49%][49m[39m [#############################.............................] 8Unpacking netstandard-targeting-pack-2.1 (2.1.0-1) ... | |
7[40;0f[42m[30mProgress: [ 50%][49m[39m [##############################............................] 87[40;0f[42m[30mProgress: [ 52%][49m[39m [###############################...........................] 8Selecting previously unselected package dotnet-sdk-3.1. | |
Preparing to unpack .../dotnet-sdk-3.1_3.1.301-1_amd64.deb ... | |
7[40;0f[42m[30mProgress: [ 54%][49m[39m [################################..........................] 8Unpacking dotnet-sdk-3.1 (3.1.301-1) ... | |
7[40;0f[42m[30mProgress: [ 56%][49m[39m [#################################.........................] 87[40;0f[42m[30mProgress: [ 58%][49m[39m [###################################.......................] 8Processing triggers for man-db (2.7.5-1) ... | |
Setting up dotnet-host (3.1.5-1) ... | |
7[40;0f[42m[30mProgress: [ 60%][49m[39m [####################################......................] 87[40;0f[42m[30mProgress: [ 62%][49m[39m [#####################################.....................] 8Setting up dotnet-hostfxr-3.1 (3.1.5-1) ... | |
7[40;0f[42m[30mProgress: [ 64%][49m[39m [######################################....................] 87[40;0f[42m[30mProgress: [ 66%][49m[39m [#######################################...................] 8Setting up dotnet-runtime-deps-3.1 (3.1.5-1) ... | |
7[40;0f[42m[30mProgress: [ 68%][49m[39m [########################################..................] 87[40;0f[42m[30mProgress: [ 70%][49m[39m [#########################################.................] 8Setting up dotnet-runtime-3.1 (3.1.5-1) ... | |
7[40;0f[42m[30mProgress: [ 72%][49m[39m [###########################################...............] 87[40;0f[42m[30mProgress: [ 74%][49m[39m [############################################..............] 8Setting up aspnetcore-runtime-3.1 (3.1.5-1) ... | |
7[40;0f[42m[30mProgress: [ 76%][49m[39m [#############################################.............] 87[40;0f[42m[30mProgress: [ 78%][49m[39m [##############################################............] 8Setting up dotnet-targeting-pack-3.1 (3.1.0-1) ... | |
7[40;0f[42m[30mProgress: [ 80%][49m[39m [###############################################...........] 87[40;0f[42m[30mProgress: [ 82%][49m[39m [################################################..........] 8Setting up aspnetcore-targeting-pack-3.1 (3.1.3-1) ... | |
7[40;0f[42m[30mProgress: [ 84%][49m[39m [#################################################.........] 87[40;0f[42m[30mProgress: [ 86%][49m[39m [###################################################.......] 8Setting up dotnet-apphost-pack-3.1 (3.1.5-1) ... | |
7[40;0f[42m[30mProgress: [ 88%][49m[39m [####################################################......] 87[40;0f[42m[30mProgress: [ 90%][49m[39m [#####################################################.....] 8Setting up netstandard-targeting-pack-2.1 (2.1.0-1) ... | |
7[40;0f[42m[30mProgress: [ 92%][49m[39m [######################################################....] 87[40;0f[42m[30mProgress: [ 94%][49m[39m [#######################################################...] 8Setting up dotnet-sdk-3.1 (3.1.301-1) ... | |
7[40;0f[42m[30mProgress: [ 96%][49m[39m [########################################################..] 8This software may collect information about you and your use of the software, and send that to Microsoft. | |
Please visit http://aka.ms/dotnet-cli-eula for more information. | |
Welcome to .NET Core! | |
--------------------- | |
Learn more about .NET Core: https://aka.ms/dotnet-docs | |
Use 'dotnet --help' to see available commands or visit: https://aka.ms/dotnet-cli-docs | |
Telemetry | |
--------- | |
The .NET Core tools collect usage data in order to help us improve your experience. The data is anonymous and doesn't include command-line arguments. The data is collected by Microsoft and shared with the community. You can opt-out of telemetry by setting the DOTNET_CLI_TELEMETRY_OPTOUT environment variable to '1' or 'true' using your favorite shell. | |
Read more about .NET Core CLI Tools telemetry: https://aka.ms/dotnet-cli-telemetry | |
Configuring... | |
-------------- | |
A command is running to populate your local package cache to improve restore speed and enable offline access. This command takes up to one minute to complete and only runs once. | |
7[40;0f[42m[30mProgress: [ 98%][49m[39m [#########################################################.] 8 | |
7[0;40r8[1A[Jtravis_time:end:00631de8:start=1591787226431277127,finish=1591787240348711819,duration=13917434692,event=before_install | |
[0Ktravis_fold:end:before_install.7 | |
[0Ktravis_fold:start:before_install.8 | |
[0Ktravis_time:start:07a6d874 | |
[0K$ sudo apt install python3.6 | |
Reading package lists... 0% | |
Reading package lists... 100% | |
Reading package lists... Done | |
Building dependency tree... 0% | |
Building dependency tree... 0% | |
Building dependency tree... 50% | |
Building dependency tree... 50% | |
Building dependency tree | |
Reading state information... 0% | |
Reading state information... 0% | |
Reading state information... Done | |
The following additional packages will be installed: | |
libpython3.6-minimal libpython3.6-stdlib python3.6-minimal | |
Suggested packages: | |
python3.6-venv python3.6-doc | |
The following NEW packages will be installed: | |
libpython3.6-minimal libpython3.6-stdlib python3.6 python3.6-minimal | |
0 upgraded, 4 newly installed, 0 to remove and 150 not upgraded. | |
Need to get 4,756 kB of archives. | |
After this operation, 24.3 MB of additional disk space will be used. | |
[33m | |
0% [Working][0m | |
Get:1 http://ppa.launchpad.net/deadsnakes/ppa/ubuntu xenial/main amd64 libpython3.6-minimal amd64 3.6.10-1+xenial1 [579 kB] | |
[33m | |
0% [1 libpython3.6-minimal 12.6 kB/579 kB 2%][0m[33m | |
9% [1 libpython3.6-minimal 533 kB/579 kB 92%][0m[33m | |
15% [Working][0m | |
Get:2 http://ppa.launchpad.net/deadsnakes/ppa/ubuntu xenial/main amd64 python3.6-minimal amd64 3.6.10-1+xenial1 [1,713 kB] | |
[33m | |
15% [2 python3.6-minimal 8,758 B/1,713 kB 1%][0m[33m | |
23% [2 python3.6-minimal 479 kB/1,713 kB 28%][0m[33m | |
49% [Working][0m | |
Get:3 http://ppa.launchpad.net/deadsnakes/ppa/ubuntu xenial/main amd64 libpython3.6-stdlib amd64 3.6.10-1+xenial1 [2,217 kB] | |
[33m | |
49% [3 libpython3.6-stdlib 11.3 kB/2,217 kB 1%][0m[33m | |
57% [3 libpython3.6-stdlib 505 kB/2,217 kB 23%][0m[33m | |
91% [Working][0m | |
Get:4 http://ppa.launchpad.net/deadsnakes/ppa/ubuntu xenial/main amd64 python3.6 amd64 3.6.10-1+xenial1 [246 kB] | |
[33m | |
91% [4 python3.6 12.6 kB/246 kB 5%][0m[33m | |
100% [Working][0m | |
Fetched 4,756 kB in 3s (1,553 kB/s) | |
7[0;39r8[1ASelecting previously unselected package libpython3.6-minimal:amd64. | |
(Reading database ... | |
(Reading database ... 5% | |
(Reading database ... 10% | |
(Reading database ... 15% | |
(Reading database ... 20% | |
(Reading database ... 25% | |
(Reading database ... 30% | |
(Reading database ... 35% | |
(Reading database ... 40% | |
(Reading database ... 45% | |
(Reading database ... 50% | |
(Reading database ... 55% | |
(Reading database ... 60% | |
(Reading database ... 65% | |
(Reading database ... 70% | |
(Reading database ... 75% | |
(Reading database ... 80% | |
(Reading database ... 85% | |
(Reading database ... 90% | |
(Reading database ... 95% | |
(Reading database ... 100% | |
(Reading database ... 127150 files and directories currently installed.) | |
Preparing to unpack .../libpython3.6-minimal_3.6.10-1+xenial1_amd64.deb ... | |
7[40;0f[42m[30mProgress: [ 0%][49m[39m [..........................................................] 87[40;0f[42m[30mProgress: [ 4%][49m[39m [###.......................................................] 8Unpacking libpython3.6-minimal:amd64 (3.6.10-1+xenial1) ... | |
7[40;0f[42m[30mProgress: [ 9%][49m[39m [######....................................................] 87[40;0f[42m[30mProgress: [ 14%][49m[39m [#########.................................................] 8Selecting previously unselected package python3.6-minimal. | |
Preparing to unpack .../python3.6-minimal_3.6.10-1+xenial1_amd64.deb ... | |
7[40;0f[42m[30mProgress: [ 19%][49m[39m [############..............................................] 8Unpacking python3.6-minimal (3.6.10-1+xenial1) ... | |
7[40;0f[42m[30mProgress: [ 23%][49m[39m [##############............................................] 87[40;0f[42m[30mProgress: [ 28%][49m[39m [#################.........................................] 8Selecting previously unselected package libpython3.6-stdlib:amd64. | |
Preparing to unpack .../libpython3.6-stdlib_3.6.10-1+xenial1_amd64.deb ... | |
7[40;0f[42m[30mProgress: [ 33%][49m[39m [####################......................................] 8Unpacking libpython3.6-stdlib:amd64 (3.6.10-1+xenial1) ... | |
7[40;0f[42m[30mProgress: [ 38%][49m[39m [#######################...................................] 87[40;0f[42m[30mProgress: [ 42%][49m[39m [#########################.................................] 8Selecting previously unselected package python3.6. | |
Preparing to unpack .../python3.6_3.6.10-1+xenial1_amd64.deb ... | |
7[40;0f[42m[30mProgress: [ 47%][49m[39m [############################..............................] 8Unpacking python3.6 (3.6.10-1+xenial1) ... | |
7[40;0f[42m[30mProgress: [ 52%][49m[39m [###############################...........................] 87[40;0f[42m[30mProgress: [ 57%][49m[39m [##################################........................] 8Processing triggers for man-db (2.7.5-1) ... | |
Processing triggers for mime-support (3.59ubuntu1) ... | |
Setting up libpython3.6-minimal:amd64 (3.6.10-1+xenial1) ... | |
7[40;0f[42m[30mProgress: [ 61%][49m[39m [####################################......................] 87[40;0f[42m[30mProgress: [ 66%][49m[39m [#######################################...................] 8Setting up python3.6-minimal (3.6.10-1+xenial1) ... | |
7[40;0f[42m[30mProgress: [ 71%][49m[39m [##########################################................] 87[40;0f[42m[30mProgress: [ 76%][49m[39m [#############################################.............] 8Setting up libpython3.6-stdlib:amd64 (3.6.10-1+xenial1) ... | |
7[40;0f[42m[30mProgress: [ 80%][49m[39m [###############################################...........] 87[40;0f[42m[30mProgress: [ 85%][49m[39m [##################################################........] 8Setting up python3.6 (3.6.10-1+xenial1) ... | |
7[40;0f[42m[30mProgress: [ 90%][49m[39m [#####################################################.....] 87[40;0f[42m[30mProgress: [ 95%][49m[39m [########################################################..] 8 | |
7[0;40r8[1A[Jtravis_time:end:07a6d874:start=1591787240353230999,finish=1591787248420467513,duration=8067236514,event=before_install | |
[0Ktravis_fold:end:before_install.8 | |
[0Ktravis_fold:start:before_install.9 | |
[0Ktravis_time:start:185733c0 | |
[0K$ sudo rm /usr/bin/python3 | |
travis_time:end:185733c0:start=1591787248425076455,finish=1591787248435128972,duration=10052517,event=before_install | |
[0Ktravis_fold:end:before_install.9 | |
[0Ktravis_fold:start:before_install.10 | |
[0Ktravis_time:start:1e69a3b6 | |
[0K$ sudo ln -s python3.6 /usr/bin/python3 | |
travis_time:end:1e69a3b6:start=1591787248439718706,finish=1591787248448696949,duration=8978243,event=before_install | |
[0Ktravis_fold:end:before_install.10 | |
[0Ktravis_fold:start:install.1 | |
[0Ktravis_time:start:18088845 | |
[0K$ bash .travis.install-maven.sh "3.3.9" "${HOME}/mvn-home" | |
+MVN_VERSION=3.3.9 | |
+MVN_INSTALL_DIR=/home/travis/mvn-home | |
+'[' '!' -f /home/travis/mvn-home/lib/maven-artifact-3.3.9.jar ']' | |
+echo 'Using cached Maven 3.3.9' | |
Using cached Maven 3.3.9 | |
+/home/travis/mvn-home/bin/mvn -version | |
Apache Maven 3.3.9 (bb52d8502b132ec0a5a3f4c09453c07478323dc5; 2015-11-10T16:41:47+00:00) | |
Maven home: /home/travis/mvn-home | |
Java version: 1.8.0_242, vendor: Private Build | |
Java home: /usr/lib/jvm/java-8-openjdk-amd64/jre | |
Default locale: en_US, platform encoding: UTF-8 | |
OS name: "linux", version: "4.15.0-1055-gcp", arch: "amd64", family: "unix" | |
travis_time:end:18088845:start=1591787248453411221,finish=1591787248672935962,duration=219524741,event=install | |
[0Ktravis_fold:end:install.1 | |
[0Ktravis_fold:start:install.2 | |
[0Ktravis_time:start:0612d119 | |
[0K$ export M2_HOME=${HOME}/mvn-home | |
travis_time:end:0612d119:start=1591787248678400698,finish=1591787248681391763,duration=2991065,event=install | |
[0Ktravis_fold:end:install.2 | |
[0Ktravis_fold:start:install.3 | |
[0Ktravis_time:start:09b954ea | |
[0K$ export PATH=${HOME}/mvn-home/bin:${PATH} | |
travis_time:end:09b954ea:start=1591787248685786989,finish=1591787248688661142,duration=2874153,event=install | |
[0Ktravis_fold:end:install.3 | |
[0Ktravis_fold:start:install.4 | |
[0Ktravis_time:start:187a7114 | |
[0K$ mvn -version | |
Apache Maven 3.3.9 (bb52d8502b132ec0a5a3f4c09453c07478323dc5; 2015-11-10T16:41:47+00:00) | |
Maven home: /home/travis/mvn-home | |
Java version: 1.8.0_242, vendor: Private Build | |
Java home: /usr/lib/jvm/java-8-openjdk-amd64/jre | |
Default locale: en_US, platform encoding: UTF-8 | |
OS name: "linux", version: "4.15.0-1055-gcp", arch: "amd64", family: "unix" | |
travis_time:end:187a7114:start=1591787248692805256,finish=1591787248848508933,duration=155703677,event=install | |
[0Ktravis_fold:end:install.4 | |
[0Ktravis_fold:start:install.5 | |
[0Ktravis_time:start:0509fa33 | |
[0K$ python2 --version | |
Python 2.7.12 | |
travis_time:end:0509fa33:start=1591787248853402516,finish=1591787248895082174,duration=41679658,event=install | |
[0Ktravis_fold:end:install.5 | |
[0Ktravis_fold:start:install.6 | |
[0Ktravis_time:start:399ed3a2 | |
[0K$ python3 --version | |
Python 3.6.10 | |
travis_time:end:399ed3a2:start=1591787248899838327,finish=1591787248935127129,duration=35288802,event=install | |
[0Ktravis_fold:end:install.6 | |
[0Ktravis_time:start:1443953d | |
[0K$ touch gremlin-dotnet/src/.glv && touch gremlin-dotnet/test/.glv && mvn clean install -q -DskipTests && mvn verify -pl :gremlin-dotnet,:gremlin-dotnet-tests -P gremlin-dotnet | |
[ERROR] Error fetching link: /home/travis/build/apache/tinkerpop/gremlin-shaded/target/apidocs/package-list. Ignored it. | |
Welcome to .NET Core 3.1! | |
--------------------- | |
SDK Version: 3.1.301 | |
Telemetry | |
--------- | |
The .NET Core tools collect usage data in order to help us improve your experience. The data is anonymous. It is collected by Microsoft and shared with the community. You can opt-out of telemetry by setting the DOTNET_CLI_TELEMETRY_OPTOUT environment variable to '1' or 'true' using your favorite shell. | |
Read more about .NET Core CLI Tools telemetry: https://aka.ms/dotnet-cli-telemetry | |
---------------- | |
Explore documentation: https://aka.ms/dotnet-docs | |
Report issues and find source on GitHub: https://github.com/dotnet/core | |
Find out what's new: https://aka.ms/dotnet-whats-new | |
Learn about the installed HTTPS developer cert: https://aka.ms/aspnet-core-https | |
Use 'dotnet --help' to see available commands or visit: https://aka.ms/dotnet-cli-docs | |
Write your first app: https://aka.ms/first-net-core-app | |
-------------------------------------------------------------------------------------- | |
[?1h=[?1h=[?1h= Determining projects to restore... | |
[?1h= Restored /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Gremlin.Net.csproj (in 2.22 sec). | |
Restored /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net.Template/Gremlin.Net.Template.csproj (in 2.22 sec). | |
[?1h=[?1h=[?1h=[?1h= Determining projects to restore... | |
[?1h= All projects are up-to-date for restore. | |
[?1h=[?1h=[?1h=[?1h= Determining projects to restore... | |
[?1h= All projects are up-to-date for restore. | |
[?1h=[?1h=[?1h=Microsoft (R) Build Engine version 16.6.0+5ff7b0c9e for .NET Core | |
Copyright (C) Microsoft Corporation. All rights reserved. | |
[?1h= Determining projects to restore... | |
[?1h= All projects are up-to-date for restore. | |
Gremlin.Net -> /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/bin/Release/netstandard2.0/Gremlin.Net.dll | |
Gremlin.Net.Template -> /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net.Template/bin/Release/netcoreapp3.1/Gremlin.Net.Template.dll | |
[39;49m[32m | |
Build succeeded. | |
[39;49m 0 Warning(s) | |
[39;49m 0 Error(s) | |
[39;49m | |
Time Elapsed 00:00:03.13 | |
[?1h=[?1h=[?1h=[?1h= Determining projects to restore... | |
[?1h= All projects are up-to-date for restore. | |
[?1h=[?1h=[?1h=Microsoft (R) Build Engine version 16.6.0+5ff7b0c9e for .NET Core | |
Copyright (C) Microsoft Corporation. All rights reserved. | |
[?1h= Determining projects to restore... | |
[?1h= All projects are up-to-date for restore. | |
Gremlin.Net -> /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/bin/Release/netstandard2.0/Gremlin.Net.dll | |
[39;49m[32m | |
Build succeeded. | |
[39;49m 0 Warning(s) | |
[39;49m 0 Error(s) | |
[39;49m | |
Time Elapsed 00:00:00.99 | |
[?1h=[?1h=[?1h=Microsoft (R) Build Engine version 16.6.0+5ff7b0c9e for .NET Core | |
Copyright (C) Microsoft Corporation. All rights reserved. | |
[?1h= Determining projects to restore... | |
[?1h= All projects are up-to-date for restore. | |
Gremlin.Net -> /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/bin/Release/netstandard2.0/Gremlin.Net.dll | |
Gremlin.Net.Template -> /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net.Template/bin/Release/netcoreapp3.1/Gremlin.Net.Template.dll | |
Successfully created package '/home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net.Template/bin/Gremlin.Net.Template.1.0.0.nupkg'. | |
[39;49m[33m/usr/share/dotnet/sdk/3.1.301/Sdks/NuGet.Build.Tasks.Pack/build/NuGet.Build.Tasks.Pack.targets(198,5): warning NU5104: A stable release of a package should not have a prerelease dependency. Either modify the version spec of dependency "Gremlin.Net [3.5.0-SNAPSHOT, )" or update the version field in the nuspec. [/home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net.Template/Gremlin.Net.Template.csproj] | |
[39;49m[?1h=[?1h=[?1h=Microsoft (R) Build Engine version 16.6.0+5ff7b0c9e for .NET Core | |
Copyright (C) Microsoft Corporation. All rights reserved. | |
[?1h= Determining projects to restore... | |
[?1h= All projects are up-to-date for restore. | |
Gremlin.Net -> /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/bin/Release/netstandard2.0/Gremlin.Net.dll | |
Successfully created package '/home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/bin/Gremlin.Net.3.5.0-SNAPSHOT.nupkg'. | |
[?1h=[INFO] Scanning for projects... | |
[WARNING] | |
[WARNING] Some problems were encountered while building the effective model for org.apache.tinkerpop:hadoop-gremlin:jar:3.5.0-SNAPSHOT | |
[WARNING] 'dependencies.dependency.(groupId:artifactId:type:classifier)' must be unique: org.apache.commons:commons-compress:jar -> duplicate declaration of version 1.19 @ org.apache.tinkerpop:hadoop-gremlin:[unknown-version], /home/travis/build/apache/tinkerpop/hadoop-gremlin/pom.xml, line 162, column 21 | |
[WARNING] | |
[WARNING] It is highly recommended to fix these problems because they threaten the stability of your build. | |
[WARNING] | |
[WARNING] For this reason, future Maven versions might no longer support building such malformed projects. | |
[WARNING] | |
[INFO] ------------------------------------------------------------------------ | |
[INFO] Reactor Build Order: | |
[INFO] | |
[INFO] Apache TinkerPop :: Gremlin.Net | |
[INFO] Apache TinkerPop :: Gremlin.Net - Tests | |
[INFO] | |
[INFO] ------------------------------------------------------------------------ | |
[INFO] Building Apache TinkerPop :: Gremlin.Net 3.5.0-SNAPSHOT | |
[INFO] ------------------------------------------------------------------------ | |
[INFO] | |
[INFO] --- maven-enforcer-plugin:1.4.1:enforce (enforce-maven-version) @ gremlin-dotnet --- | |
[INFO] | |
[INFO] --- maven-enforcer-plugin:1.4.1:enforce (enforce-all) @ gremlin-dotnet --- | |
[INFO] | |
[INFO] --- build-helper-maven-plugin:3.0.0:regex-property (build-helper-regex-is-snapshot-used) @ gremlin-dotnet --- | |
[INFO] | |
[INFO] --- build-helper-maven-plugin:3.0.0:regex-property (build-helper-regex-is-prerelease-version) @ gremlin-dotnet --- | |
[INFO] | |
[INFO] --- build-helper-maven-plugin:3.0.0:parse-version (parse-version) @ gremlin-dotnet --- | |
[INFO] | |
[INFO] --- apache-rat-plugin:0.13:check (rat-checks) @ gremlin-dotnet --- | |
[INFO] Added 1 additional default licenses. | |
[INFO] Enabled default license matchers. | |
[INFO] Will parse SCM ignores for exclusions... | |
[INFO] Finished adding exclusions from SCM ignore files. | |
[INFO] 62 implicit excludes (use -debug for more details). | |
[INFO] 55 explicit excludes (use -debug for more details). | |
[INFO] 263 resources included (use -debug for more details) | |
[INFO] Rat check: Summary over all files. Unapproved: 0, unknown: 0, generated: 0, approved: 256 licenses. | |
[INFO] | |
[INFO] --- buildnumber-maven-plugin:1.4:create (default) @ gremlin-dotnet --- | |
[INFO] Executing: /bin/sh -c cd '/home/travis/build/apache/tinkerpop/gremlin-dotnet' && 'git' 'rev-parse' '--verify' 'HEAD' | |
[INFO] Working directory: /home/travis/build/apache/tinkerpop/gremlin-dotnet | |
[INFO] Storing buildNumber: 30c8cdff25a55c5d9dac2f356f67400ab1afa931 at timestamp: 1591787698882 | |
[WARNING] Cannot get the branch information from the git repository: | |
Detecting the current branch failed: fatal: ref HEAD is not a symbolic ref | |
[INFO] Executing: /bin/sh -c cd '/home/travis/build/apache/tinkerpop/gremlin-dotnet' && 'git' 'rev-parse' '--verify' 'HEAD' | |
[INFO] Working directory: /home/travis/build/apache/tinkerpop/gremlin-dotnet | |
[INFO] Storing buildScmBranch: UNKNOWN | |
[INFO] | |
[INFO] --- gmavenplus-plugin:1.9.0:execute (generate-dsl) @ gremlin-dotnet --- | |
[INFO] Using plugin classloader, includes GMavenPlus classpath. | |
[INFO] Using Groovy 3.0.3 to perform execute. | |
[INFO] Running Groovy script from /home/travis/build/apache/tinkerpop/gremlin-dotnet/glv/generate.groovy. | |
[INFO] | |
[INFO] --- maven-remote-resources-plugin:1.5:process (process-resource-bundles) @ gremlin-dotnet --- | |
[INFO] | |
[INFO] --- maven-source-plugin:3.0.1:jar-no-fork (attach-sources) @ gremlin-dotnet --- | |
[INFO] | |
[INFO] --- maven-javadoc-plugin:2.10.4:jar (attach-javadoc) @ gremlin-dotnet --- | |
[INFO] Not executing Javadoc as the project is not a Java classpath-capable package | |
[INFO] | |
[INFO] --- maven-site-plugin:3.7.1:attach-descriptor (attach-descriptor) @ gremlin-dotnet --- | |
[INFO] No site descriptor found: nothing to attach. | |
[INFO] | |
[INFO] ------------------------------------------------------------------------ | |
[INFO] Building Apache TinkerPop :: Gremlin.Net - Tests 3.5.0-SNAPSHOT | |
[INFO] ------------------------------------------------------------------------ | |
[INFO] | |
[INFO] --- dotnet-maven-plugin:0.24:restore (default-restore) @ gremlin-dotnet-tests --- | |
[INFO] Command (in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.UnitTest) [dotnet, restore] running | |
[?1h=[?1h=[?1h= Determining projects to restore... | |
[?1h= Restored /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.UnitTest/Gremlin.Net.UnitTest.csproj (in 6.75 sec). | |
1 of 2 projects are up-to-date for restore. | |
[?1h=[INFO] Command (in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.Template.IntegrationTest) [dotnet, restore] running | |
[?1h=[?1h=[?1h= Determining projects to restore... | |
[?1h= Restored /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.Template.IntegrationTest/Gremlin.Net.Template.IntegrationTest.csproj (in 2.15 sec). | |
Restored /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.Template.IntegrationTest/Gremlin.Net.Template.IntegrationTest.csproj (in 3.52 sec). | |
2 of 4 projects are up-to-date for restore. | |
[?1h=[INFO] Command (in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest) [dotnet, restore] running | |
[?1h=[?1h=[?1h= Determining projects to restore... | |
[?1h= Restored /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gremlin.Net.IntegrationTest.csproj (in 1.26 sec). | |
1 of 2 projects are up-to-date for restore. | |
[?1h=[INFO] | |
[INFO] --- maven-enforcer-plugin:1.4.1:enforce (enforce-maven-version) @ gremlin-dotnet-tests --- | |
[INFO] | |
[INFO] --- maven-enforcer-plugin:1.4.1:enforce (enforce-all) @ gremlin-dotnet-tests --- | |
[INFO] | |
[INFO] --- build-helper-maven-plugin:3.0.0:regex-property (build-helper-regex-is-snapshot-used) @ gremlin-dotnet-tests --- | |
[INFO] | |
[INFO] --- build-helper-maven-plugin:3.0.0:regex-property (build-helper-regex-is-prerelease-version) @ gremlin-dotnet-tests --- | |
[INFO] | |
[INFO] --- build-helper-maven-plugin:3.0.0:parse-version (parse-version) @ gremlin-dotnet-tests --- | |
[INFO] | |
[INFO] --- apache-rat-plugin:0.13:check (rat-checks) @ gremlin-dotnet-tests --- | |
[INFO] Added 1 additional default licenses. | |
[INFO] Enabled default license matchers. | |
[INFO] Will parse SCM ignores for exclusions... | |
[INFO] Finished adding exclusions from SCM ignore files. | |
[INFO] 62 implicit excludes (use -debug for more details). | |
[INFO] 55 explicit excludes (use -debug for more details). | |
[INFO] 73 resources included (use -debug for more details) | |
[INFO] Rat check: Summary over all files. Unapproved: 0, unknown: 0, generated: 0, approved: 73 licenses. | |
[INFO] | |
[INFO] --- buildnumber-maven-plugin:1.4:create (default) @ gremlin-dotnet-tests --- | |
[INFO] Executing: /bin/sh -c cd '/home/travis/build/apache/tinkerpop/gremlin-dotnet/test' && 'git' 'rev-parse' '--verify' 'HEAD' | |
[INFO] Working directory: /home/travis/build/apache/tinkerpop/gremlin-dotnet/test | |
[INFO] Storing buildNumber: 30c8cdff25a55c5d9dac2f356f67400ab1afa931 at timestamp: 1591787722816 | |
[WARNING] Cannot get the branch information from the git repository: | |
Detecting the current branch failed: fatal: ref HEAD is not a symbolic ref | |
[INFO] Executing: /bin/sh -c cd '/home/travis/build/apache/tinkerpop/gremlin-dotnet/test' && 'git' 'rev-parse' '--verify' 'HEAD' | |
[INFO] Working directory: /home/travis/build/apache/tinkerpop/gremlin-dotnet/test | |
[INFO] Storing buildScmBranch: UNKNOWN | |
[INFO] | |
[INFO] --- maven-remote-resources-plugin:1.5:process (process-resource-bundles) @ gremlin-dotnet-tests --- | |
[INFO] | |
[INFO] --- dotnet-maven-plugin:0.24:build (default-build) @ gremlin-dotnet-tests --- | |
[INFO] Command (in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.UnitTest) [dotnet, restore] running | |
[?1h=[?1h=[?1h= Determining projects to restore... | |
[?1h= All projects are up-to-date for restore. | |
[?1h=[INFO] Command (in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.UnitTest) [dotnet, build, -c, Release] running | |
[?1h=[?1h=Microsoft (R) Build Engine version 16.6.0+5ff7b0c9e for .NET Core | |
Copyright (C) Microsoft Corporation. All rights reserved. | |
[?1h= Determining projects to restore... | |
[?1h= All projects are up-to-date for restore. | |
Gremlin.Net -> /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/bin/Release/netstandard2.0/Gremlin.Net.dll | |
Gremlin.Net.UnitTest -> /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.UnitTest/bin/Release/netcoreapp3.1/Gremlin.Net.UnitTest.dll | |
[39;49m[32m | |
Build succeeded. | |
[39;49m 0 Warning(s) | |
[39;49m 0 Error(s) | |
[39;49m | |
Time Elapsed 00:00:02.74 | |
[?1h=[INFO] Command (in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.Template.IntegrationTest) [dotnet, restore] running | |
[?1h=[?1h=[?1h= Determining projects to restore... | |
[?1h= All projects are up-to-date for restore. | |
[?1h=[INFO] Command (in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.Template.IntegrationTest) [dotnet, build, -c, Release] running | |
[?1h=[?1h=Microsoft (R) Build Engine version 16.6.0+5ff7b0c9e for .NET Core | |
Copyright (C) Microsoft Corporation. All rights reserved. | |
[?1h= Determining projects to restore... | |
[?1h= All projects are up-to-date for restore. | |
Gremlin.Net -> /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/bin/Release/netstandard2.0/Gremlin.Net.dll | |
Gremlin.Net.Template -> /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net.Template/bin/Release/netcoreapp3.1/Gremlin.Net.Template.dll | |
Gremlin.Net.Template.IntegrationTest -> /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.Template.IntegrationTest/bin/Release/netcoreapp3.1/Gremlin.Net.Template.IntegrationTest.dll | |
[39;49m[32m | |
Build succeeded. | |
[39;49m 0 Warning(s) | |
[39;49m 0 Error(s) | |
[39;49m | |
Time Elapsed 00:00:03.35 | |
[?1h=[INFO] Command (in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest) [dotnet, restore] running | |
[?1h=[?1h=[?1h= Determining projects to restore... | |
[?1h= All projects are up-to-date for restore. | |
[?1h=[INFO] Command (in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest) [dotnet, build, -c, Release] running | |
[?1h=[?1h=Microsoft (R) Build Engine version 16.6.0+5ff7b0c9e for .NET Core | |
Copyright (C) Microsoft Corporation. All rights reserved. | |
[?1h= Determining projects to restore... | |
[?1h= All projects are up-to-date for restore. | |
Gremlin.Net -> /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/bin/Release/netstandard2.0/Gremlin.Net.dll | |
[39;49m[33mDriver/GremlinClientTests.cs(300,34): warning CS0168: The variable 'ignored' is declared but never used [/home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gremlin.Net.IntegrationTest.csproj] | |
[39;49m Gremlin.Net.IntegrationTest -> /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/bin/Release/netcoreapp3.1/Gremlin.Net.IntegrationTest.dll | |
[39;49m[32m | |
Build succeeded. | |
[39;49m | |
[39;49m[33mDriver/GremlinClientTests.cs(300,34): warning CS0168: The variable 'ignored' is declared but never used [/home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gremlin.Net.IntegrationTest.csproj] | |
[39;49m[39;49m[33m 1 Warning(s) | |
[39;49m 0 Error(s) | |
[39;49m | |
Time Elapsed 00:00:02.03 | |
[?1h=[INFO] | |
[INFO] --- maven-source-plugin:3.0.1:jar-no-fork (attach-sources) @ gremlin-dotnet-tests --- | |
[INFO] Building jar: /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/target/gremlin-dotnet-tests-3.5.0-SNAPSHOT-sources.jar | |
[INFO] | |
[INFO] --- maven-javadoc-plugin:2.10.4:jar (attach-javadoc) @ gremlin-dotnet-tests --- | |
[INFO] Not executing Javadoc as the project is not a Java classpath-capable package | |
[INFO] | |
[INFO] --- maven-site-plugin:3.7.1:attach-descriptor (attach-descriptor) @ gremlin-dotnet-tests --- | |
[INFO] Skipping because packaging 'dotnet-integration-test' is not pom. | |
[INFO] | |
[INFO] --- gmavenplus-plugin:1.9.0:execute (gremlin-server-start) @ gremlin-dotnet-tests --- | |
[INFO] Using plugin classloader, includes GMavenPlus classpath. | |
[INFO] Using Groovy 3.0.3 to perform execute. | |
[INFO] Running Groovy script from /home/travis/build/apache/tinkerpop/gremlin-server/src/test/scripts/test-server-start.groovy. | |
[INFO] Starting Gremlin Server instances for native testing of Apache TinkerPop :: Gremlin.Net - Tests | |
[INFO] Configured Metrics Slf4jReporter configured with interval=180000ms and loggerName=org.apache.tinkerpop.gremlin.server.Settings$Slf4jReporterMetrics | |
[INFO] Graph [graph] was successfully configured via [/home/travis/build/apache/tinkerpop/gremlin-server/src/test/scripts/tinkergraph-empty.properties]. | |
[INFO] Graph [classic] was successfully configured via [/home/travis/build/apache/tinkerpop/gremlin-server/src/test/scripts/tinkergraph-empty.properties]. | |
[INFO] Graph [modern] was successfully configured via [/home/travis/build/apache/tinkerpop/gremlin-server/src/test/scripts/tinkergraph-empty.properties]. | |
[INFO] Graph [crew] was successfully configured via [/home/travis/build/apache/tinkerpop/gremlin-server/src/test/scripts/tinkergraph-empty.properties]. | |
[INFO] Graph [grateful] was successfully configured via [/home/travis/build/apache/tinkerpop/gremlin-server/src/test/scripts/tinkergraph-empty.properties]. | |
[INFO] Graph [sink] was successfully configured via [/home/travis/build/apache/tinkerpop/gremlin-server/src/test/scripts/tinkergraph-empty.properties]. | |
[INFO] Initialized Gremlin thread pool. Threads in pool named with pattern gremlin-* | |
[INFO] Initialized GremlinExecutor and preparing GremlinScriptEngines instances. | |
[INFO] Initialized gremlin-groovy GremlinScriptEngine and registered metrics | |
[INFO] A GraphTraversalSource is now bound to [ggraph] with graphtraversalsource[tinkergraph[vertices:0 edges:0], standard] | |
[INFO] A GraphTraversalSource is now bound to [g] with graphtraversalsource[tinkergraph[vertices:0 edges:0], standard] | |
[INFO] A GraphTraversalSource is now bound to [gmodern] with graphtraversalsource[tinkergraph[vertices:0 edges:0], standard] | |
[INFO] A GraphTraversalSource is now bound to [gclassic] with graphtraversalsource[tinkergraph[vertices:0 edges:0], standard] | |
[INFO] A GraphTraversalSource is now bound to [gcrew] with graphtraversalsource[tinkergraph[vertices:0 edges:0], standard] | |
[INFO] A GraphTraversalSource is now bound to [gsink] with graphtraversalsource[tinkergraph[vertices:0 edges:0], standard] | |
[INFO] A GraphTraversalSource is now bound to [ggrateful] with graphtraversalsource[tinkergraph[vertices:0 edges:0], standard] | |
[INFO] Adding the standard OpProcessor. | |
[INFO] Adding the session OpProcessor. | |
[INFO] Adding the traversal OpProcessor. | |
[INFO] Executing start up LifeCycleHook | |
[INFO] idleConnectionTimeout was set to 0 which resolves to 0 seconds when configuring this value - this feature will be disabled | |
[INFO] keepAliveInterval was set to 0 which resolves to 0 seconds when configuring this value - this feature will be disabled | |
[WARNING] The org.apache.tinkerpop.gremlin.driver.ser.GryoMessageSerializerV1d0 serialization class is deprecated. | |
[INFO] Configured application/vnd.gremlin-v1.0+gryo with org.apache.tinkerpop.gremlin.driver.ser.GryoMessageSerializerV1d0 | |
[WARNING] The org.apache.tinkerpop.gremlin.driver.ser.GryoMessageSerializerV3d0 serialization class is deprecated. | |
[INFO] Configured application/vnd.gremlin-v3.0+gryo with org.apache.tinkerpop.gremlin.driver.ser.GryoMessageSerializerV3d0 | |
[WARNING] The org.apache.tinkerpop.gremlin.driver.ser.GryoLiteMessageSerializerV1d0 serialization class is deprecated. | |
[INFO] Configured application/vnd.gremlin-v1.0+gryo-lite with org.apache.tinkerpop.gremlin.driver.ser.GryoLiteMessageSerializerV1d0 | |
[WARNING] The org.apache.tinkerpop.gremlin.driver.ser.GryoMessageSerializerV1d0 serialization class is deprecated. | |
[INFO] Configured application/vnd.gremlin-v1.0+gryo-stringd with org.apache.tinkerpop.gremlin.driver.ser.GryoMessageSerializerV1d0 | |
[WARNING] The org.apache.tinkerpop.gremlin.driver.ser.GryoMessageSerializerV3d0 serialization class is deprecated. | |
[INFO] Configured application/vnd.gremlin-v3.0+gryo-stringd with org.apache.tinkerpop.gremlin.driver.ser.GryoMessageSerializerV3d0 | |
[INFO] Configured application/vnd.gremlin-v3.0+json with org.apache.tinkerpop.gremlin.driver.ser.GraphSONMessageSerializerV3d0 | |
[INFO] Configured application/json with org.apache.tinkerpop.gremlin.driver.ser.GraphSONMessageSerializerV3d0 | |
[INFO] Configured application/vnd.gremlin-v2.0+json with org.apache.tinkerpop.gremlin.driver.ser.GraphSONMessageSerializerV2d0 | |
[INFO] application/json already has org.apache.tinkerpop.gremlin.driver.ser.GraphSONMessageSerializerV3d0 configured - it will not be replaced by org.apache.tinkerpop.gremlin.driver.ser.GraphSONMessageSerializerV2d0, change order of serialization configuration if this is not desired. | |
[INFO] Configured application/vnd.gremlin-v1.0+json with org.apache.tinkerpop.gremlin.driver.ser.GraphSONMessageSerializerGremlinV1d0 | |
[INFO] Configured application/vnd.graphbinary-v1.0 with org.apache.tinkerpop.gremlin.driver.ser.GraphBinaryMessageSerializerV1 | |
[INFO] Configured application/vnd.graphbinary-v1.0-stringd with org.apache.tinkerpop.gremlin.driver.ser.GraphBinaryMessageSerializerV1 | |
[INFO] Gremlin Server configured with worker thread pool of 1, gremlin pool of 2 and boss thread pool of 1. | |
[INFO] Channel started at port 45940. | |
[INFO] Gremlin Server with no authentication started on port 45940 | |
[INFO] Graph [graph] was successfully configured via [/home/travis/build/apache/tinkerpop/gremlin-server/src/test/scripts/tinkergraph-empty.properties]. | |
[INFO] Graph [classic] was successfully configured via [/home/travis/build/apache/tinkerpop/gremlin-server/src/test/scripts/tinkergraph-empty.properties]. | |
[INFO] Graph [modern] was successfully configured via [/home/travis/build/apache/tinkerpop/gremlin-server/src/test/scripts/tinkergraph-empty.properties]. | |
[INFO] Graph [crew] was successfully configured via [/home/travis/build/apache/tinkerpop/gremlin-server/src/test/scripts/tinkergraph-empty.properties]. | |
[INFO] Graph [grateful] was successfully configured via [/home/travis/build/apache/tinkerpop/gremlin-server/src/test/scripts/tinkergraph-empty.properties]. | |
[INFO] Graph [sink] was successfully configured via [/home/travis/build/apache/tinkerpop/gremlin-server/src/test/scripts/tinkergraph-empty.properties]. | |
[INFO] Initialized Gremlin thread pool. Threads in pool named with pattern gremlin-* | |
[INFO] Initialized GremlinExecutor and preparing GremlinScriptEngines instances. | |
[INFO] Initialized gremlin-groovy GremlinScriptEngine and registered metrics | |
[INFO] A GraphTraversalSource is now bound to [ggraph] with graphtraversalsource[tinkergraph[vertices:0 edges:0], standard] | |
[INFO] A GraphTraversalSource is now bound to [g] with graphtraversalsource[tinkergraph[vertices:0 edges:0], standard] | |
[INFO] A GraphTraversalSource is now bound to [gmodern] with graphtraversalsource[tinkergraph[vertices:0 edges:0], standard] | |
[INFO] A GraphTraversalSource is now bound to [gclassic] with graphtraversalsource[tinkergraph[vertices:0 edges:0], standard] | |
[INFO] A GraphTraversalSource is now bound to [gcrew] with graphtraversalsource[tinkergraph[vertices:0 edges:0], standard] | |
[INFO] A GraphTraversalSource is now bound to [gsink] with graphtraversalsource[tinkergraph[vertices:0 edges:0], standard] | |
[INFO] A GraphTraversalSource is now bound to [ggrateful] with graphtraversalsource[tinkergraph[vertices:0 edges:0], standard] | |
[INFO] Executing start up LifeCycleHook | |
[INFO] idleConnectionTimeout was set to 0 which resolves to 0 seconds when configuring this value - this feature will be disabled | |
[INFO] keepAliveInterval was set to 0 which resolves to 0 seconds when configuring this value - this feature will be disabled | |
[WARNING] The org.apache.tinkerpop.gremlin.driver.ser.GryoMessageSerializerV1d0 serialization class is deprecated. | |
[INFO] Configured application/vnd.gremlin-v1.0+gryo with org.apache.tinkerpop.gremlin.driver.ser.GryoMessageSerializerV1d0 | |
[WARNING] The org.apache.tinkerpop.gremlin.driver.ser.GryoMessageSerializerV3d0 serialization class is deprecated. | |
[INFO] Configured application/vnd.gremlin-v3.0+gryo with org.apache.tinkerpop.gremlin.driver.ser.GryoMessageSerializerV3d0 | |
[WARNING] The org.apache.tinkerpop.gremlin.driver.ser.GryoLiteMessageSerializerV1d0 serialization class is deprecated. | |
[INFO] Configured application/vnd.gremlin-v1.0+gryo-lite with org.apache.tinkerpop.gremlin.driver.ser.GryoLiteMessageSerializerV1d0 | |
[WARNING] The org.apache.tinkerpop.gremlin.driver.ser.GryoMessageSerializerV1d0 serialization class is deprecated. | |
[INFO] Configured application/vnd.gremlin-v1.0+gryo-stringd with org.apache.tinkerpop.gremlin.driver.ser.GryoMessageSerializerV1d0 | |
[WARNING] The org.apache.tinkerpop.gremlin.driver.ser.GryoMessageSerializerV3d0 serialization class is deprecated. | |
[INFO] Configured application/vnd.gremlin-v3.0+gryo-stringd with org.apache.tinkerpop.gremlin.driver.ser.GryoMessageSerializerV3d0 | |
[INFO] Configured application/vnd.gremlin-v3.0+json with org.apache.tinkerpop.gremlin.driver.ser.GraphSONMessageSerializerV3d0 | |
[INFO] Configured application/json with org.apache.tinkerpop.gremlin.driver.ser.GraphSONMessageSerializerV3d0 | |
[INFO] Configured application/vnd.gremlin-v2.0+json with org.apache.tinkerpop.gremlin.driver.ser.GraphSONMessageSerializerV2d0 | |
[INFO] application/json already has org.apache.tinkerpop.gremlin.driver.ser.GraphSONMessageSerializerV3d0 configured - it will not be replaced by org.apache.tinkerpop.gremlin.driver.ser.GraphSONMessageSerializerV2d0, change order of serialization configuration if this is not desired. | |
[INFO] Configured application/vnd.gremlin-v1.0+json with org.apache.tinkerpop.gremlin.driver.ser.GraphSONMessageSerializerGremlinV1d0 | |
[INFO] Configured application/vnd.graphbinary-v1.0 with org.apache.tinkerpop.gremlin.driver.ser.GraphBinaryMessageSerializerV1 | |
[INFO] Configured application/vnd.graphbinary-v1.0-stringd with org.apache.tinkerpop.gremlin.driver.ser.GraphBinaryMessageSerializerV1 | |
[INFO] Initializing authentication with the org.apache.tinkerpop.gremlin.server.auth.SimpleAuthenticator | |
[INFO] CredentialGraph initialized at credentialtraversalsource[tinkergraph[vertices:1 edges:0], standard] | |
[INFO] Gremlin Server configured with worker thread pool of 1, gremlin pool of 2 and boss thread pool of 1. | |
[INFO] Channel started at port 45941. | |
[INFO] Gremlin Server with authentication started on port 45941 | |
[INFO] | |
[INFO] --- dotnet-maven-plugin:0.24:integration-test-run (default-integration-test-run) @ gremlin-dotnet-tests --- | |
[INFO] Command (in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.UnitTest) [dotnet, test, -c, Release] running | |
[?1h=[?1h=[?1h=[?1h=Test run for /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.UnitTest/bin/Release/netcoreapp3.1/Gremlin.Net.UnitTest.dll(.NETCoreApp,Version=v3.1) | |
Microsoft (R) Test Execution Command Line Tool Version 16.6.0 | |
Copyright (c) Microsoft Corporation. All rights reserved. | |
Starting test execution, please wait... | |
A total of 1 test files matched the specified pattern. | |
[39;49m[32mTest Run Successful. | |
[39;49m[39;49mTotal tests: 312 | |
[39;49m[39;49m[32m Passed: 312 | |
[39;49m[39;49m Total time: 3.3515 Seconds | |
[39;49m[?1h=[?1h=[INFO] Command (in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.Template.IntegrationTest) [dotnet, test, -c, Release] running | |
[?1h=[?1h=[?1h=[?1h=[?1h=[?1h=[?1h=Test run for /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.Template.IntegrationTest/bin/Release/netcoreapp3.1/Gremlin.Net.Template.IntegrationTest.dll(.NETCoreApp,Version=v3.1) | |
Microsoft (R) Test Execution Command Line Tool Version 16.6.0 | |
Copyright (c) Microsoft Corporation. All rights reserved. | |
Starting test execution, please wait... | |
A total of 1 test files matched the specified pattern. | |
[39;49m[32mTest Run Successful. | |
[39;49m[39;49mTotal tests: 1 | |
[39;49m[39;49m[32m Passed: 1 | |
[39;49m[39;49m Total time: 2.5205 Seconds | |
[39;49m[?1h=[INFO] Command (in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest) [dotnet, test, -c, Release] running | |
[?1h=[?1h=[?1h=[?1h=Test run for /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/bin/Release/netcoreapp3.1/Gremlin.Net.IntegrationTest.dll(.NETCoreApp,Version=v3.1) | |
Microsoft (R) Test Execution Command Line Tool Version 16.6.0 | |
Copyright (c) Microsoft Corporation. All rights reserved. | |
Starting test execution, please wait... | |
A total of 1 test files matched the specified pattern. | |
[39;49m[33m[xUnit.net 00:00:00.5936994] Gremlin.Net.IntegrationTest.Docs.Reference.GremlinVariantsTests.SubmittingScriptsTest [SKIP] | |
[39;49m[39;49m[33m[xUnit.net 00:00:00.6002726] Gremlin.Net.IntegrationTest.Docs.Reference.IntroTests.BasicGremlinAddsTest [SKIP] | |
[39;49m[39;49m[33m[xUnit.net 00:00:00.6120886] Gremlin.Net.IntegrationTest.Docs.Reference.IntroTests.TraversalSourceCreationTest [SKIP] | |
[39;49m[39;49m[33m[xUnit.net 00:00:00.6129883] Gremlin.Net.IntegrationTest.Docs.Reference.GremlinVariantsTests.SubmittingScriptsWithAuthenticationTest [SKIP] | |
[39;49m[39;49m[33m[xUnit.net 00:00:00.6132823] Gremlin.Net.IntegrationTest.Docs.Reference.GremlinVariantsTests.SerializationTest [SKIP] | |
[39;49m[39;49m[33m[xUnit.net 00:00:00.6134800] Gremlin.Net.IntegrationTest.Docs.Reference.GremlinVariantsTests.TraversalStrategiesTest [SKIP] | |
[39;49m[39;49m[33m[xUnit.net 00:00:00.6136600] Gremlin.Net.IntegrationTest.Docs.Reference.GremlinVariantsTests.ConnectingTest [SKIP] | |
[39;49m[INFO] New session established for 47e0e4e6-2ae9-4df7-8064-7b5e2746a10b | |
[39;49m[33m ! [39;49mGremlin.Net.IntegrationTest.Docs.Reference.GremlinVariantsTests.SubmittingScriptsTest [1ms] | |
[39;49m[33m ! [39;49mGremlin.Net.IntegrationTest.Docs.Reference.IntroTests.BasicGremlinAddsTest [1ms] | |
[39;49m[33m ! [39;49mGremlin.Net.IntegrationTest.Docs.Reference.IntroTests.TraversalSourceCreationTest [1ms] | |
[39;49m[33m ! [39;49mGremlin.Net.IntegrationTest.Docs.Reference.GremlinVariantsTests.SubmittingScriptsWithAuthenticationTest [1ms] | |
[39;49m[33m ! [39;49mGremlin.Net.IntegrationTest.Docs.Reference.GremlinVariantsTests.SerializationTest [1ms] | |
[39;49m[33m ! [39;49mGremlin.Net.IntegrationTest.Docs.Reference.GremlinVariantsTests.TraversalStrategiesTest [1ms] | |
[39;49m[33m ! [39;49mGremlin.Net.IntegrationTest.Docs.Reference.GremlinVariantsTests.ConnectingTest [1ms] | |
[39;49m[33m[xUnit.net 00:00:01.6758079] Gremlin.Net.IntegrationTest.Docs.Reference.GremlinApplicationsDslTests.DslTest [SKIP] | |
[39;49m[39;49m[33m[xUnit.net 00:00:01.8180371] Gremlin.Net.IntegrationTest.Docs.Dev.Provider.IndexTests.SupportingGremlinNetIOTests [SKIP] | |
[39;49m[39;49m[33m[xUnit.net 00:00:01.8184660] Gremlin.Net.IntegrationTest.Docs.Reference.GremlinApplicationsTests.ConnectingViaDriversTest [SKIP] | |
[39;49m[39;49m[33m ! [39;49mGremlin.Net.IntegrationTest.Docs.Reference.GremlinApplicationsDslTests.DslTest [1ms] | |
[39;49m[33m ! [39;49mGremlin.Net.IntegrationTest.Docs.Dev.Provider.IndexTests.SupportingGremlinNetIOTests [1ms] | |
[39;49m[33m ! [39;49mGremlin.Net.IntegrationTest.Docs.Reference.GremlinApplicationsTests.ConnectingViaDriversTest [1ms] | |
[WARNING] Exception processing a script on request [RequestMessage{, requestId=00765d18-e39c-4219-a252-871a87bafea3, op='eval', processor='', args={gremlin=1, language=unknown}}]. | |
java.lang.IllegalArgumentException: unknown is not an available GremlinScriptEngine | |
at org.apache.tinkerpop.gremlin.jsr223.CachedGremlinScriptEngineManager.registerLookUpInfo(CachedGremlinScriptEngineManager.java:95) | |
at org.apache.tinkerpop.gremlin.jsr223.CachedGremlinScriptEngineManager.getEngineByName(CachedGremlinScriptEngineManager.java:58) | |
at org.apache.tinkerpop.gremlin.groovy.engine.GremlinExecutor.lambda$eval$0(GremlinExecutor.java:267) | |
at java.util.concurrent.FutureTask.run(FutureTask.java:266) | |
at java.util.concurrent.Executors$RunnableAdapter.call(Executors.java:511) | |
at java.util.concurrent.FutureTask.run(FutureTask.java:266) | |
at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149) | |
at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) | |
at java.lang.Thread.run(Thread.java:748) | |
Starting Gherkin-based tests | |
[WARNING] Exception processing a Traversal on iteration for request [713c6096-1996-46a1-8e35-4a6e827969b3]. | |
org.apache.tinkerpop.gremlin.process.traversal.strategy.verification.VerificationException: The provided traversal has a mutating step and thus is not read only: AddVertexStartStep({label=[person]}) | |
at org.apache.tinkerpop.gremlin.process.traversal.strategy.verification.ReadOnlyStrategy.apply(ReadOnlyStrategy.java:52) | |
at org.apache.tinkerpop.gremlin.process.traversal.util.TraversalHelper.applyTraversalRecursively(TraversalHelper.java:467) | |
at org.apache.tinkerpop.gremlin.process.traversal.util.DefaultTraversal.applyStrategies(DefaultTraversal.java:144) | |
at org.apache.tinkerpop.gremlin.server.op.traversal.TraversalOpProcessor.lambda$iterateBytecodeTraversal$0(TraversalOpProcessor.java:203) | |
at java.util.concurrent.FutureTask.run(FutureTask.java:266) | |
at java.util.concurrent.Executors$RunnableAdapter.call(Executors.java:511) | |
at java.util.concurrent.FutureTask.run(FutureTask.java:266) | |
at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149) | |
at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) | |
at java.lang.Thread.run(Thread.java:748) | |
[ERROR] Could not deserialize the Traversal instance | |
java.lang.IllegalStateException: Could not locate method: DefaultGraphTraversal.this_step_does_not_exist([test]) | |
at org.apache.tinkerpop.gremlin.jsr223.JavaTranslator.invokeMethod(JavaTranslator.java:203) | |
at org.apache.tinkerpop.gremlin.jsr223.JavaTranslator.translate(JavaTranslator.java:87) | |
at org.apache.tinkerpop.gremlin.server.op.traversal.TraversalOpProcessor.iterateBytecodeTraversal(TraversalOpProcessor.java:177) | |
at org.apache.tinkerpop.gremlin.server.handler.OpExecutorHandler.channelRead0(OpExecutorHandler.java:67) | |
at org.apache.tinkerpop.gremlin.server.handler.OpExecutorHandler.channelRead0(OpExecutorHandler.java:43) | |
at io.netty.channel.SimpleChannelInboundHandler.channelRead(SimpleChannelInboundHandler.java:99) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.channel.ChannelInboundHandlerAdapter.channelRead(ChannelInboundHandlerAdapter.java:93) | |
at io.netty.handler.codec.http.websocketx.Utf8FrameValidator.channelRead(Utf8FrameValidator.java:82) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.ByteToMessageDecoder.fireChannelRead(ByteToMessageDecoder.java:324) | |
at io.netty.handler.codec.ByteToMessageDecoder.channelRead(ByteToMessageDecoder.java:296) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.timeout.IdleStateHandler.channelRead(IdleStateHandler.java:286) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.channel.DefaultChannelPipeline$HeadContext.channelRead(DefaultChannelPipeline.java:1410) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.DefaultChannelPipeline.fireChannelRead(DefaultChannelPipeline.java:919) | |
at io.netty.channel.nio.AbstractNioByteChannel$NioByteUnsafe.read(AbstractNioByteChannel.java:163) | |
at io.netty.channel.nio.NioEventLoop.processSelectedKey(NioEventLoop.java:714) | |
at io.netty.channel.nio.NioEventLoop.processSelectedKeysOptimized(NioEventLoop.java:650) | |
at io.netty.channel.nio.NioEventLoop.processSelectedKeys(NioEventLoop.java:576) | |
at io.netty.channel.nio.NioEventLoop.run(NioEventLoop.java:493) | |
at io.netty.util.concurrent.SingleThreadEventExecutor$4.run(SingleThreadEventExecutor.java:989) | |
at io.netty.util.internal.ThreadExecutorMap$2.run(ThreadExecutorMap.java:74) | |
at java.lang.Thread.run(Thread.java:748) | |
[WARNING] Could not deserialize the Traversal instance | |
org.apache.tinkerpop.gremlin.server.op.OpProcessorException: Could not deserialize the Traversal instance | |
at org.apache.tinkerpop.gremlin.server.op.traversal.TraversalOpProcessor.iterateBytecodeTraversal(TraversalOpProcessor.java:191) | |
at org.apache.tinkerpop.gremlin.server.handler.OpExecutorHandler.channelRead0(OpExecutorHandler.java:67) | |
at org.apache.tinkerpop.gremlin.server.handler.OpExecutorHandler.channelRead0(OpExecutorHandler.java:43) | |
at io.netty.channel.SimpleChannelInboundHandler.channelRead(SimpleChannelInboundHandler.java:99) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.channel.ChannelInboundHandlerAdapter.channelRead(ChannelInboundHandlerAdapter.java:93) | |
at io.netty.handler.codec.http.websocketx.Utf8FrameValidator.channelRead(Utf8FrameValidator.java:82) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.ByteToMessageDecoder.fireChannelRead(ByteToMessageDecoder.java:324) | |
at io.netty.handler.codec.ByteToMessageDecoder.channelRead(ByteToMessageDecoder.java:296) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.timeout.IdleStateHandler.channelRead(IdleStateHandler.java:286) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.channel.DefaultChannelPipeline$HeadContext.channelRead(DefaultChannelPipeline.java:1410) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.DefaultChannelPipeline.fireChannelRead(DefaultChannelPipeline.java:919) | |
at io.netty.channel.nio.AbstractNioByteChannel$NioByteUnsafe.read(AbstractNioByteChannel.java:163) | |
at io.netty.channel.nio.NioEventLoop.processSelectedKey(NioEventLoop.java:714) | |
at io.netty.channel.nio.NioEventLoop.processSelectedKeysOptimized(NioEventLoop.java:650) | |
at io.netty.channel.nio.NioEventLoop.processSelectedKeys(NioEventLoop.java:576) | |
at io.netty.channel.nio.NioEventLoop.run(NioEventLoop.java:493) | |
at io.netty.util.concurrent.SingleThreadEventExecutor$4.run(SingleThreadEventExecutor.java:989) | |
at io.netty.util.internal.ThreadExecutorMap$2.run(ThreadExecutorMap.java:74) | |
at java.lang.Thread.run(Thread.java:748) | |
[INFO] Skipped attempt to close open graph transactions on 47e0e4e6-2ae9-4df7-8064-7b5e2746a10b - close was forced | |
[INFO] Session 47e0e4e6-2ae9-4df7-8064-7b5e2746a10b closed | |
[INFO] New session established for 47e0e4e6-2ae9-4df7-8064-7b5e2746a10b | |
[WARNING] Exception processing a script on request [RequestMessage{, requestId=6fd76e3a-7608-4d92-aa25-d78e53a18024, op='eval', processor='session', args={gremlin=x, session=47e0e4e6-2ae9-4df7-8064-7b5e2746a10b}}]. | |
groovy.lang.MissingPropertyException: No such property: x for class: Script15 | |
at org.codehaus.groovy.runtime.ScriptBytecodeAdapter.unwrap(ScriptBytecodeAdapter.java:65) | |
at org.codehaus.groovy.runtime.callsite.PogoGetPropertySite.getProperty(PogoGetPropertySite.java:51) | |
at org.codehaus.groovy.runtime.callsite.AbstractCallSite.callGroovyObjectGetProperty(AbstractCallSite.java:341) | |
at Script15.run(Script15.groovy:1) | |
at org.apache.tinkerpop.gremlin.groovy.jsr223.GremlinGroovyScriptEngine.eval(GremlinGroovyScriptEngine.java:675) | |
at org.apache.tinkerpop.gremlin.groovy.jsr223.GremlinGroovyScriptEngine.eval(GremlinGroovyScriptEngine.java:377) | |
at javax.script.AbstractScriptEngine.eval(AbstractScriptEngine.java:233) | |
at org.apache.tinkerpop.gremlin.groovy.engine.GremlinExecutor.lambda$eval$0(GremlinExecutor.java:267) | |
at java.util.concurrent.FutureTask.run(FutureTask.java:266) | |
at java.util.concurrent.Executors$RunnableAdapter.call(Executors.java:511) | |
at java.util.concurrent.FutureTask.run(FutureTask.java:266) | |
at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149) | |
at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) | |
at java.lang.Thread.run(Thread.java:748) | |
[INFO] Skipped attempt to close open graph transactions on 47e0e4e6-2ae9-4df7-8064-7b5e2746a10b - close was forced | |
[INFO] Session 47e0e4e6-2ae9-4df7-8064-7b5e2746a10b closed | |
[WARNING] Script evaluation exceeded the configured threshold for request [RequestMessage{, requestId=25037bf4-a853-4ef2-9ed4-505a2331e024, op='eval', processor='', args={gremlin=Thread.sleep(5000);, evaluationTimeout=1}}] | |
java.util.concurrent.TimeoutException: Evaluation exceeded the configured 'evaluationTimeout' threshold of 1 ms or evaluation was otherwise cancelled directly for request [Thread.sleep(5000);] | |
at org.apache.tinkerpop.gremlin.groovy.engine.GremlinExecutor.lambda$eval$1(GremlinExecutor.java:316) | |
at io.netty.util.concurrent.PromiseTask.runTask(PromiseTask.java:98) | |
at io.netty.util.concurrent.ScheduledFutureTask.run(ScheduledFutureTask.java:170) | |
at io.netty.util.concurrent.AbstractEventExecutor.safeExecute(AbstractEventExecutor.java:164) | |
at io.netty.util.concurrent.SingleThreadEventExecutor.runAllTasks(SingleThreadEventExecutor.java:472) | |
at io.netty.channel.nio.NioEventLoop.run(NioEventLoop.java:500) | |
at io.netty.util.concurrent.SingleThreadEventExecutor$4.run(SingleThreadEventExecutor.java:989) | |
at io.netty.util.internal.ThreadExecutorMap$2.run(ThreadExecutorMap.java:74) | |
at java.lang.Thread.run(Thread.java:748) | |
[WARNING] Message could not be parsed. Check the format of the request. [RequestMessage{, requestId=307b61ee-ab64-4fe6-a2e5-de0e69c7d6fc, op='invalid', processor='', args={}}] | |
org.apache.tinkerpop.gremlin.server.op.OpProcessorException: Message could not be parsed. Check the format of the request. [RequestMessage{, requestId=307b61ee-ab64-4fe6-a2e5-de0e69c7d6fc, op='invalid', processor='', args={}}] | |
at org.apache.tinkerpop.gremlin.server.op.AbstractEvalOpProcessor.select(AbstractEvalOpProcessor.java:150) | |
at org.apache.tinkerpop.gremlin.server.handler.OpSelectorHandler.decode(OpSelectorHandler.java:79) | |
at org.apache.tinkerpop.gremlin.server.handler.OpSelectorHandler.decode(OpSelectorHandler.java:48) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:88) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.channel.ChannelInboundHandlerAdapter.channelRead(ChannelInboundHandlerAdapter.java:93) | |
at io.netty.handler.codec.http.websocketx.Utf8FrameValidator.channelRead(Utf8FrameValidator.java:82) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.ByteToMessageDecoder.fireChannelRead(ByteToMessageDecoder.java:324) | |
at io.netty.handler.codec.ByteToMessageDecoder.channelRead(ByteToMessageDecoder.java:296) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.timeout.IdleStateHandler.channelRead(IdleStateHandler.java:286) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.channel.DefaultChannelPipeline$HeadContext.channelRead(DefaultChannelPipeline.java:1410) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.DefaultChannelPipeline.fireChannelRead(DefaultChannelPipeline.java:919) | |
at io.netty.channel.nio.AbstractNioByteChannel$NioByteUnsafe.read(AbstractNioByteChannel.java:163) | |
at io.netty.channel.nio.NioEventLoop.processSelectedKey(NioEventLoop.java:714) | |
at io.netty.channel.nio.NioEventLoop.processSelectedKeysOptimized(NioEventLoop.java:650) | |
at io.netty.channel.nio.NioEventLoop.processSelectedKeys(NioEventLoop.java:576) | |
at io.netty.channel.nio.NioEventLoop.run(NioEventLoop.java:493) | |
at io.netty.util.concurrent.SingleThreadEventExecutor$4.run(SingleThreadEventExecutor.java:989) | |
at io.netty.util.internal.ThreadExecutorMap$2.run(ThreadExecutorMap.java:74) | |
at java.lang.Thread.run(Thread.java:748) | |
[WARNING] Invalid OpProcessor requested [invalid] | |
org.apache.tinkerpop.gremlin.server.op.OpProcessorException: Invalid OpProcessor requested [invalid] | |
at org.apache.tinkerpop.gremlin.server.handler.OpSelectorHandler.decode(OpSelectorHandler.java:85) | |
at org.apache.tinkerpop.gremlin.server.handler.OpSelectorHandler.decode(OpSelectorHandler.java:48) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:88) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.MessageToMessageDecoder.channelRead(MessageToMessageDecoder.java:103) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.channel.ChannelInboundHandlerAdapter.channelRead(ChannelInboundHandlerAdapter.java:93) | |
at io.netty.handler.codec.http.websocketx.Utf8FrameValidator.channelRead(Utf8FrameValidator.java:82) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.codec.ByteToMessageDecoder.fireChannelRead(ByteToMessageDecoder.java:324) | |
at io.netty.handler.codec.ByteToMessageDecoder.channelRead(ByteToMessageDecoder.java:296) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.handler.timeout.IdleStateHandler.channelRead(IdleStateHandler.java:286) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.AbstractChannelHandlerContext.fireChannelRead(AbstractChannelHandlerContext.java:357) | |
at io.netty.channel.DefaultChannelPipeline$HeadContext.channelRead(DefaultChannelPipeline.java:1410) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:379) | |
at io.netty.channel.AbstractChannelHandlerContext.invokeChannelRead(AbstractChannelHandlerContext.java:365) | |
at io.netty.channel.DefaultChannelPipeline.fireChannelRead(DefaultChannelPipeline.java:919) | |
at io.netty.channel.nio.AbstractNioByteChannel$NioByteUnsafe.read(AbstractNioByteChannel.java:163) | |
at io.netty.channel.nio.NioEventLoop.processSelectedKey(NioEventLoop.java:714) | |
at io.netty.channel.nio.NioEventLoop.processSelectedKeysOptimized(NioEventLoop.java:650) | |
at io.netty.channel.nio.NioEventLoop.processSelectedKeys(NioEventLoop.java:576) | |
at io.netty.channel.nio.NioEventLoop.run(NioEventLoop.java:493) | |
at io.netty.util.concurrent.SingleThreadEventExecutor$4.run(SingleThreadEventExecutor.java:989) | |
at io.netty.util.internal.ThreadExecutorMap$2.run(ThreadExecutorMap.java:74) | |
at java.lang.Thread.run(Thread.java:748) | |
[WARNING] Exception processing a script on request [RequestMessage{, requestId=a794927a-d4e9-4e1e-aab6-ede2eb71f64c, op='eval', processor='', args={gremlin=invalid}}]. | |
groovy.lang.MissingPropertyException: No such property: invalid for class: Script20 | |
at org.codehaus.groovy.runtime.ScriptBytecodeAdapter.unwrap(ScriptBytecodeAdapter.java:65) | |
at org.codehaus.groovy.runtime.callsite.PogoGetPropertySite.getProperty(PogoGetPropertySite.java:51) | |
at org.codehaus.groovy.runtime.callsite.AbstractCallSite.callGroovyObjectGetProperty(AbstractCallSite.java:341) | |
at Script20.run(Script20.groovy:1) | |
at org.apache.tinkerpop.gremlin.groovy.jsr223.GremlinGroovyScriptEngine.eval(GremlinGroovyScriptEngine.java:675) | |
at org.apache.tinkerpop.gremlin.groovy.jsr223.GremlinGroovyScriptEngine.eval(GremlinGroovyScriptEngine.java:377) | |
at javax.script.AbstractScriptEngine.eval(AbstractScriptEngine.java:233) | |
at org.apache.tinkerpop.gremlin.groovy.engine.GremlinExecutor.lambda$eval$0(GremlinExecutor.java:267) | |
at java.util.concurrent.FutureTask.run(FutureTask.java:266) | |
at java.util.concurrent.Executors$RunnableAdapter.call(Executors.java:511) | |
at java.util.concurrent.FutureTask.run(FutureTask.java:266) | |
at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149) | |
at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) | |
at java.lang.Thread.run(Thread.java:748) | |
[WARNING] Exception processing a script on request [RequestMessage{, requestId=563df8da-f818-47be-a0ce-b3d7cde44697, op='eval', processor='', args={gremlin=invalid}}]. | |
groovy.lang.MissingPropertyException: No such property: invalid for class: Script20 | |
at org.codehaus.groovy.runtime.ScriptBytecodeAdapter.unwrap(ScriptBytecodeAdapter.java:65) | |
at org.codehaus.groovy.runtime.callsite.PogoGetPropertySite.getProperty(PogoGetPropertySite.java:51) | |
at org.codehaus.groovy.runtime.callsite.AbstractCallSite.callGroovyObjectGetProperty(AbstractCallSite.java:341) | |
at Script20.run(Script20.groovy:1) | |
at org.apache.tinkerpop.gremlin.groovy.jsr223.GremlinGroovyScriptEngine.eval(GremlinGroovyScriptEngine.java:675) | |
at org.apache.tinkerpop.gremlin.groovy.jsr223.GremlinGroovyScriptEngine.eval(GremlinGroovyScriptEngine.java:377) | |
at javax.script.AbstractScriptEngine.eval(AbstractScriptEngine.java:233) | |
at org.apache.tinkerpop.gremlin.groovy.engine.GremlinExecutor.lambda$eval$0(GremlinExecutor.java:267) | |
at java.util.concurrent.FutureTask.run(FutureTask.java:266) | |
at java.util.concurrent.Executors$RunnableAdapter.call(Executors.java:511) | |
at java.util.concurrent.FutureTask.run(FutureTask.java:266) | |
at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149) | |
at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) | |
at java.lang.Thread.run(Thread.java:748) | |
[WARNING] Exception processing a Traversal on iteration for request [51d7e12a-6c86-4031-b909-e4df9a039947]. | |
java.lang.IllegalStateException: The property does not exist as the key has no associated value for the provided element: v[465]:name | |
at org.apache.tinkerpop.gremlin.structure.Property$Exceptions.propertyDoesNotExist(Property.java:151) | |
at org.apache.tinkerpop.gremlin.structure.Element.lambda$value$1(Element.java:94) | |
at org.apache.tinkerpop.gremlin.structure.Property.orElseThrow(Property.java:101) | |
at org.apache.tinkerpop.gremlin.structure.Element.value(Element.java:94) | |
at org.apache.tinkerpop.gremlin.structure.Element$value.call(Unknown Source) | |
at Script11$_run_closure1.doCall(Script11.groovy:1) | |
at sun.reflect.GeneratedMethodAccessor100.invoke(Unknown Source) | |
at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) | |
at java.lang.reflect.Method.invoke(Method.java:498) | |
at org.codehaus.groovy.reflection.CachedMethod.invoke(CachedMethod.java:107) | |
at groovy.lang.MetaMethod.doMethodInvoke(MetaMethod.java:323) | |
at org.codehaus.groovy.runtime.metaclass.ClosureMetaClass.invokeMethod(ClosureMetaClass.java:263) | |
at groovy.lang.MetaClassImpl.invokeMethod(MetaClassImpl.java:1029) | |
at groovy.lang.Closure.call(Closure.java:412) | |
at org.codehaus.groovy.runtime.ConvertedClosure.invokeCustom(ConvertedClosure.java:50) | |
at org.codehaus.groovy.runtime.ConversionHandler.invoke(ConversionHandler.java:110) | |
at com.sun.proxy.$Proxy51.apply(Unknown Source) | |
at org.apache.tinkerpop.gremlin.process.traversal.lambda.FunctionTraverser.apply(FunctionTraverser.java:39) | |
at org.apache.tinkerpop.gremlin.process.traversal.lambda.FunctionTraverser.apply(FunctionTraverser.java:29) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.map.LambdaMapStep.map(LambdaMapStep.java:42) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.map.ScalarMapStep.processNextStart(ScalarMapStep.java:40) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.util.AbstractStep.next(AbstractStep.java:129) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.util.AbstractStep.next(AbstractStep.java:39) | |
at org.apache.tinkerpop.gremlin.process.traversal.util.DefaultTraversal.next(DefaultTraversal.java:225) | |
at org.apache.tinkerpop.gremlin.process.traversal.util.TraversalUtil.apply(TraversalUtil.java:44) | |
at org.apache.tinkerpop.gremlin.process.traversal.util.TraversalUtil.applyNullable(TraversalUtil.java:87) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.map.GroupStep.projectTraverser(GroupStep.java:131) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.map.GroupStep.projectTraverser(GroupStep.java:49) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.util.ReducingBarrierStep.processAllStarts(ReducingBarrierStep.java:83) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.util.ReducingBarrierStep.processNextStart(ReducingBarrierStep.java:112) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.util.AbstractStep.hasNext(AbstractStep.java:144) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.util.ExpandableStepIterator.next(ExpandableStepIterator.java:50) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.map.ScalarMapStep.processNextStart(ScalarMapStep.java:39) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.util.AbstractStep.hasNext(AbstractStep.java:144) | |
at org.apache.tinkerpop.gremlin.process.traversal.util.DefaultTraversal.hasNext(DefaultTraversal.java:217) | |
at org.apache.tinkerpop.gremlin.server.util.TraverserIterator.fillBulker(TraverserIterator.java:69) | |
at org.apache.tinkerpop.gremlin.server.util.TraverserIterator.hasNext(TraverserIterator.java:56) | |
at org.apache.tinkerpop.gremlin.server.op.traversal.TraversalOpProcessor.handleIterator(TraversalOpProcessor.java:266) | |
at org.apache.tinkerpop.gremlin.server.op.traversal.TraversalOpProcessor.lambda$iterateBytecodeTraversal$0(TraversalOpProcessor.java:204) | |
at java.util.concurrent.FutureTask.run(FutureTask.java:266) | |
at java.util.concurrent.Executors$RunnableAdapter.call(Executors.java:511) | |
at java.util.concurrent.FutureTask.run(FutureTask.java:266) | |
at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149) | |
at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) | |
at java.lang.Thread.run(Thread.java:748) | |
[WARNING] Exception processing a Traversal on iteration for request [553edf3f-a32a-4206-9e2c-a02b13adca41]. | |
java.lang.IllegalStateException: The property does not exist as the key has no associated value for the provided element: v[468]:name | |
at org.apache.tinkerpop.gremlin.structure.Property$Exceptions.propertyDoesNotExist(Property.java:151) | |
at org.apache.tinkerpop.gremlin.structure.Element.lambda$value$1(Element.java:94) | |
at org.apache.tinkerpop.gremlin.structure.Property.orElseThrow(Property.java:101) | |
at org.apache.tinkerpop.gremlin.structure.Element.value(Element.java:94) | |
at org.apache.tinkerpop.gremlin.structure.Element$value.call(Unknown Source) | |
at Script11$_run_closure1.doCall(Script11.groovy:1) | |
at sun.reflect.GeneratedMethodAccessor100.invoke(Unknown Source) | |
at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) | |
at java.lang.reflect.Method.invoke(Method.java:498) | |
at org.codehaus.groovy.reflection.CachedMethod.invoke(CachedMethod.java:107) | |
at groovy.lang.MetaMethod.doMethodInvoke(MetaMethod.java:323) | |
at org.codehaus.groovy.runtime.metaclass.ClosureMetaClass.invokeMethod(ClosureMetaClass.java:263) | |
at groovy.lang.MetaClassImpl.invokeMethod(MetaClassImpl.java:1029) | |
at groovy.lang.Closure.call(Closure.java:412) | |
at org.codehaus.groovy.runtime.ConvertedClosure.invokeCustom(ConvertedClosure.java:50) | |
at org.codehaus.groovy.runtime.ConversionHandler.invoke(ConversionHandler.java:110) | |
at com.sun.proxy.$Proxy51.apply(Unknown Source) | |
at org.apache.tinkerpop.gremlin.process.traversal.lambda.FunctionTraverser.apply(FunctionTraverser.java:39) | |
at org.apache.tinkerpop.gremlin.process.traversal.lambda.FunctionTraverser.apply(FunctionTraverser.java:29) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.map.LambdaMapStep.map(LambdaMapStep.java:42) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.map.ScalarMapStep.processNextStart(ScalarMapStep.java:40) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.util.AbstractStep.next(AbstractStep.java:129) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.util.AbstractStep.next(AbstractStep.java:39) | |
at org.apache.tinkerpop.gremlin.process.traversal.util.DefaultTraversal.next(DefaultTraversal.java:225) | |
at org.apache.tinkerpop.gremlin.process.traversal.util.TraversalUtil.apply(TraversalUtil.java:44) | |
at org.apache.tinkerpop.gremlin.process.traversal.util.TraversalUtil.applyNullable(TraversalUtil.java:87) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.map.GroupStep.projectTraverser(GroupStep.java:131) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.map.GroupStep.projectTraverser(GroupStep.java:49) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.util.ReducingBarrierStep.processAllStarts(ReducingBarrierStep.java:83) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.util.ReducingBarrierStep.processNextStart(ReducingBarrierStep.java:112) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.util.AbstractStep.hasNext(AbstractStep.java:144) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.util.ExpandableStepIterator.next(ExpandableStepIterator.java:50) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.map.ScalarMapStep.processNextStart(ScalarMapStep.java:39) | |
at org.apache.tinkerpop.gremlin.process.traversal.step.util.AbstractStep.hasNext(AbstractStep.java:144) | |
at org.apache.tinkerpop.gremlin.process.traversal.util.DefaultTraversal.hasNext(DefaultTraversal.java:217) | |
at org.apache.tinkerpop.gremlin.server.util.TraverserIterator.fillBulker(TraverserIterator.java:69) | |
at org.apache.tinkerpop.gremlin.server.util.TraverserIterator.hasNext(TraverserIterator.java:56) | |
at org.apache.tinkerpop.gremlin.server.op.traversal.TraversalOpProcessor.handleIterator(TraversalOpProcessor.java:266) | |
at org.apache.tinkerpop.gremlin.server.op.traversal.TraversalOpProcessor.lambda$iterateBytecodeTraversal$0(TraversalOpProcessor.java:204) | |
at java.util.concurrent.FutureTask.run(FutureTask.java:266) | |
at java.util.concurrent.Executors$RunnableAdapter.call(Executors.java:511) | |
at java.util.concurrent.FutureTask.run(FutureTask.java:266) | |
at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1149) | |
at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:624) | |
at java.lang.Thread.run(Thread.java:748) | |
Gherkin tests result | |
Scenario: g_V_asXaX_flatMapXselectXaXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_name_order | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_name_order_byXa1_b1X_byXb2_a2X | |
Given the modern graph | |
And using the parameter l1 defined as "c[a, b -> a.substring(1, 2).compareTo(b.substring(1, 2))]" | |
And using the parameter l2 defined as "c[a, b -> b.substring(2, 3).compareTo(a.substring(2, 3))]" | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_order_byXname_ascX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_order_byXnameX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_outE_order_byXweight_descX_weight | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_order_byXname_a1_b1X_byXname_b2_a2X_name | |
Given the modern graph | |
And using the parameter l1 defined as "c[a, b -> a.substring(1, 2).compareTo(b.substring(1, 2))]" | |
And using the parameter l2 defined as "c[a, b -> b.substring(2, 3).compareTo(a.substring(2, 3))]" | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_asXaX_outXcreatedX_asXbX_order_byXshuffleX_selectXa_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_both_hasLabelXpersonX_order_byXage_descX_limitX5X_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_properties_order_byXkey_descX_key | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_hasLabelXpersonX_order_byXvalueXageX_descX_name | |
Given the modern graph | |
And using the parameter l1 defined as "c[it.value('age')]" | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_hasLabelXpersonX_group_byXnameX_byXoutE_weight_sumX_orderXlocalX_byXvaluesX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_mapXbothE_weight_foldX_order_byXsumXlocalX_descX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_group_byXlabelX_byXname_order_byXdescX_foldX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_hasLabelXpersonX_group_byXnameX_byXoutE_weight_sumX_unfold_order_byXvalues_descX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_asXvX_mapXbothE_weight_foldX_sumXlocalX_asXsX_selectXv_sX_order_byXselectXsX_descX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_hasLabelXpersonX_fold_orderXlocalX_byXageX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_both_hasLabelXpersonX_order_byXage_descX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_order_byXoutE_count_descX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_hasLabelXpersonX_order_byXageX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_VX1X_hasXlabel_personX_mapXmapXint_ageXX_orderXlocalX_byXvalues_descX_byXkeys_ascX | |
Given the modern graph | |
And using the parameter v1 defined as "v[marko]" | |
And using the parameter l1 defined as "c[['1':it.get().value('age'),'2':it.get().value('age')*2,'3':it.get().value('age')*3,'4':it.get().value('age')]]" | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_hasXsong_name_OHBOYX_outXfollowedByX_outXfollowedByX_order_byXperformancesX_byXsongType_descX | |
Given an unsupported test | |
Then nothing should happen because | |
Scenario: g_V_hasLabelXsongX_order_byXperformances_descX_byXnameX_rangeX110_120X_name | |
Given an unsupported test | |
Then nothing should happen because | |
Scenario: g_VX1X_elementMap_orderXlocalX_byXkeys_descXunfold | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: get_g_VX1X_asXaX_outXknowsX_asXbX_selectXa_bX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_asXaX_outXknowsX_asXbX_selectXa_bX_byXnameX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_asXaX_outXknowsX_asXbX_selectXaX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_asXaX_outXknowsX_asXbX_selectXaX_byXnameX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXbX_selectXa_bX_byXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_aggregateXxX_asXbX_selectXa_bX_byXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_name_order_asXbX_selectXa_bX_byXnameX_by_XitX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_gremlinX_inEXusesX_order_byXskill_ascX_asXaX_outV_asXbX_selectXa_bX_byXskillX_byXnameX | |
Given the crew graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_isXmarkoXX_asXaX_selectXaX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_label_groupCount_asXxX_selectXxX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXpersonX_asXpX_mapXbothE_label_groupCountX_asXrX_selectXp_rX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_chooseXoutE_count_isX0X__asXaX__asXbXX_chooseXselectXaX__selectXaX__selectXbXX | |
Given the modern graph | |
And using the parameter zero defined as "d[0].l" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_groupXaX_byXconstantXaXX_byXnameX_selectXaX_selectXaX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_asXhereX_out_selectXhereX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX4X_out_asXhereX_hasXlang_javaX_selectXhereX | |
Given the modern graph | |
And using the parameter v4Id defined as "v[josh].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX4X_out_asXhereX_hasXlang_javaX_selectXhereX_name | |
Given the modern graph | |
And using the parameter v4Id defined as "v[josh].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outE_asXhereX_inV_hasXname_vadasX_selectXhereX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outEXknowsX_hasXweight_1X_asXhereX_inV_hasXname_joshX_selectXhereX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outEXknowsX_asXhereX_hasXweight_1X_asXfakeX_inV_hasXname_joshX_selectXhereX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXhereXout_name_selectXhereX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_outXcreatedX_unionXasXprojectX_inXcreatedX_hasXname_markoX_selectXprojectX__asXprojectX_inXcreatedX_inXknowsX_hasXname_markoX_selectXprojectXX_groupCount_byXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_untilXout_outX_repeatXin_asXaXX_selectXaX_byXtailXlocalX_nameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_outE_weight_groupCount_selectXkeysX_unfold | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXsoftwareX_asXnameX_asXlanguageX_asXcreatorsX_selectXname_language_creatorsX_byXnameX_byXlangX_byXinXcreatedX_name_fold_orderXlocalXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_outE_weight_groupCount_unfold_selectXkeysX_unfold | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_outE_weight_groupCount_unfold_selectXvaluesX_unfold | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_untilXout_outX_repeatXin_asXaX_in_asXbXX_selectXa_bX_byXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_outE_weight_groupCount_selectXvaluesX_unfold | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_asXaX_outXknowsX_asXbX_selectXa_bX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_whereXoutXknowsXX_selectXaX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_asXaX_repeatXout_asXaXX_timesX2X_selectXfirst_aX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_outXknowsX_asXbX_localXselectXa_bX_byXnameXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_asXaX_repeatXout_asXaXX_timesX2X_selectXlast_aX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outEXknowsX_asXhereX_hasXweight_1X_inV_hasXname_joshX_selectXhereX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_hasXname_markoX_asXbX_asXcX_selectXa_b_cX_by_byXnameX_byXageX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_outE_weight_groupCount_selectXvaluesX_unfold_groupCount_selectXvaluesX_unfold | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_groupXmX_by_byXbothE_countX_barrier_selectXmX_selectXselectXaXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_groupXmX_by_byXbothE_countX_barrier_selectXmX_selectXselectXaXX_byXmathX_plus_XX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_outXknowsX_asXaX_selectXall_constantXaXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_selectXaX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_selectXaX_count | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_selectXa_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_valueMap_selectXaX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_valueMap_selectXa_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_selectXfirst_aX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_selectXfirst_a_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_valueMap_selectXfirst_aX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_valueMap_selectXfirst_a_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_selectXlast_aX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_selectXlast_a_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_valueMap_selectXlast_aX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_valueMap_selectXlast_a_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_selectXall_aX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_selectXall_a_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_valueMap_selectXall_aX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_valueMap_selectXall_a_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_asXa_bX_out_asXcX_path_selectXkeysX | |
Given the modern graph | |
And the traversal of | |
When iterated next | |
Then the result should be ordered | |
And the graph should return 6 for count of "g.V().as(\"a\", \"b\").out().as(\"c\").path().select(Column.keys)" | |
Scenario: g_EX11X_propertiesXweightX_asXaX_selectXaX_byXkeyX | |
Given the modern graph | |
And using the parameter e11Id defined as "e[josh-created->lop].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_EX11X_propertiesXweightX_asXaX_selectXaX_byXvalueX | |
Given the modern graph | |
And using the parameter e11Id defined as "e[josh-created->lop].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_constantX123X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_constantXnullX | |
Given the modern graph | |
1) And the traversal of (failed) | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_chooseXhasLabelXpersonX_valuesXnameX_constantXinhumanXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_fold | |
Given the modern graph | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_V_fold_unfold | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_age_foldX0_plusX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_pageRank_hasXpageRankX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
And the graph should return 6 for count of "g.withComputer().V().pageRank().has(\"gremlin.pageRankVertexProgram.pageRank\")" | |
Scenario: g_V_outXcreatedX_pageRank_withXedges_bothEX_withXpropertyName_projectRankX_withXtimes_0X_valueMapXname_projectRankX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_pageRank_order_byXpageRank_descX_byXnameX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_pageRank_order_byXpageRank_descX_name_limitX2X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_pageRank_withXedges_outEXknowsXX_withXpropertyName_friendRankX_project_byXnameX_byXvaluesXfriendRankX_mathX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXpersonX_pageRank_withXpropertyName_kpageRankX_project_byXnameX_byXvaluesXpageRankX_mathX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_pageRank_withXpropertyName_pageRankX_asXaX_outXknowsX_pageRank_asXbX_selectXa_bX_by_byXmathX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXsoftwareX_hasXname_rippleX_pageRankX1X_withXedges_inEXcreatedX_withXtimes_1X_withXpropertyName_priorsX_inXcreatedX_unionXboth__identityX_valueMapXname_priorsX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_outXcreatedX_groupXmX_byXlabelX_pageRankX1X_withXpropertyName_pageRankX_withXedges_inEX_withXtimes_1X_inXcreatedX_groupXmX_byXpageRankX_capXmX | |
Given the modern graph | |
And the traversal of | |
When iterated next | |
Then the result should have a count of 3 | |
Scenario: g_V_age_max | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_foo_max | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_name_max | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_age_fold_maxXlocalX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_foo_fold_maxXlocalX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_name_fold_maxXlocalX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_repeatXbothX_timesX5X_age_max | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXsoftwareX_group_byXnameX_byXbothE_weight_maxX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_age_sum | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_foo_sum | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_age_fold_sumXlocalX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_foo_fold_sumXlocalX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_hasLabelXsoftwareX_group_byXnameX_byXbothE_weight_sumX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_peerPressure_hasXclusterX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
And the graph should return 6 for count of "g.withComputer().V().peerPressure().has(\"gremlin.peerPressureVertexProgram.cluster\")" | |
Scenario: g_V_peerPressure_withXpropertyName_clusterX_withXedges_outEXknowsXX_pageRankX1X_byXrankX_withXedges_outEXknowsX_withXtimes_2X_group_byXclusterX_byXrank_sumX_limitX100X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_rippleX_inXcreatedX_peerPressure_withXedges_outEX_withyXpropertyName_clusterX_repeatXunionXidentity__bothX_timesX2X_dedup_valueMapXname_clusterX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_connectedComponent_hasXcomponentX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_dedup_connectedComponent_hasXcomponentX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXsoftwareX_connectedComponent_project_byXnameX_byXcomponentX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_connectedComponent_withXEDGES_bothEXknowsXX_withXPROPERTY_NAME_clusterX_project_byXnameX_byXclusterX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_localXoutE_foldX_unfold | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_valueMap_unfold_mapXkeyX | |
Given the modern graph | |
And using the parameter l defined as "c[it.get().getKey()]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_repeatXboth_simplePathX_untilXhasIdX6XX_path_byXnameX_unfold | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter v6Id defined as "v[peter].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_name_path | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_out_path_byXageX_byXnameX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_repeatXoutX_timesX2X_path_byXitX_byXnameX_byXlangX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_out_out_path_byXnameX_byXageX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_hasXname_markoX_asXbX_hasXage_29X_asXcX_path | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outEXcreatedX_inV_inE_outV_path | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXbX_out_asXcX_path_fromXbX_toXcX_byXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXageX_propertiesXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXageX_propertiesXname_ageX_value | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXageX_propertiesXage_nameX_value | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_injectXg_VX1X_propertiesXnameX_nextX_value | |
Given an unsupported test | |
Then nothing should happen because | |
Scenario: g_V_hasXageX_properties_hasXid_nameIdX_value | |
Given an unsupported test | |
Then nothing should happen because | |
Scenario: g_V_hasXageX_properties_hasXid_nameIdAsStringX_value | |
Given an unsupported test | |
Then nothing should happen because | |
Scenario: g_V_shortestPath | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_both_dedup_shortestPath | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_shortestPath_edgesIncluded | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_shortestPath_directionXINX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_shortestPath_edgesXoutEX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_shortestPath_edgesIncluded_edgesXoutEX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_markoX_shortestPath | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_shortestPath_targetXhasXname_markoXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_shortestPath_targetXvaluesXnameX_isXmarkoXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_markoX_shortestPath_targetXhasLabelXsoftwareXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_markoX_shortestPath_targetXhasXname_joshXX_distanceXweightX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_danielX_shortestPath_targetXhasXname_stephenXX_edgesXbothEXusesXX | |
Given the crew graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXsong_name_MIGHT_AS_WELLX_shortestPath_targetXhasXsong_name_MAYBE_YOU_KNOW_HOW_I_FEELXX_edgesXoutEXfollowedByXX_distanceXweightX | |
Given the grateful graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_markoX_shortestPath_maxDistanceX1X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_vadasX_shortestPath_distanceXweightX_maxDistanceX1_3X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_V_valuesXnameX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_outXknowsX_V_name | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_GarciaX_inXsungByX_asXsongX_V_hasXname_Willie_DixonX_inXwrittenByX_whereXeqXsongXX_name | |
Given the grateful graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXpersonX_asXpX_VXsoftwareX_addInEXuses_pX | |
Given the empty graph | |
And the graph initializer of | |
And using the parameter software defined as "l[v[lop],v[ripple]]" | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter v2Id defined as "v[vadas].id" | |
And using the parameter v3Id defined as "v[lop].id" | |
And using the parameter v4Id defined as "v[josh].id" | |
And using the parameter v5Id defined as "v[ripple].id" | |
And using the parameter v6Id defined as "v[peter].id" | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 8 | |
And the graph should return 8 for count of "g.E().hasLabel(\"uses\")" | |
And the graph should return 2 for count of "g.V(v1Id).outE(\"uses\")" | |
And the graph should return 2 for count of "g.V(v2Id).outE(\"uses\")" | |
And the graph should return 4 for count of "g.V(v3Id).inE(\"uses\")" | |
And the graph should return 2 for count of "g.V(v4Id).outE(\"uses\")" | |
And the graph should return 4 for count of "g.V(v5Id).inE(\"uses\")" | |
And the graph should return 2 for count of "g.V(v6Id).outE(\"uses\")" | |
Scenario: g_VX1X_repeatXboth_simplePathX_untilXhasXname_peterX_or_loops_isX3XX_hasXname_peterX_path_byXnameX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_repeatXboth_simplePathX_untilXhasXname_peterX_or_loops_isX2XX_hasXname_peterX_path_byXnameX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_repeatXboth_simplePathX_untilXhasXname_peterX_and_loops_isX3XX_hasXname_peterX_path_byXnameX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_emitXhasXname_markoX_or_loops_isX2XX_repeatXoutX_valuesXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_valueMap_matchXa_selectXnameX_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_out_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_out_bX_selectXb_idX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_knows_b__b_created_cX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXb_created_c__a_knows_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_created_b__b_0created_cX_whereXa_neq_cX_selectXa_cX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXd_0knows_a__d_hasXname_vadasX__a_knows_b__b_created_cX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_created_lop_b__b_0created_29_c__c_whereXrepeatXoutX_timesX2XXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXbX_matchXa_out_count_c__b_in_count_cX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa__a_out_b__notXa_created_bXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_created_lop_b__b_0created_29_cX_whereXc_repeatXoutX_timesX2XX_selectXa_b_cX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_out_out_matchXa_0created_b__b_0knows_cX_selectXcX_outXcreatedX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_knows_b__b_created_c__a_created_cX_dedupXa_b_cX_selectXaX_byXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_created_b__a_repeatXoutX_timesX2XX_selectXa_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_notXmatchXa_age_b__a_name_cX_whereXb_eqXcXX_selectXaXX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_knows_b__andXa_created_c__b_created_c__andXb_created_count_d__a_knows_count_dXXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_whereXa_neqXcXX__a_created_b__orXa_knows_vadas__a_0knows_and_a_hasXlabel_personXX__b_0created_c__b_0created_count_isXgtX1XXX_selectXa_b_cX_byXidX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa__a_both_b__b_both_cX_dedupXa_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_knows_b__b_created_lop__b_matchXb_created_d__d_0created_cX_selectXcX_cX_selectXa_b_cX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_knows_b__a_created_cX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXwhereXandXa_created_b__b_0created_count_isXeqX3XXXX__a_both_b__whereXb_inXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_outEXcreatedX_order_byXweight_descX_limitX1X_inV_b__b_hasXlang_javaXX_selectXa_bX_byXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_both_b__b_both_cX_dedupXa_bX_byXlabelX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_created_b__b_0created_aX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXbX_matchXa_out_count_c__orXa_knows_b__b_in_count_c__and__c_isXgtX2XXXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_knows_count_bX_selectXbX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_0sungBy_b__a_0writtenBy_c__b_writtenBy_d__c_sungBy_d__d_hasXname_GarciaXX | |
Given the grateful graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_hasXsong_name_sunshineX__a_mapX0followedBy_weight_meanX_b__a_0followedBy_c__c_filterXweight_whereXgteXbXXX_outV_dX_selectXdX_byXnameX | |
Given the grateful graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_0sungBy_b__a_0sungBy_c__b_writtenBy_d__c_writtenBy_e__d_hasXname_George_HarisonX__e_hasXname_Bob_MarleyXX | |
Given the grateful graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_hasXname_GarciaX__a_0writtenBy_b__a_0sungBy_bX | |
Given the grateful graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXsongsX_matchXa_name_b__a_performances_cX_selectXb_cX_count | |
Given the grateful graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_matchXa_followedBy_count_isXgtX10XX_b__a_0followedBy_count_isXgtX10XX_bX_count | |
Given the grateful graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_matchXa_0sungBy_b__a_0writtenBy_c__b_writtenBy_dX_whereXc_sungBy_dX_whereXd_hasXname_GarciaXX | |
Given the grateful graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_matchXa_hasXname_GarciaX__a_0writtenBy_b__b_followedBy_c__c_writtenBy_d__whereXd_neqXaXXX | |
Given the grateful graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_asXaX_outXcreatedX_addEXcreatedByX_toXaX | |
Given the empty graph | |
And the graph initializer of | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 7 for count of "g.E()" | |
And the graph should return 1 for count of "g.V(v1Id).inE()" | |
Scenario: g_VX1X_asXaX_outXcreatedX_addEXcreatedByX_toXaX_propertyXweight_2X | |
Given the empty graph | |
And the graph initializer of | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 7 for count of "g.E()" | |
And the graph should return 4 for count of "g.V(v1Id).bothE()" | |
And the graph should return 1 for count of "g.V(v1Id).inE().has(\"weight\", 2.0)" | |
Scenario: g_V_outE_propertyXweight_nullX | |
Given the empty graph | |
And the graph initializer of | |
2) And the traversal of (failed) | |
When iterated to list | |
Then the result should have a count of 6 | |
And the graph should return 0 for count of "g.E().properties(\"weight\")" | |
Scenario: g_V_aggregateXxX_asXaX_selectXxX_unfold_addEXexistsWithX_toXaX_propertyXtime_nowX | |
Given the empty graph | |
And the graph initializer of | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter v2Id defined as "v[vadas].id" | |
And using the parameter v3Id defined as "v[lop].id" | |
And using the parameter v4Id defined as "v[josh].id" | |
And using the parameter v5Id defined as "v[ripple].id" | |
And using the parameter v6Id defined as "v[peter].id" | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 36 | |
And the graph should return 42 for count of "g.E()" | |
And the graph should return 15 for count of "g.V(v1Id).bothE()" | |
And the graph should return 6 for count of "g.V(v1Id).inE(\"existsWith\")" | |
And the graph should return 6 for count of "g.V(v1Id).outE(\"existsWith\")" | |
And the graph should return 12 for count of "g.V(v1Id).bothE(\"existsWith\").has(\"time\",\"now\")" | |
And the graph should return 13 for count of "g.V(v2Id).bothE()" | |
And the graph should return 6 for count of "g.V(v2Id).inE(\"existsWith\")" | |
And the graph should return 6 for count of "g.V(v2Id).outE(\"existsWith\")" | |
And the graph should return 12 for count of "g.V(v2Id).bothE(\"existsWith\").has(\"time\",\"now\")" | |
And the graph should return 15 for count of "g.V(v3Id).bothE()" | |
And the graph should return 6 for count of "g.V(v3Id).inE(\"existsWith\")" | |
And the graph should return 6 for count of "g.V(v3Id).outE(\"existsWith\")" | |
And the graph should return 12 for count of "g.V(v3Id).bothE(\"existsWith\").has(\"time\",\"now\")" | |
And the graph should return 15 for count of "g.V(v4Id).bothE()" | |
And the graph should return 6 for count of "g.V(v4Id).inE(\"existsWith\")" | |
And the graph should return 6 for count of "g.V(v4Id).outE(\"existsWith\")" | |
And the graph should return 12 for count of "g.V(v4Id).bothE(\"existsWith\").has(\"time\",\"now\")" | |
And the graph should return 13 for count of "g.V(v5Id).bothE()" | |
And the graph should return 6 for count of "g.V(v5Id).inE(\"existsWith\")" | |
And the graph should return 6 for count of "g.V(v5Id).outE(\"existsWith\")" | |
And the graph should return 12 for count of "g.V(v5Id).bothE(\"existsWith\").has(\"time\",\"now\")" | |
And the graph should return 13 for count of "g.V(v6Id).bothE()" | |
And the graph should return 6 for count of "g.V(v6Id).inE(\"existsWith\")" | |
And the graph should return 6 for count of "g.V(v6Id).outE(\"existsWith\")" | |
And the graph should return 12 for count of "g.V(v6Id).bothE(\"existsWith\").has(\"time\",\"now\")" | |
Scenario: g_V_asXaX_outXcreatedX_inXcreatedX_whereXneqXaXX_asXbX_addEXcodeveloperX_fromXaX_toXbX_propertyXyear_2009X | |
Given the empty graph | |
And the graph initializer of | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter v2Id defined as "v[vadas].id" | |
And using the parameter v4Id defined as "v[josh].id" | |
And using the parameter v6Id defined as "v[peter].id" | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 6 | |
And the graph should return 12 for count of "g.E()" | |
And the graph should return 7 for count of "g.V(v1Id).bothE()" | |
And the graph should return 2 for count of "g.V(v1Id).inE(\"codeveloper\")" | |
And the graph should return 2 for count of "g.V(v1Id).outE(\"codeveloper\")" | |
And the graph should return 4 for count of "g.V(v1Id).bothE(\"codeveloper\").has(\"year\",2009)" | |
And the graph should return 1 for count of "g.V(v2Id).bothE()" | |
And the graph should return 7 for count of "g.V(v4Id).bothE()" | |
And the graph should return 2 for count of "g.V(v4Id).inE(\"codeveloper\")" | |
And the graph should return 2 for count of "g.V(v4Id).outE(\"codeveloper\")" | |
And the graph should return 4 for count of "g.V(v4Id).bothE(\"codeveloper\").has(\"year\",2009)" | |
And the graph should return 5 for count of "g.V(v6Id).bothE()" | |
And the graph should return 2 for count of "g.V(v6Id).inE(\"codeveloper\")" | |
And the graph should return 2 for count of "g.V(v6Id).outE(\"codeveloper\")" | |
And the graph should return 4 for count of "g.V(v6Id).bothE(\"codeveloper\").has(\"year\",2009)" | |
Scenario: g_V_asXaX_inXcreatedX_addEXcreatedByX_fromXaX_propertyXyear_2009X_propertyXacl_publicX | |
Given the empty graph | |
And the graph initializer of | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter v2Id defined as "v[vadas].id" | |
And using the parameter v3Id defined as "v[lop].id" | |
And using the parameter v4Id defined as "v[josh].id" | |
And using the parameter v5Id defined as "v[ripple].id" | |
And using the parameter v6Id defined as "v[peter].id" | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 4 | |
And the graph should return 10 for count of "g.E()" | |
And the graph should return 4 for count of "g.V(v1Id).bothE()" | |
And the graph should return 1 for count of "g.V(v1Id).inE(\"createdBy\")" | |
And the graph should return 0 for count of "g.V(v1Id).outE(\"createdBy\")" | |
And the graph should return 1 for count of "g.V(v1Id).bothE(\"createdBy\").has(\"year\",2009).has(\"acl\", \"public\")" | |
And the graph should return 1 for count of "g.V(v2Id).bothE()" | |
And the graph should return 6 for count of "g.V(v3Id).bothE()" | |
And the graph should return 0 for count of "g.V(v3Id).inE(\"createdBy\")" | |
And the graph should return 3 for count of "g.V(v3Id).outE(\"createdBy\")" | |
And the graph should return 3 for count of "g.V(v3Id).bothE(\"createdBy\").has(\"year\",2009).has(\"acl\", \"public\")" | |
And the graph should return 5 for count of "g.V(v4Id).bothE()" | |
And the graph should return 2 for count of "g.V(v4Id).inE(\"createdBy\")" | |
And the graph should return 0 for count of "g.V(v4Id).outE(\"createdBy\")" | |
And the graph should return 2 for count of "g.V(v4Id).bothE(\"createdBy\").has(\"year\",2009).has(\"acl\", \"public\")" | |
And the graph should return 2 for count of "g.V(v5Id).bothE()" | |
And the graph should return 0 for count of "g.V(v5Id).inE(\"createdBy\")" | |
And the graph should return 1 for count of "g.V(v5Id).outE(\"createdBy\")" | |
And the graph should return 1 for count of "g.V(v5Id).bothE(\"createdBy\").has(\"year\",2009).has(\"acl\", \"public\")" | |
And the graph should return 2 for count of "g.V(v6Id).bothE()" | |
And the graph should return 1 for count of "g.V(v6Id).inE(\"createdBy\")" | |
And the graph should return 0 for count of "g.V(v6Id).outE(\"createdBy\")" | |
And the graph should return 1 for count of "g.V(v6Id).bothE(\"createdBy\").has(\"year\",2009).has(\"acl\", \"public\")" | |
Scenario: g_withSideEffectXb_bX_VXaX_addEXknowsX_toXbX_propertyXweight_0_5X | |
Given the empty graph | |
And the graph initializer of | |
And using the parameter v1 defined as "v[marko]" | |
And using the parameter v6 defined as "v[peter]" | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 7 for count of "g.E()" | |
And the graph should return 4 for count of "g.V(v1).bothE()" | |
And the graph should return 0 for count of "g.V(v1).inE(\"knows\")" | |
And the graph should return 3 for count of "g.V(v1).outE(\"knows\")" | |
And the graph should return 2 for count of "g.V(v1).bothE(\"knows\").has(\"weight\",0.5)" | |
And the graph should return 2 for count of "g.V(v6).bothE()" | |
And the graph should return 1 for count of "g.V(v6).inE(\"knows\")" | |
And the graph should return 0 for count of "g.V(v6).outE(\"knows\")" | |
And the graph should return 1 for count of "g.V(v6).bothE(\"knows\").has(\"weight\",0.5)" | |
Scenario: g_addV_asXfirstX_repeatXaddEXnextX_toXaddVX_inVX_timesX5X_addEXnextX_toXselectXfirstXX | |
Given the empty graph | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 6 for count of "g.V()" | |
And the graph should return 6 for count of "g.E()" | |
And the graph should return 6 for count of "g.E().hasLabel(\"next\")" | |
And the graph should return 2 for count of "g.V().limit(1).bothE()" | |
And the graph should return 1 for count of "g.V().limit(1).inE()" | |
And the graph should return 1 for count of "g.V().limit(1).outE()" | |
Scenario: g_V_hasXname_markoX_asXaX_outEXcreatedX_asXbX_inV_addEXselectXbX_labelX_toXaX | |
Given the empty graph | |
And the graph initializer of | |
And using the parameter v1 defined as "v[marko]" | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 7 for count of "g.E()" | |
And the graph should return 4 for count of "g.V(v1).bothE()" | |
And the graph should return 1 for count of "g.V(v1).inE(\"created\")" | |
And the graph should return 1 for count of "g.V(v1).in(\"created\").has(\"name\",\"lop\")" | |
And the graph should return 1 for count of "g.V(v1).outE(\"created\")" | |
Scenario: g_addEXV_outE_label_groupCount_orderXlocalX_byXvalues_descX_selectXkeysX_unfold_limitX1XX_fromXV_hasXname_vadasXX_toXV_hasXname_lopXX | |
Given the empty graph | |
And the graph initializer of | |
And using the parameter v2 defined as "v[vadas]" | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 7 for count of "g.E()" | |
And the graph should return 2 for count of "g.V(v2).bothE()" | |
And the graph should return 1 for count of "g.V(v2).inE(\"knows\")" | |
And the graph should return 1 for count of "g.V(v2).outE(\"created\")" | |
And the graph should return 1 for count of "g.V(v2).out(\"created\").has(\"name\",\"lop\")" | |
Scenario: g_addEXknowsX_fromXaX_toXbX_propertyXweight_0_1X | |
Given the empty graph | |
And the graph initializer of | |
And using the parameter v1 defined as "v[marko]" | |
And using the parameter v6 defined as "v[peter]" | |
And using the parameter dotOne defined as "d[0.1].d" | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 7 for count of "g.E()" | |
And the graph should return 3 for count of "g.V(v1).outE(\"knows\")" | |
And the graph should return 1 for count of "g.V(v1).out(\"knows\").has(\"name\",\"peter\")" | |
Scenario: g_VXaX_addEXknowsX_toXbX_propertyXweight_0_1X | |
Given the empty graph | |
And the graph initializer of | |
And using the parameter v1 defined as "v[marko]" | |
And using the parameter v6 defined as "v[peter]" | |
And using the parameter dotOne defined as "d[0.1].d" | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 7 for count of "g.E()" | |
And the graph should return 3 for count of "g.V(v1).outE(\"knows\")" | |
And the graph should return 1 for count of "g.V(v1).out(\"knows\").has(\"name\",\"peter\")" | |
Scenario: g_VX1X_mapXnameX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter l defined as "c[it.get().value('name')]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outE_label_mapXlengthX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter l defined as "c[it.get().length()]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_out_mapXnameX_mapXlengthX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter l1 defined as "c[it.get().value('name')]" | |
And using the parameter l2 defined as "c[it.get().toString().length()]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_withPath_V_asXaX_out_mapXa_nameX | |
Given the modern graph | |
And using the parameter l defined as "c[it.path('a').value('name')]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_withPath_V_asXaX_out_out_mapXa_name_it_nameX | |
Given the modern graph | |
And using the parameter l defined as "c[it.path('a').value('name') + it.get().value('name')]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_mapXselectXaXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_mapXconstantXnullXX | |
Given the modern graph | |
3) And the traversal of (failed) | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_age_min | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_foo_min | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_name_min | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_age_fold_minXlocalX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_foo_fold_minXlocalX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_name_fold_minXlocalX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_repeatXbothX_timesX5X_age_min | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXsoftwareX_group_byXnameX_byXbothE_weight_minX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_foo_injectX9999999999X_min | |
Given the modern graph | |
And using the parameter injectVal defined as "d[9999999999].l" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_count | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_out_count | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_both_both_count | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_fold_countXlocalX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_hasXnoX_count | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_whereXinXkknowsX_outXcreatedX_count_is_0XX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_repeatXoutX_timesX8X_count | |
Given the grateful graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_repeatXoutX_timesX5X_asXaX_outXwrittenByX_asXbX_selectXa_bX_count | |
Given the grateful graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_repeatXoutX_timesX3X_count | |
Given the grateful graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_VXlistX1_2_3XX_name | |
Given the modern graph | |
And using the parameter vx defined as "l[v[marko].id,v[vadas].id,v[lop].id]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VXlistXv1_v2_v3XX_name | |
Given the modern graph | |
And using the parameter vx defined as "l[v[marko],v[vadas],v[lop]]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VXv1X_out | |
Given the modern graph | |
And using the parameter v1 defined as "v[marko]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_out | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX2X_in | |
Given the modern graph | |
And using the parameter v2Id defined as "v[vadas].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX4X_both | |
Given the modern graph | |
And using the parameter v4Id defined as "v[josh].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_E | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_EX11X | |
Given the modern graph | |
And using the parameter e11Id defined as "e[josh-created->lop].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_EX11AsStringX | |
Given the modern graph | |
And using the parameter e11Id defined as "e[josh-created->lop].sid" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_EXe11X | |
Given the modern graph | |
And using the parameter e11 defined as "e[josh-created->lop]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_EXe7_e11X | |
Given the modern graph | |
And using the parameter e7 defined as "e[marko-knows->vadas]" | |
And using the parameter e11 defined as "e[josh-created->lop]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_EXlistXe7_e11XX | |
Given the modern graph | |
And using the parameter l defined as "l[e[marko-knows->vadas],e[josh-created->lop]]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outE | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX2X_outE | |
Given the modern graph | |
And using the parameter v2Id defined as "v[vadas].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX4X_bothEXcreatedX | |
Given the modern graph | |
And using the parameter v4Id defined as "v[josh].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX4X_bothE | |
Given the modern graph | |
And using the parameter v4Id defined as "v[josh].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outE_inV | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX2X_inE_outV | |
Given the modern graph | |
And using the parameter v2Id defined as "v[vadas].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_outE_hasXweight_1X_outV | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_out_outE_inV_inE_inV_both_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outEXknowsX_bothV_name | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outE_otherV | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX4X_bothE_otherV | |
Given the modern graph | |
And using the parameter v4Id defined as "v[josh].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX4X_bothE_hasXweight_lt_1X_otherV | |
Given the modern graph | |
And using the parameter v4Id defined as "v[josh].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX2X_inE | |
Given the modern graph | |
And using the parameter v2Id defined as "v[vadas].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: get_g_VX1X_outE_otherV | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outXknowsX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1AsStringX_outXknowsX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].sid" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outXknows_createdX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outEXknowsX_inV | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outEXknows_createdX_inV | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_out_out | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_out_out_out | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_VX1X_out_name | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_to_XOUT_knowsX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1_2_3_4X_name | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter v2Id defined as "v[vadas].id" | |
And using the parameter v3Id defined as "e[marko-knows->josh].id" | |
And using the parameter v4Id defined as "v[josh].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXpersonX_V_hasLabelXsoftwareX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXloopsX_bothEXselfX | |
Given the sink graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXloopsX_bothXselfX | |
Given the sink graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_coalesceXoutXfooX_outXbarXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_VX1X_coalesceXoutXknowsX_outXcreatedXX_valuesXnameX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_coalesceXoutXcreatedX_outXknowsXX_valuesXnameX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_coalesceXoutXlikesX_outXknowsX_inXcreatedXX_groupCount_byXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_coalesceXoutEXknowsX_outEXcreatedXX_otherV_path_byXnameX_byXlabelX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_outXcreatedX_order_byXnameX_coalesceXname_constantXxXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_elementMap | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_elementMapXname_ageX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_EX11X_elementMap | |
Given the modern graph | |
And using the parameter e11Id defined as "e[josh-created->lop].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_addVXanimalX_propertyXage_selectXaX_byXageXX_propertyXname_puppyX | |
Given the empty graph | |
And the graph initializer of | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 1 for count of "g.V().has(\"animal\",\"age\",29)" | |
Scenario: g_V_addVXanimalX_propertyXage_0X | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 6 | |
And the graph should return 6 for count of "g.V().has(\"animal\",\"age\",0)" | |
Scenario: g_addVXpersonX_propertyXname_stephenX | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 1 for count of "g.V().has(\"person\",\"name\",\"stephen\")" | |
Scenario: g_V_hasLabelXpersonX_propertyXname_nullX | |
Given the empty graph | |
And the graph initializer of | |
4) And the traversal of (failed) | |
When iterated to list | |
Then the result should have a count of 4 | |
And the graph should return 2 for count of "g.V().properties(\"name\")" | |
Scenario: g_addVXpersonX_propertyXsingle_name_stephenX_propertyXsingle_name_stephenmX | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 0 for count of "g.V().has(\"person\",\"name\",\"stephen\")" | |
And the graph should return 1 for count of "g.V().has(\"person\",\"name\",\"stephenm\")" | |
Scenario: get_g_addVXpersonX_propertyXsingle_name_stephenX_propertyXsingle_name_stephenm_since_2010X | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 0 for count of "g.V().has(\"person\",\"name\",\"stephen\")" | |
And the graph should return 1 for count of "g.V().has(\"person\",\"name\",\"stephenm\")" | |
And the graph should return 1 for count of "g.V().has(\"person\",\"name\",\"stephenm\").properties(\"name\").has(\"since\",2010)" | |
Scenario: g_V_hasXname_markoX_propertyXfriendWeight_outEXknowsX_weight_sum__acl_privateX | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 1 for count of "g.V().has(\"person\",\"name\",\"marko\").has(\"friendWeight\", 1.5)" | |
And the graph should return 1 for count of "g.V().has(\"person\",\"name\",\"marko\").properties(\"friendWeight\").has(\"acl\",\"private\")" | |
And the graph should return 1 for count of "g.V().has(\"person\",\"name\",\"marko\").properties(\"friendWeight\").count()" | |
Scenario: g_addVXanimalX_propertyXname_mateoX_propertyXname_gateoX_propertyXname_cateoX_propertyXage_5X | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 1 for count of "g.V().hasLabel(\"animal\").has(\"name\",\"mateo\").has(\"name\", \"gateo\").has(\"name\", \"cateo\").has(\"age\",5)" | |
Scenario: g_withSideEffectXa_markoX_addV_propertyXname_selectXaXX_name | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
And the graph should return 2 for count of "g.V().has(\"name\",\"marko\")" | |
Scenario: g_addVXpersonX_propertyXsingle_name_stephenX_propertyXsingle_name_stephenm_since_2010X | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 0 for count of "g.V().has(\"name\",\"stephen\")" | |
And the graph should return 1 for count of "g.V().has(\"name\",\"stephenm\")" | |
And the graph should return 1 for count of "g.V().has(\"name\",\"stephenm\").properties(\"name\").has(\"since\",2010)" | |
Scenario: g_V_addVXanimalX_propertyXname_valuesXnameXX_propertyXname_an_animalX_propertyXvaluesXnameX_labelX | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 6 | |
And the graph should return 1 for count of "g.V().hasLabel(\"animal\").has(\"name\",\"marko\").has(\"name\",\"an animal\").has(\"marko\",\"person\")" | |
And the graph should return 1 for count of "g.V().hasLabel(\"animal\").has(\"name\",\"vadas\").has(\"name\",\"an animal\").has(\"vadas\",\"person\")" | |
And the graph should return 1 for count of "g.V().hasLabel(\"animal\").has(\"name\",\"lop\").has(\"name\",\"an animal\").has(\"lop\",\"software\")" | |
And the graph should return 1 for count of "g.V().hasLabel(\"animal\").has(\"name\",\"josh\").has(\"name\",\"an animal\").has(\"josh\",\"person\")" | |
And the graph should return 1 for count of "g.V().hasLabel(\"animal\").has(\"name\",\"ripple\").has(\"name\",\"an animal\").has(\"ripple\",\"software\")" | |
And the graph should return 1 for count of "g.V().hasLabel(\"animal\").has(\"name\",\"peter\").has(\"name\",\"an animal\").has(\"peter\",\"person\")" | |
Scenario: g_withSideEffectXa_testX_V_hasLabelXsoftwareX_propertyXtemp_selectXaXX_valueMapXname_tempX | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_withSideEffectXa_nameX_addV_propertyXselectXaX_markoX_name | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
And the graph should return 2 for count of "g.V().has(\"name\",\"marko\")" | |
Scenario: g_V_asXaX_hasXname_markoX_outXcreatedX_asXbX_addVXselectXaX_labelX_propertyXtest_selectXbX_labelX_valueMap_withXtokensX | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 1 for count of "g.V().has(\"person\",\"test\",\"software\")" | |
Scenario: g_addVXV_hasXname_markoX_propertiesXnameX_keyX_label | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_addVXnullX_propertyXid_nullX | |
Given the empty graph | |
5) And the traversal of (failed) | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 1 for count of "g.V().hasLabel(\"vertex\")" | |
Scenario: g_addV_propertyXlabel_personX | |
Given the empty graph | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
And the graph should return 1 for count of "g.V().hasLabel(\"person\")" | |
Scenario: g_V_valueMap | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_valueMapXtrueX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_valueMap_withXtokensX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_valueMapXname_ageX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_valueMapXtrue_name_ageX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_valueMapXname_ageX_withXtokensX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_valueMapXname_ageX_withXtokens_labelsX_byXunfoldX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_valueMapXname_ageX_withXtokens_idsX_byXunfoldX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outXcreatedX_valueMap | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXpersonX_filterXoutEXcreatedXX_valueMapXtrueX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXpersonX_filterXoutEXcreatedXX_valueMap_withXtokensX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_valueMapXname_locationX_byXunfoldX_by | |
Given the crew graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_age_mean | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_foo_mean | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_age_fold_meanXlocalX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_foo_fold_meanXlocalX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_hasLabelXsoftwareX_group_byXnameX_byXbothE_weight_meanX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXsoftwareX_index_unfold | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXsoftwareX_order_byXnameX_index_withXmapX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_hasLabelXsoftwareX_name_fold_orderXlocalX_index_unfold_order_byXtailXlocal_1XX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXpersonX_name_fold_orderXlocalX_index_withXmapX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXpersonX_projectXa_bX_byXoutE_countX_byXageX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_outXcreatedX_projectXa_bX_byXnameX_byXinXcreatedX_countX_order_byXselectXbX__descX_selectXaX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_valueMap_projectXxX_byXselectXnameXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXageX_asXaX_out_in_hasXageX_asXbX_selectXa_bX_whereXa_eqXbXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXageX_asXaX_out_in_hasXageX_asXbX_selectXa_bX_whereXa_neqXbXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXageX_asXaX_out_in_hasXageX_asXbX_selectXa_bX_whereXb_hasXname_markoXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXageX_asXaX_out_in_hasXageX_asXbX_selectXa_bX_whereXa_outXknowsX_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_outXcreatedX_whereXasXaX_name_isXjoshXX_inXcreatedX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_withSideEffectXa_josh_peterX_VX1X_outXcreatedX_inXcreatedX_name_whereXwithinXaXX | |
Given the modern graph | |
And using the parameter l defined as "l[josh,peter]" | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_asXaX_outXcreatedX_inXcreatedX_asXbX_whereXa_neqXbXX_name | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_asXaX_outXcreatedX_inXcreatedX_asXbX_whereXasXbX_outXcreatedX_hasXname_rippleXX_valuesXage_nameX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_asXaX_outXcreatedX_inXcreatedX_whereXeqXaXX_name | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_asXaX_outXcreatedX_inXcreatedX_whereXneqXaXX_name | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_out_aggregateXxX_out_whereXnotXwithinXaXXX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_withSideEffectXa_g_VX2XX_VX1X_out_whereXneqXaXX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter v2 defined as "v[vadas]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_repeatXbothEXcreatedX_whereXwithoutXeXX_aggregateXeX_otherVX_emit_path | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_whereXnotXoutXcreatedXXX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXbX_whereXandXasXaX_outXknowsX_asXbX__orXasXbX_outXcreatedX_hasXname_rippleX__asXbX_inXknowsX_count_isXnotXeqX0XXXXX_selectXa_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_whereXoutXcreatedX_and_outXknowsX_or_inXknowsXX_valuesXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_outXcreatedX_asXbX_whereXandXasXbX_in__notXasXaX_outXcreatedX_hasXname_rippleXXX_selectXa_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_outXcreatedX_asXbX_inXcreatedX_asXcX_bothXknowsX_bothXknowsX_asXdX_whereXc__notXeqXaX_orXeqXdXXXX_selectXa_b_c_dX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXbX_whereXin_count_isXeqX3XX_or_whereXoutXcreatedX_and_hasXlabel_personXXX_selectXa_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_outXcreatedX_inXcreatedX_asXbX_whereXa_gtXbXX_byXageX_selectXa_bX_byXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_outEXcreatedX_asXbX_inV_asXcX_whereXa_gtXbX_orXeqXbXXX_byXageX_byXweightX_byXweightX_selectXa_cX_byXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_outEXcreatedX_asXbX_inV_asXcX_inXcreatedX_asXdX_whereXa_ltXbX_orXgtXcXX_andXneqXdXXX_byXageX_byXweightX_byXinXcreatedX_valuesXageX_minX_selectXa_c_dX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_asXaX_out_hasXageX_whereXgtXaXX_byXageX_name | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_drop | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
And the graph should return 0 for count of "g.V()" | |
And the graph should return 0 for count of "g.E()" | |
Scenario: g_V_outE_drop | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
And the graph should return 2 for count of "g.V()" | |
And the graph should return 0 for count of "g.E()" | |
Scenario: g_V_properties_drop | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
And the graph should return 2 for count of "g.V()" | |
And the graph should return 0 for count of "g.V().properties()" | |
Scenario: g_E_propertiesXweightX_drop | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
And the graph should return 0 for count of "g.E().properties()" | |
Scenario: g_V_properties_propertiesXstartTimeX_drop | |
Given the empty graph | |
And the graph initializer of | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
And the graph should return 2 for count of "g.V().properties().properties()" | |
And the graph should return 0 for count of "g.V().properties().properties(\"startTime\")" | |
Scenario: g_V_filterXfalseX | |
Given the modern graph | |
And using the parameter l1 defined as "c[false]" | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_filterXtrueX | |
Given the modern graph | |
And using the parameter l1 defined as "c[true]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_filterXlang_eq_javaX | |
Given the modern graph | |
And using the parameter l1 defined as "c[it.get().property('lang').orElse('none').equals('java')]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_filterXage_gt_30X | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter l1 defined as "c[it.get().property('age').orElse(0) > 30]" | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_VX2X_filterXage_gt_30X | |
Given the modern graph | |
And using the parameter v2Id defined as "v[josh].id" | |
And using the parameter l1 defined as "c[it.get().property('age').orElse(0) > 30]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_out_filterXage_gt_30X | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter l1 defined as "c[it.get().property('age').orElse(0) > 30]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_filterXname_startsWith_m_OR_name_startsWith_pX | |
Given the modern graph | |
And using the parameter l1 defined as "c[{name = it.get().value('name'); name.startsWith('m') || name.startsWith('p')}]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_E_filterXfalseX | |
Given the modern graph | |
And using the parameter l1 defined as "c[false]" | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_E_filterXtrueX | |
Given the modern graph | |
And using the parameter l1 defined as "c[true]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_orXhasXage_gt_27X__outE_count_gte_2X_name | |
Given the modern graph | |
And using the parameter two defined as "d[2].l" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_orXoutEXknowsX__hasXlabel_softwareX_or_hasXage_gte_35XX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_orXselectXaX_selectXaXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outXcreatedX_inXcreatedX_simplePath | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_repeatXboth_simplePathX_timesX3X_path | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXbX_out_asXcX_simplePath_byXlabelX_fromXbX_toXcX_path_byXnameX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_coinX1X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_coinX0X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_valuesXageX_isX32X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_valuesXageX_isXlte_30X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_valuesXageX_isXgte_29X_isXlt_34X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_whereXinXcreatedX_count_isX1XX_valuesXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_whereXinXcreatedX_count_isXgte_2XX_valuesXnameX | |
Given the modern graph | |
And using the parameter two defined as "d[2].l" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_E_sampleX1X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 1 | |
Scenario: g_E_sampleX2X_byXweightX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 2 | |
Scenario: g_V_localXoutE_sampleX1X_byXweightXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 3 | |
Scenario: g_V_group_byXlabelX_byXbothE_weight_sampleX2X_foldX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then nothing should happen because | |
Scenario: g_V_group_byXlabelX_byXbothE_weight_fold_sampleXlocal_5XX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then nothing should happen because | |
Scenario: g_VX1X_out_limitX2X | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be of | |
And the result should have a count of 2 | |
Scenario: g_V_localXoutE_limitX1X_inVX_limitX3X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be of | |
And the result should have a count of 3 | |
Scenario: g_VX1X_outXknowsX_outEXcreatedX_rangeX0_1X_inV | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be of | |
And the result should have a count of 1 | |
Scenario: g_VX1X_outXknowsX_outXcreatedX_rangeX0_1X | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be of | |
And the result should have a count of 1 | |
Scenario: g_VX1X_outXcreatedX_inXcreatedX_rangeX1_3X | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be of | |
And the result should have a count of 2 | |
Scenario: g_VX1X_outXcreatedX_inEXcreatedX_rangeX1_3X_outV | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be of | |
And the result should have a count of 2 | |
Scenario: g_V_repeatXbothX_timesX3X_rangeX5_11X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be of | |
And the result should have a count of 6 | |
Scenario: g_V_asXaX_in_asXbX_in_asXcX_selectXa_b_cX_byXnameX_limitXlocal_2X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_in_asXbX_in_asXcX_selectXa_b_cX_byXnameX_limitXlocal_1X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXbX_out_asXcX_selectXa_b_cX_byXnameX_rangeXlocal_1_3X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXbX_out_asXcX_selectXa_b_cX_byXnameX_rangeXlocal_1_2X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXaX_out_asXaX_selectXmixed_aX_byXunfold_valuesXnameX_foldX_rangeXlocal_1_3X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXaX_out_asXaX_selectXmixed_aX_byXunfold_valuesXnameX_foldX_rangeXlocal_1_2X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXpersonX_order_byXageX_skipX1X_valuesXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXaX_out_asXaX_selectXmixed_aX_byXunfold_valuesXnameX_foldX_rangeXlocal_4_5X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_outE_valuesXweightX_fold_orderXlocalX_skipXlocal_2X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_in_asXaX_in_asXaX_selectXmixed_aX_byXunfold_valuesXnameX_foldX_limitXlocal_1X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_in_asXaX_in_asXaX_selectXmixed_aX_byXunfold_valuesXnameX_foldX_limitXlocal_2X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXpersonX_order_byXageX_valuesXnameX_skipX1X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_valuesXnameX_order_tailXglobal_2X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_valuesXnameX_order_tailX2X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_valuesXnameX_order_tail | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_valuesXnameX_order_tailX7X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_repeatXbothX_timesX3X_tailX7X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_repeatXin_outX_timesX3X_tailX7X_count | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXaX_out_asXaX_selectXaX_byXunfold_valuesXnameX_foldX_tailXlocal_1X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXaX_out_asXaX_selectXaX_byXunfold_valuesXnameX_foldX_tailXlocalX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXbX_out_asXcX_selectXa_b_cX_byXnameX_tailXlocal_2X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXbX_out_asXcX_selectXa_b_cX_byXnameX_tailXlocal_1X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXaX_out_asXaX_selectXmixed_aX_byXunfold_valuesXnameX_foldX_tailXlocal_1X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXaX_out_asXaX_selectXmixed_aX_byXunfold_valuesXnameX_foldX_tailXlocalX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_out_asXaX_out_asXaX_selectXmixed_aX_byXlimitXlocal_0XX_tailXlocal_1X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_asXaX_out_asXaX_out_asXaX_selectXmixed_aX_byXunfold_valuesXnameX_foldX_tailXlocal_2X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_outXcreatedX_hasXname__mapXlengthX_isXgtX3XXX_name | |
Given the modern graph | |
And using the parameter l1 defined as "c[it.get().length()]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_hasXnameX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_hasXcircumferenceX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_VX1X_hasXname_markoX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX2X_hasXname_markoX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[vadas].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_hasXname_markoX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_blahX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_hasXage_gt_30X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXage_isXgt_30XX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_hasXage_gt_30X | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_VX4X_hasXage_gt_30X | |
Given the modern graph | |
And using the parameter v4Id defined as "v[josh].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VXv1X_hasXage_gt_30X | |
Given the modern graph | |
And using the parameter v1 defined as "v[marko]" | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_VXv4X_hasXage_gt_30X | |
Given the modern graph | |
And using the parameter v4 defined as "v[josh]" | |
And using the parameter d30 defined as "d[30].i" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_out_hasXid_lt_3X | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter v3Id defined as "v[lop].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1AsStringX_out_hasXid_2AsStringX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].sid" | |
And using the parameter v2Id defined as "v[vadas].sid" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_out_hasXid_2X | |
Given the modern graph | |
And using the parameter v2 defined as "v[josh]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_out_hasIdX2X | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter v2Id defined as "v[vadas].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_out_hasXid_2_3X | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter v2Id defined as "v[vadas].id" | |
And using the parameter v3Id defined as "v[lop].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_out_hasXid_2AsString_3AsStringX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].sid" | |
And using the parameter v2Id defined as "v[vadas].sid" | |
And using the parameter v3Id defined as "v[lop].sid" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXblahX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_EX7X_hasXlabelXknowsX | |
Given the modern graph | |
And using the parameter e7Id defined as "e[marko-knows->vadas].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_E_hasXlabelXknowsX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_E_hasLabelXuses_traversesX | |
Given the crew graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXperson_software_blahX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXperson_name_markoX_age | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outE_hasXweight_inside_0_06X_inV | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter lower defined as "d[0.0].d" | |
And using the parameter upper defined as "d[0.6].d" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_EX11X_outV_outE_hasXid_10X | |
Given the modern graph | |
And using the parameter e11Id defined as "e[josh-created->lop].id" | |
And using the parameter e10Id defined as "e[josh-created->ripple].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_EX11X_outV_outE_hasXid_10AsStringX | |
Given the modern graph | |
And using the parameter e11Id defined as "e[josh-created->lop].sid" | |
And using the parameter e10Id defined as "e[josh-created->ripple].sid" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXlocationX | |
Given the crew graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXpersonX_hasXage_notXlteX10X_andXnotXbetweenX11_20XXXX_andXltX29X_orXeqX35XXXX_name | |
Given the modern graph | |
And using the parameter d10 defined as "d[10].i" | |
And using the parameter d11 defined as "d[11].i" | |
And using the parameter d20 defined as "d[20].i" | |
And using the parameter d29 defined as "d[29].i" | |
And using the parameter d35 defined as "d[35].i" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_in_hasIdXneqX1XX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXage_withinX27X_count | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_hasXage_withinX27_29X_count | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_hasXage_withoutX27X_count | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_hasXage_withoutX27_29X_count | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_both_dedup_properties_hasKeyXageX_value | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_both_dedup_properties_hasKeyXageX_hasValueXgtX30XX_value | |
Given the modern graph | |
And using the parameter d30 defined as "d[30].i" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_bothE_properties_dedup_hasKeyXweightX_value | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_bothE_properties_dedup_hasKeyXweightX_hasValueXltX0d3XX_value | |
Given the modern graph | |
And using the parameter d0d3 defined as "d[0.3].d" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasNotXageX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasIdX1X_hasIdX2X | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter v2Id defined as "v[vadas].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_hasLabelXpersonX_hasLabelXsoftwareX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_hasIdXemptyX_count | |
Given the modern graph | |
And using the parameter l defined as "l[]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasIdXwithinXemptyXX_count | |
Given the modern graph | |
And using the parameter l defined as "l[]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasIdXwithoutXemptyXX_count | |
Given the modern graph | |
And using the parameter l defined as "l[]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_notXhasIdXwithinXemptyXXX_count | |
Given the modern graph | |
And using the parameter l defined as "l[]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_containingXarkXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_startingWithXmarXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_endingWithXasXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXperson_name_containingXoX_andXltXmXXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_gtXmX_andXcontainingXoXXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_not_containingXarkXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_not_startingWithXmarXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_not_endingWithXasXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXp_neqXvXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_VX1X_outXcreatedX_inXcreatedX_cyclicPath | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_outXcreatedX_inXcreatedX_cyclicPath_path | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_asXaX_outXcreatedX_asXbX_inXcreatedX_asXcX_cyclicPath_fromXaX_toXbX_path | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
Scenario: g_V_andXhasXage_gt_27X__outE_count_gte_2X_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_andXoutE__hasXlabel_personX_and_hasXage_gte_32XX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_outXknowsX_and_outXcreatedX_inXcreatedX_asXaX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_andXselectXaX_selectXaXX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_markoX_and_hasXname_markoX_and_hasXname_markoX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_out_in_valuesXnameX_fold_dedupXlocalX_unfold | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_out_asXxX_in_asXyX_selectXx_yX_byXnameX_fold_dedupXlocal_x_yX_unfold | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_both_dedup_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_both_hasXlabel_softwareX_dedup_byXlangX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_both_name_order_byXa_bX_dedup_value | |
Given the modern graph | |
And using the parameter l defined as "c[a,b -> a.value().compareTo(b.value())]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_both_both_name_dedup | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_both_both_dedup | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_both_both_dedup_byXlabelX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should have a count of 2 | |
Scenario: g_V_group_byXlabelX_byXbothE_weight_dedup_foldX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_both_asXbX_dedupXa_bX_byXlabelX_selectXa_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_outXcreatedX_asXbX_inXcreatedX_asXcX_dedupXa_bX_path | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_outE_asXeX_inV_asXvX_selectXeX_order_byXweight_ascX_selectXvX_valuesXnameX_dedup | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_both_both_dedup_byXoutE_countX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_groupCount_selectXvaluesX_unfold_dedup | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_asXaX_repeatXbothX_timesX3X_emit_name_asXbX_group_byXselectXaXX_byXselectXbX_dedup_order_foldX_selectXvaluesX_unfold_dedup | |
Given the modern graph | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_V_repeatXdedupX_timesX2X_count | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_bothE_properties_dedup_count | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_both_properties_dedup_count | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_both_properties_properties_dedup_count | |
Given the crew graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_repeatXoutX_timesX2X_emit_path | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_repeatXoutX_timesX2X_repeatXinX_timesX2X_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_repeatXoutX_timesX2X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_repeatXoutX_timesX2X_emit | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be of | |
And the result should have a count of 8 | |
Scenario: g_VX1X_timesX2X_repeatXoutX_name | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_emit_timesX2X_repeatXoutX_path | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_emit_repeatXoutX_timesX2X_path | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_emitXhasXlabel_personXX_repeatXoutX_name | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_repeatXgroupCountXmX_byXnameX_outX_timesX2X_capXmX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_repeatXgroupCountXmX_byXloopsX_outX_timesX3X_capXmX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_repeatXbothX_timesX10X_asXaX_out_asXbX_selectXa_bX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_VX1X_repeatXoutX_untilXoutE_count_isX0XX_name | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_repeatXbothX_untilXname_eq_marko_or_loops_gt_1X_groupCount_byXnameX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter l defined as "c[t -> t.get().value('name').equals('lop') || t.loops() > 1]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXname_markoX_repeatXoutE_inV_simplePathX_untilXhasXname_rippleXX_path_byXnameX_byXlabelX | |
Given the modern graph | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_V_hasXloop_name_loopX_repeatXinX_timesX5X_path_by_name | |
Given the sink graph | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_V_repeatXout_repeatXoutX_timesX1XX_timesX1X_limitX1X_path_by_name | |
Given the modern graph | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_V_repeatXoutXknowsXX_untilXrepeatXoutXcreatedXX_emitXhasXname_lopXXX_path_byXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_V_repeatXrepeatXout_createdXX_untilXhasXname_rippleXXXemit_lang | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_untilXconstantXtrueXX_repeatXrepeatXout_createdXX_untilXhasXname_rippleXXXemit_lang | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_emit_repeatXa_outXknows_filterXloops_isX0XX_lang | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX3X_repeatXbothX_createdXX_untilXloops_is_40XXemit_repeatXin_knowsXX_emit_loopsXisX1Xdedup_values | |
Given the modern graph | |
And using the parameter v3Id defined as "v[lop].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_repeatXrepeatXunionXout_uses_out_traversesXX_whereXloops_isX0X_timesX1X_timeX2X_name | |
Given the crew graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_repeatXa_outXknows_repeatXb_outXcreatedX_filterXloops_isX0XX_emit_lang | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX6X_repeatXa_bothXcreatedX_simplePathX_emitXrepeatXb_bothXknowsXX_untilXloopsXbX_asXb_whereXloopsXaX_asXbX_hasXname_vadasXX_dedup_name | |
Given the modern graph | |
And using the parameter v6Id defined as "v[peter].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_localXpropertiesXlocationX_order_byXvalueX_limitX2XX_value | |
Given the crew graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXlabel_personX_asXaX_localXoutXcreatedX_asXbXX_selectXa_bX_byXnameX_byXidX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_localXoutE_countX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_localXoutEXknowsX_limitX1XX_inV_name | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be of | |
And the result should have a count of 1 | |
Scenario: g_V_localXbothEXcreatedX_limitX1XX_otherV_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be of | |
And the result should have a count of 5 | |
Scenario: g_VX4X_localXbothEX1_createdX_limitX1XX | |
Given the modern graph | |
And using the parameter v4Id defined as "v[josh].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be of | |
And the result should have a count of 1 | |
Scenario: g_VX4X_localXbothEXknows_createdX_limitX1XX | |
Given the modern graph | |
And using the parameter v4Id defined as "v[josh].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be of | |
And the result should have a count of 1 | |
Scenario: g_VX4X_localXbothE_limitX1XX_otherV_name | |
Given the modern graph | |
And using the parameter v4Id defined as "v[josh].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be of | |
And the result should have a count of 1 | |
Scenario: g_VX4X_localXbothE_limitX2XX_otherV_name | |
Given the modern graph | |
And using the parameter v4Id defined as "v[josh].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be of | |
And the result should have a count of 2 | |
Scenario: g_V_localXinEXknowsX_limitX2XX_outV_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_localXmatchXproject__created_person__person_name_nameX_selectXname_projectX_by_byXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_branchXlabel_eq_person__a_bX_optionXa__ageX_optionXb__langX_optionXb__nameX | |
Given the modern graph | |
And using the parameter l1 defined as "c[it.get().label() == 'person' ? 'a' : 'b']" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_branchXlabel_isXpersonX_countX_optionX1__ageX_optionX0__langX_optionX0__nameX | |
Given the modern graph | |
And using the parameter one defined as "d[1].l" | |
And using the parameter zero defined as "d[0].l" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_branchXlabel_isXpersonX_countX_optionX1__ageX_optionX0__langX_optionX0__nameX_optionXany__labelX | |
Given the modern graph | |
And using the parameter one defined as "d[1].l" | |
And using the parameter zero defined as "d[0].l" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_branchXageX_optionXltX30X__youngX_optionXgtX30X__oldX_optionXnone__on_the_edgeX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_branchXidentityX_optionXhasLabelXsoftwareX__inXcreatedX_name_order_foldX_optionXhasXname_vadasX__ageX_optionXneqX123X__bothE_countX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX2X_optionalXoutXknowsXX | |
Given the modern graph | |
And using the parameter v2Id defined as "v[vadas].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX2X_optionalXinXknowsXX | |
Given the modern graph | |
And using the parameter v2Id defined as "v[vadas].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXpersonX_optionalXoutXknowsX_optionalXoutXcreatedXXX_path | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_optionalXout_optionalXoutXX_path | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_optionalXaddVXdogXX_label | |
Given the empty graph | |
And the graph initializer of | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
And the graph should return 7 for count of "g.V()" | |
Scenario: g_V_unionXout__inX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_unionXrepeatXoutX_timesX2X__outX_name | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_chooseXlabel_is_person__unionX__out_lang__out_nameX__in_labelX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_chooseXlabel_is_person__unionX__out_lang__out_nameX__in_labelX_groupCount | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_unionXrepeatXunionXoutXcreatedX__inXcreatedXX_timesX2X__repeatXunionXinXcreatedX__outXcreatedXX_timesX2XX_label_groupCount | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1_2X_unionXoutE_count__inE_count__outE_weight_sumX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter v2Id defined as "v[vadas].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1_2X_localXunionXoutE_count__inE_count__outE_weight_sumXX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter v2Id defined as "v[vadas].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1_2X_localXunionXcountXX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter v2Id defined as "v[vadas].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_chooseXout_countX_optionX2L_nameX_optionX3L_ageX | |
Given the modern graph | |
And using the parameter two defined as "d[2].l" | |
And using the parameter three defined as "d[3].l" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_chooseXlabel_eqXpersonX__outXknowsX__inXcreatedXX_name | |
Given the modern graph | |
And using the parameter l1 defined as "c[it.label() == 'person']" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_chooseXhasLabelXpersonX_and_outXcreatedX__outXknowsX__identityX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_chooseXlabelX_optionXblah__outXknowsXX_optionXbleep__outXcreatedXX_optionXnone__identityX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_chooseXoutXknowsX_count_isXgtX0XX__outXknowsXX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXpersonX_asXp1X_chooseXoutEXknowsX__outXknowsXX_asXp2X_selectXp1_p2X_byXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXpersonX_chooseXageX__optionX27L__constantXyoungXX_optionXnone__constantXoldXX_groupCount | |
Given the modern graph | |
And using the parameter d27 defined as "d[27].l" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_injectX1X_chooseXisX1X__constantX10Xfold__foldX | |
Given the empty graph | |
And using the parameter d10 defined as "d[10].i" | |
And using the parameter d1 defined as "d[1].i" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_injectX2X_chooseXisX1X__constantX10Xfold__foldX | |
Given the empty graph | |
And using the parameter d10 defined as "d[10].i" | |
And using the parameter d1 defined as "d[1].i" | |
And using the parameter d2 defined as "d[2].i" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_valueXnameX_aggregateXxX_capXxX | |
Given the modern graph | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_V_valueXnameX_aggregateXglobal_xX_capXxX | |
Given the modern graph | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_V_aggregateXxX_byXnameX_capXxX | |
Given the modern graph | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_V_out_aggregateXaX_path | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXpersonX_aggregateXxX_byXageX_capXxX_asXyX_selectXyX | |
Given the modern graph | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_V_aggregateXlocal_a_nameX_out_capXaX | |
Given the modern graph | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_VX1X_aggregateXlocal_aX_byXnameX_out_aggregateXlocal_aX_byXnameX_name_capXaX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_withSideEffectXa_setX_V_both_name_aggregateXlocal_aX_capXaX | |
Given the modern graph | |
And using the parameter initial defined as "s[]" | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_V_aggregateXlocal_aX_byXoutEXcreatedX_countX_out_out_aggregateXlocal_aX_byXinEXcreatedX_weight_sumX | |
Given the modern graph | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_withSackXhelloX_V_outE_sackXassignX_byXlabelX_inV_sack | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_withSackX0X_V_outE_sackXsumX_byXweightX_inV_sack_sum | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_withSackX0X_V_repeatXoutE_sackXsumX_byXweightX_inVX_timesX2X_sack | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_withBulkXfalseX_withSackX1_sumX_VX1X_localXoutEXknowsX_barrierXnormSackX_inVX_inXknowsX_barrier_sack | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_withBulkXfalseX_withSackX1_sumX_V_out_barrier_sack | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_withSackX1_sumX_VX1X_localXoutXknowsX_barrierXnormSackXX_inXknowsX_barrier_sack | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_withSackXBigInteger_TEN_powX1000X_assignX_V_localXoutXknowsX_barrierXnormSackXX_inXknowsX_barrier_sack | |
Given an unsupported test | |
Then nothing should happen because | |
Scenario: g_withSackXmap__map_cloneX_V_out_out_sackXmap_a_nameX_sack | |
Given an unsupported test | |
Then nothing should happen because | |
Scenario: g_withSackX2X_V_sackXdivX_byXconstantX3_0XX_sack | |
Given an unsupported test | |
Then nothing should happen because | |
Scenario: g_V_hasXageX_groupCountXaX_byXnameX_out_capXaX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_chooseXlabel_person__age_groupCountXaX__name_groupCountXbXX_capXa_bX | |
Given an unsupported test | |
Then nothing should happen because | |
Scenario: g_V_storeXa_nameX_out_capXaX | |
Given the modern graph | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_VX1X_storeXaX_byXnameX_out_storeXaX_byXnameX_name_capXaX | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_withSideEffectXa_setX_V_both_name_storeXaX_capXaX | |
Given the modern graph | |
And using the parameter initial defined as "s[]" | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_V_storeXaX_byXoutEXcreatedX_countX_out_out_storeXaX_byXinEXcreatedX_weight_sumX | |
Given the modern graph | |
And the traversal of | |
When iterated next | |
Then the result should be unordered | |
Scenario: g_V_group_byXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_group_byXageX | |
6) Given the modern graph (ignored) | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_group_byXnameX_by | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_groupXaX_byXnameX_capXaX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXlangX_groupXaX_byXlangX_byXnameX_out_capXaX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasXlangX_group_byXlangX_byXcountX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_repeatXout_groupXaX_byXnameX_byXcountX_timesX2X_capXaX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_group_byXoutE_countX_byXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_groupXaX_byXlabelX_byXoutE_weight_sumX_capXaX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_repeatXbothXfollowedByXX_timesX2X_group_byXsongTypeX_byXcountX | |
Given the grateful graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_repeatXbothXfollowedByXX_timesX2X_groupXaX_byXsongTypeX_byXcountX_capXaX | |
Given the grateful graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_group_byXname_substring_1X_byXconstantX1XX | |
Given the modern graph | |
And using the parameter l1 defined as "c[it.value('name').substring(0, 1)]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_groupXaX_byXname_substring_1X_byXconstantX1XX_capXaX | |
Given the modern graph | |
And using the parameter l1 defined as "c[it.value('name').substring(0, 1)]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_out_group_byXlabelX_selectXpersonX_unfold_outXcreatedX_name_limitX2X | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXsongX_group_byXnameX_byXproperties_groupCount_byXlabelXX | |
Given the grateful graph | |
And the traversal of | |
When iterated next | |
Then the result should have a count of 584 | |
Scenario: g_V_hasLabelXsongX_groupXaX_byXnameX_byXproperties_groupCount_byXlabelXX_out_capXaX | |
Given the grateful graph | |
And the traversal of | |
When iterated next | |
Then the result should have a count of 584 | |
Scenario: g_V_repeatXunionXoutXknowsX_groupXaX_byXageX__outXcreatedX_groupXbX_byXnameX_byXcountXX_groupXaX_byXnameXX_timesX2X_capXa_bX | |
Given an unsupported test | |
Then nothing should happen because | |
Scenario: g_V_group_byXbothE_countX_byXgroup_byXlabelXX | |
Given an unsupported test | |
Then nothing should happen because | |
Scenario: g_V_outXfollowedByX_group_byXsongTypeX_byXbothE_group_byXlabelX_byXweight_sumXX | |
Given the grateful graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_groupXmX_byXnameX_byXinXknowsX_nameX_capXmX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_group_byXlabelX_byXbothE_groupXaX_byXlabelX_byXweight_sumX_weight_sumX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_withSideEffectXa__marko_666_noone_blahX_V_groupXaX_byXnameX_byXoutE_label_foldX_capXaX | |
Given the modern graph | |
And using the parameter m defined as "m[{\"marko\":[666], \"noone\":[\"blah\"]}]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXpersonX_asXpX_outXcreatedX_group_byXnameX_byXselectXpX_valuesXageX_sumX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_hasLabelXpersonX_asXpX_outXcreatedX_groupXaX_byXnameX_byXselectXpX_valuesXageX_sumX_capXaX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_group_byXlabelX_byXlabel_countX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_groupXmX_byXlabelX_byXlabel_countX_capXmX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_outXcreatedX_groupCount_byXnameX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_outXcreatedX_name_groupCount | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_outXcreatedX_groupCountXaX_byXnameX_capXaX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_outXcreatedX_name_groupCountXaX_capXaX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_repeatXout_groupCountXaX_byXnameXX_timesX2X_capXaX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_both_groupCountXaX_byXlabelX_asXbX_barrier_whereXselectXaX_selectXsoftwareX_isXgtX2XXX_selectXbX_name | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_V_unionXoutXknowsX__outXcreatedX_inXcreatedXX_groupCount_selectXvaluesX_unfold_sum | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_hasXnoX_groupCount | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_hasXnoX_groupCountXaX_capXaX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_unionXrepeatXoutX_timesX2X_groupCountXmX_byXlangXX__repeatXinX_timesX2X_groupCountXmX_byXnameXX_capXmX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_outXcreatedX_groupCountXxX_capXxX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_groupCount_byXbothE_countX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be ordered | |
Scenario: g_V_both_groupCountXaX_out_capXaX_selectXkeysX_unfold_both_groupCountXaX_capXaX | |
Given the modern graph | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_out_injectXv2X_name | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter v2 defined as "v[vadas]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_out_name_injectXdanielX_asXaX_mapXlengthX_path | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter c defined as "c[it.get().length()]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_VX1X_injectXg_VX4XX_out_name | |
Given the modern graph | |
And using the parameter v1Id defined as "v[marko].id" | |
And using the parameter v4 defined as "v[josh]" | |
And the traversal of | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_injectXnull_1_3_nullX | |
Given the empty graph | |
7) And the traversal of (failed) | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_injectX10_20_null_20_10_10X_groupCountXxX_dedup_asXyX_projectXa_bX_by_byXselectXxX_selectXselectXyXXX | |
Given the empty graph | |
8) And the traversal of (failed) | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_injectXname_marko_age_nullX_selectXname_ageX | |
Given the empty graph | |
And using the parameter m defined as "m[{\"name\":\"marko\", \"age\":null}]" | |
9) And the traversal of (failed) | |
When iterated to list | |
Then the result should be unordered | |
Scenario: g_io_writeXkryoX | |
Given an unsupported test | |
Then nothing should happen because | |
Scenario: g_io_write_withXwriter_gryoX | |
Given an unsupported test | |
Then nothing should happen because | |
Scenario: g_io_writeXgraphsonX | |
Given an unsupported test | |
Then nothing should happen because | |
Scenario: g_io_write_withXwriter_graphsonX | |
Given an unsupported test | |
Then nothing should happen because | |
Scenario: g_io_writeXgraphmlX | |
Given an unsupported test | |
Then nothing should happen because | |
Scenario: g_io_write_withXwriter_graphmlX | |
Given an unsupported test | |
Then nothing should happen because | |
Scenario: g_io_readXkryoX | |
Given the empty graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
And the graph should return 6 for count of "g.V()" | |
And the graph should return 6 for count of "g.E()" | |
Scenario: g_io_read_withXreader_gryoX | |
Given the empty graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
And the graph should return 6 for count of "g.V()" | |
And the graph should return 6 for count of "g.E()" | |
Scenario: g_io_readXgraphsonX | |
Given the empty graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
And the graph should return 6 for count of "g.V()" | |
And the graph should return 6 for count of "g.E()" | |
Scenario: g_io_read_withXreader_graphsonX | |
Given the empty graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
And the graph should return 6 for count of "g.V()" | |
And the graph should return 6 for count of "g.E()" | |
Scenario: g_io_readXgraphmlX | |
Given the empty graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
And the graph should return 6 for count of "g.V()" | |
And the graph should return 6 for count of "g.E()" | |
Scenario: g_io_read_withXreader_graphmlX | |
Given the empty graph | |
And the traversal of | |
When iterated to list | |
Then the result should be empty | |
And the graph should return 6 for count of "g.V()" | |
And the graph should return 6 for count of "g.E()" | |
Failures and skipped scenarios: | |
1) g_V_constantXnullX: Failed | |
System.Reflection.TargetInvocationException: Exception has been thrown by the target of an invocation. | |
---> System.ArgumentNullException: Value cannot be null. (Parameter 'key') | |
at System.Collections.Generic.Dictionary`2.FindEntry(TKey key) | |
at System.Collections.Generic.Dictionary`2.TryGetValue(TKey key, TValue& value) | |
at Gremlin.Net.Process.Traversal.Bindings.GetBoundVariable[TV](TV value) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bindings.cs:line 66 | |
at Gremlin.Net.Process.Traversal.Bytecode.ConvertArgument(Object argument, Boolean searchBindings) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 113 | |
at Gremlin.Net.Process.Traversal.Bytecode.FlattenArguments(Object[] arguments) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 105 | |
at Gremlin.Net.Process.Traversal.Bytecode.AddStep(String stepName, Object[] args) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 88 | |
at Gremlin.Net.Process.Traversal.GraphTraversal`2.Constant[E2](E2 e) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversal.cs:line 440 | |
--- End of inner exception stack trace --- | |
at System.RuntimeMethodHandle.InvokeMethod(Object target, Object[] arguments, Signature sig, Boolean constructor, Boolean wrapExceptions) | |
at System.Reflection.RuntimeMethodInfo.Invoke(Object obj, BindingFlags invokeAttr, Binder binder, Object[] parameters, CultureInfo culture) | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.GetTraversalFromTokens(IList`1 tokens, GraphTraversalSource g, IDictionary`2 contextParameterValues, String traversalText) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 78 | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.GetTraversal(String traversalText, GraphTraversalSource g, IDictionary`2 contextParameterValues) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 69 | |
at Gremlin.Net.IntegrationTest.Gherkin.CommonSteps.TranslateTraversal(String traversalText) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/CommonSteps.cs:line 108 | |
2) g_V_outE_propertyXweight_nullX: Failed | |
System.Reflection.TargetInvocationException: Exception has been thrown by the target of an invocation. | |
---> System.ArgumentNullException: Value cannot be null. (Parameter 'key') | |
at System.Collections.Generic.Dictionary`2.FindEntry(TKey key) | |
at System.Collections.Generic.Dictionary`2.TryGetValue(TKey key, TValue& value) | |
at Gremlin.Net.Process.Traversal.Bindings.GetBoundVariable[TV](TV value) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bindings.cs:line 66 | |
at Gremlin.Net.Process.Traversal.Bytecode.ConvertArgument(Object argument, Boolean searchBindings) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 113 | |
at Gremlin.Net.Process.Traversal.Bytecode.FlattenArguments(Object[] arguments) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 105 | |
at Gremlin.Net.Process.Traversal.Bytecode.AddStep(String stepName, Object[] args) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 89 | |
at Gremlin.Net.Process.Traversal.GraphTraversal`2.Property(Object key, Object value, Object[] keyValues) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversal.cs:line 1277 | |
--- End of inner exception stack trace --- | |
at System.RuntimeMethodHandle.InvokeMethod(Object target, Object[] arguments, Signature sig, Boolean constructor, Boolean wrapExceptions) | |
at System.Reflection.RuntimeMethodInfo.Invoke(Object obj, BindingFlags invokeAttr, Binder binder, Object[] parameters, CultureInfo culture) | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.GetTraversalFromTokens(IList`1 tokens, GraphTraversalSource g, IDictionary`2 contextParameterValues, String traversalText) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 78 | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.GetTraversal(String traversalText, GraphTraversalSource g, IDictionary`2 contextParameterValues) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 69 | |
at Gremlin.Net.IntegrationTest.Gherkin.CommonSteps.TranslateTraversal(String traversalText) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/CommonSteps.cs:line 108 | |
3) g_V_mapXconstantXnullXX: Failed | |
System.Reflection.TargetInvocationException: Exception has been thrown by the target of an invocation. | |
---> System.ArgumentNullException: Value cannot be null. (Parameter 'key') | |
at System.Collections.Generic.Dictionary`2.FindEntry(TKey key) | |
at System.Collections.Generic.Dictionary`2.TryGetValue(TKey key, TValue& value) | |
at Gremlin.Net.Process.Traversal.Bindings.GetBoundVariable[TV](TV value) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bindings.cs:line 66 | |
at Gremlin.Net.Process.Traversal.Bytecode.ConvertArgument(Object argument, Boolean searchBindings) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 113 | |
at Gremlin.Net.Process.Traversal.Bytecode.FlattenArguments(Object[] arguments) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 105 | |
at Gremlin.Net.Process.Traversal.Bytecode.AddStep(String stepName, Object[] args) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 89 | |
at Gremlin.Net.Process.Traversal.GraphTraversal`2.Constant[E2](E2 e) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversal.cs:line 440 | |
at Gremlin.Net.Process.Traversal.__.Constant[E2](E2 a) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/__.cs:line 278 | |
--- End of inner exception stack trace --- | |
at System.RuntimeMethodHandle.InvokeMethod(Object target, Object[] arguments, Signature sig, Boolean constructor, Boolean wrapExceptions) | |
at System.Reflection.RuntimeMethodInfo.Invoke(Object obj, BindingFlags invokeAttr, Binder binder, Object[] parameters, CultureInfo culture) | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.GetTraversalFromTokens(IList`1 tokens, GraphTraversalSource g, IDictionary`2 contextParameterValues, String traversalText) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 78 | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.StaticTraversalParameter.GetValue() in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/StaticTraversalParameter.cs:line 64 | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.BuildParameters(MethodInfo method, Token token, IDictionary`2& genericParameterTypes) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 247 | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.GetTraversalFromTokens(IList`1 tokens, GraphTraversalSource g, IDictionary`2 contextParameterValues, String traversalText) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 78 | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.GetTraversal(String traversalText, GraphTraversalSource g, IDictionary`2 contextParameterValues) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 69 | |
at Gremlin.Net.IntegrationTest.Gherkin.CommonSteps.TranslateTraversal(String traversalText) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/CommonSteps.cs:line 108 | |
4) g_V_hasLabelXpersonX_propertyXname_nullX: Failed | |
System.Reflection.TargetInvocationException: Exception has been thrown by the target of an invocation. | |
---> System.ArgumentNullException: Value cannot be null. (Parameter 'key') | |
at System.Collections.Generic.Dictionary`2.FindEntry(TKey key) | |
at System.Collections.Generic.Dictionary`2.TryGetValue(TKey key, TValue& value) | |
at Gremlin.Net.Process.Traversal.Bindings.GetBoundVariable[TV](TV value) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bindings.cs:line 66 | |
at Gremlin.Net.Process.Traversal.Bytecode.ConvertArgument(Object argument, Boolean searchBindings) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 113 | |
at Gremlin.Net.Process.Traversal.Bytecode.FlattenArguments(Object[] arguments) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 105 | |
at Gremlin.Net.Process.Traversal.Bytecode.AddStep(String stepName, Object[] args) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 89 | |
at Gremlin.Net.Process.Traversal.GraphTraversal`2.Property(Object key, Object value, Object[] keyValues) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversal.cs:line 1277 | |
--- End of inner exception stack trace --- | |
at System.RuntimeMethodHandle.InvokeMethod(Object target, Object[] arguments, Signature sig, Boolean constructor, Boolean wrapExceptions) | |
at System.Reflection.RuntimeMethodInfo.Invoke(Object obj, BindingFlags invokeAttr, Binder binder, Object[] parameters, CultureInfo culture) | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.GetTraversalFromTokens(IList`1 tokens, GraphTraversalSource g, IDictionary`2 contextParameterValues, String traversalText) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 78 | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.GetTraversal(String traversalText, GraphTraversalSource g, IDictionary`2 contextParameterValues) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 69 | |
at Gremlin.Net.IntegrationTest.Gherkin.CommonSteps.TranslateTraversal(String traversalText) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/CommonSteps.cs:line 108 | |
5) g_addVXnullX_propertyXid_nullX: Failed | |
System.Reflection.TargetInvocationException: Exception has been thrown by the target of an invocation. | |
---> System.ArgumentNullException: Value cannot be null. (Parameter 'key') | |
at System.Collections.Generic.Dictionary`2.FindEntry(TKey key) | |
at System.Collections.Generic.Dictionary`2.TryGetValue(TKey key, TValue& value) | |
at Gremlin.Net.Process.Traversal.Bindings.GetBoundVariable[TV](TV value) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bindings.cs:line 66 | |
at Gremlin.Net.Process.Traversal.Bytecode.ConvertArgument(Object argument, Boolean searchBindings) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 113 | |
at Gremlin.Net.Process.Traversal.Bytecode.FlattenArguments(Object[] arguments) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 105 | |
at Gremlin.Net.Process.Traversal.Bytecode.AddStep(String stepName, Object[] args) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 89 | |
at Gremlin.Net.Process.Traversal.GraphTraversalSource.AddV(ITraversal vertexLabelTraversal) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversalSource.cs:line 337 | |
--- End of inner exception stack trace --- | |
at System.RuntimeMethodHandle.InvokeMethod(Object target, Object[] arguments, Signature sig, Boolean constructor, Boolean wrapExceptions) | |
at System.Reflection.RuntimeMethodInfo.Invoke(Object obj, BindingFlags invokeAttr, Binder binder, Object[] parameters, CultureInfo culture) | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.GetTraversalFromTokens(IList`1 tokens, GraphTraversalSource g, IDictionary`2 contextParameterValues, String traversalText) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 78 | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.GetTraversal(String traversalText, GraphTraversalSource g, IDictionary`2 contextParameterValues) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 69 | |
at Gremlin.Net.IntegrationTest.Gherkin.CommonSteps.TranslateTraversal(String traversalText) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/CommonSteps.cs:line 108 | |
6) g_V_group_byXageX: Scenario ignored | |
7) g_injectXnull_1_3_nullX: Failed | |
System.Reflection.TargetInvocationException: Exception has been thrown by the target of an invocation. | |
---> System.ArgumentNullException: Value cannot be null. (Parameter 'key') | |
at System.Collections.Generic.Dictionary`2.FindEntry(TKey key) | |
at System.Collections.Generic.Dictionary`2.TryGetValue(TKey key, TValue& value) | |
at Gremlin.Net.Process.Traversal.Bindings.GetBoundVariable[TV](TV value) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bindings.cs:line 66 | |
at Gremlin.Net.Process.Traversal.Bytecode.ConvertArgument(Object argument, Boolean searchBindings) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 113 | |
at Gremlin.Net.Process.Traversal.Bytecode.FlattenArguments(Object[] arguments) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 105 | |
at Gremlin.Net.Process.Traversal.Bytecode.AddStep(String stepName, Object[] args) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 89 | |
at Gremlin.Net.Process.Traversal.GraphTraversalSource.Inject[S](S[] starts) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversalSource.cs:line 350 | |
--- End of inner exception stack trace --- | |
at System.RuntimeMethodHandle.InvokeMethod(Object target, Object[] arguments, Signature sig, Boolean constructor, Boolean wrapExceptions) | |
at System.Reflection.RuntimeMethodInfo.Invoke(Object obj, BindingFlags invokeAttr, Binder binder, Object[] parameters, CultureInfo culture) | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.GetTraversalFromTokens(IList`1 tokens, GraphTraversalSource g, IDictionary`2 contextParameterValues, String traversalText) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 78 | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.GetTraversal(String traversalText, GraphTraversalSource g, IDictionary`2 contextParameterValues) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 69 | |
at Gremlin.Net.IntegrationTest.Gherkin.CommonSteps.TranslateTraversal(String traversalText) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/CommonSteps.cs:line 106 | |
8) g_injectX10_20_null_20_10_10X_groupCountXxX_dedup_asXyX_projectXa_bX_by_byXselectXxX_selectXselectXyXXX: Failed | |
System.ArgumentNullException: Value cannot be null. (Parameter 'key') | |
at System.Collections.Generic.Dictionary`2.FindEntry(TKey key) | |
at System.Collections.Generic.Dictionary`2.TryGetValue(TKey key, TValue& value) | |
at Gremlin.Net.Process.Traversal.Bindings.GetBoundVariable[TV](TV value) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bindings.cs:line 66 | |
at Gremlin.Net.Process.Traversal.Bytecode.ConvertArgument(Object argument, Boolean searchBindings) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 113 | |
at Gremlin.Net.Process.Traversal.Bytecode.FlattenArguments(Object[] arguments) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 105 | |
at Gremlin.Net.Process.Traversal.Bytecode.AddStep(String stepName, Object[] args) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 89 | |
at Gremlin.Net.Process.Traversal.GraphTraversalSource.Inject[S](S[] starts) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversalSource.cs:line 350 | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.<>c.<.cctor>b__23_1(GraphTraversalSource g) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 41 | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.GetTraversal(String traversalText, GraphTraversalSource g, IDictionary`2 contextParameterValues) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 69 | |
at Gremlin.Net.IntegrationTest.Gherkin.CommonSteps.TranslateTraversal(String traversalText) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/CommonSteps.cs:line 106 | |
9) g_injectXname_marko_age_nullX_selectXname_ageX: Failed | |
System.ArgumentNullException: Value cannot be null. (Parameter 'key') | |
at System.Collections.Generic.Dictionary`2.FindEntry(TKey key) | |
at System.Collections.Generic.Dictionary`2.TryGetValue(TKey key, TValue& value) | |
at Gremlin.Net.Process.Traversal.Bindings.GetBoundVariable[TV](TV value) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bindings.cs:line 66 | |
at Gremlin.Net.Process.Traversal.Bytecode.ConvertArgument(Object argument, Boolean searchBindings) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 113 | |
at Gremlin.Net.Process.Traversal.Bytecode.ConvertArgument(Object argument, Boolean searchBindings) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 133 | |
at Gremlin.Net.Process.Traversal.Bytecode.FlattenArguments(Object[] arguments) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 105 | |
at Gremlin.Net.Process.Traversal.Bytecode.AddStep(String stepName, Object[] args) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/Bytecode.cs:line 89 | |
at Gremlin.Net.Process.Traversal.GraphTraversalSource.Inject[S](S[] starts) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/src/Gremlin.Net/Process/Traversal/GraphTraversalSource.cs:line 350 | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.<>c.<.cctor>b__23_2(GraphTraversalSource g) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 42 | |
at Gremlin.Net.IntegrationTest.Gherkin.TraversalEvaluation.TraversalParser.GetTraversal(String traversalText, GraphTraversalSource g, IDictionary`2 contextParameterValues) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/TraversalEvaluation/TraversalParser.cs:line 69 | |
at Gremlin.Net.IntegrationTest.Gherkin.CommonSteps.TranslateTraversal(String traversalText) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/CommonSteps.cs:line 106 | |
----------------- | |
Total scenarios: 631. Passed: 622. Failed: 8. Skipped: 1. | |
[39;49m[31m[xUnit.net 00:00:16.4480978] Gremlin.Net.IntegrationTest.Gherkin.GherkinTestRunner.RunGherkinBasedTests [FAIL] | |
[39;49m[39;49m[31m X [39;49mGremlin.Net.IntegrationTest.Gherkin.GherkinTestRunner.RunGherkinBasedTests [14s 175ms] | |
[39;49m[31m Error Message: | |
[39;49m[39;49m[31m System.Exception : Gherkin test failed, see summary above for more detail | |
[39;49m[39;49m[31m Stack Trace: | |
[39;49m[39;49m[31m at Gremlin.Net.IntegrationTest.Gherkin.GherkinTestRunner.OutputResults(List`1 results) in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/GherkinTestRunner.cs:line 185 | |
at Gremlin.Net.IntegrationTest.Gherkin.GherkinTestRunner.RunGherkinBasedTests() in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest/Gherkin/GherkinTestRunner.cs:line 124 | |
[39;49m | |
[39;49m[31mTest Run Failed. | |
[39;49m[39;49mTotal tests: 95 | |
[39;49m[39;49m[32m Passed: 84 | |
[39;49m[39;49m[31m Failed: 1 | |
[39;49m[39;49m[33m Skipped: 10 | |
[39;49m[39;49m Total time: 17.7732 Seconds | |
[39;49m[?1h=[?1h=[INFO] | |
[INFO] --- gmavenplus-plugin:1.9.0:execute (gremlin-server-stop) @ gremlin-dotnet-tests --- | |
[INFO] Using plugin classloader, includes GMavenPlus classpath. | |
[INFO] Using Groovy 3.0.3 to perform execute. | |
[INFO] Running Groovy script from /home/travis/build/apache/tinkerpop/gremlin-server/src/test/scripts/test-server-stop.groovy. | |
[INFO] Tests for native Apache TinkerPop :: Gremlin.Net - Tests complete | |
[INFO] Shutting down GremlinServer localhost:45940 | |
[INFO] Shutting down OpProcessor[] | |
[INFO] Shutting down OpProcessor[session] | |
[INFO] Shutting down OpProcessor[traversal] | |
[INFO] Shutting down thread pools. | |
[INFO] Executing shutdown LifeCycleHook | |
[INFO] Closed Graph instance [grateful] | |
[INFO] Closed Graph instance [classic] | |
[INFO] Closed Graph instance [modern] | |
[INFO] Closed Graph instance [sink] | |
[INFO] Closed Graph instance [graph] | |
[INFO] Closed Graph instance [crew] | |
[INFO] Gremlin Server - shutdown complete | |
[INFO] Shutting down GremlinServer localhost:45941 | |
[INFO] Shutting down OpProcessor[] | |
[INFO] Shutting down OpProcessor[session] | |
[INFO] Shutting down OpProcessor[traversal] | |
[INFO] Shutting down thread pools. | |
[INFO] Executing shutdown LifeCycleHook | |
[INFO] Closed Graph instance [grateful] | |
[INFO] Closed Graph instance [classic] | |
[INFO] Closed Graph instance [modern] | |
[INFO] Closed Graph instance [sink] | |
[INFO] Closed Graph instance [graph] | |
[INFO] Closed Graph instance [crew] | |
[INFO] Gremlin Server - shutdown complete | |
[INFO] All Gremlin Server instances are shutdown for Apache TinkerPop :: Gremlin.Net - Tests | |
[INFO] | |
[INFO] --- dotnet-maven-plugin:0.24:integration-test-verify (default-integration-test-verify) @ gremlin-dotnet-tests --- | |
[WARNING] org.apache.maven.plugin.MojoFailureException: Command (in /home/travis/build/apache/tinkerpop/gremlin-dotnet/test/Gremlin.Net.IntegrationTest) [dotnet, test, -c, Release] returned non-zero exit code: 1 | |
[WARNING] at org.eobjects.build.PluginHelper.executeCommand(PluginHelper.java:161) | |
[WARNING] at org.eobjects.build.AbstractDotnetTestMojo.executeInternal(AbstractDotnetTestMojo.java:41) | |
[WARNING] at org.eobjects.build.DotnetIntegrationTestRunMojo.execute(DotnetIntegrationTestRunMojo.java:31) | |
[WARNING] at org.apache.maven.plugin.DefaultBuildPluginManager.executeMojo(DefaultBuildPluginManager.java:134) | |
[WARNING] at org.apache.maven.lifecycle.internal.MojoExecutor.execute(MojoExecutor.java:207) | |
[WARNING] at org.apache.maven.lifecycle.internal.MojoExecutor.execute(MojoExecutor.java:153) | |
[WARNING] at org.apache.maven.lifecycle.internal.MojoExecutor.execute(MojoExecutor.java:145) | |
[WARNING] at org.apache.maven.lifecycle.internal.LifecycleModuleBuilder.buildProject(LifecycleModuleBuilder.java:116) | |
[WARNING] at org.apache.maven.lifecycle.internal.LifecycleModuleBuilder.buildProject(LifecycleModuleBuilder.java:80) | |
[WARNING] at org.apache.maven.lifecycle.internal.builder.singlethreaded.SingleThreadedBuilder.build(SingleThreadedBuilder.java:51) | |
[WARNING] at org.apache.maven.lifecycle.internal.LifecycleStarter.execute(LifecycleStarter.java:128) | |
[WARNING] at org.apache.maven.DefaultMaven.doExecute(DefaultMaven.java:307) | |
[WARNING] at org.apache.maven.DefaultMaven.doExecute(DefaultMaven.java:193) | |
[WARNING] at org.apache.maven.DefaultMaven.execute(DefaultMaven.java:106) | |
[WARNING] at org.apache.maven.cli.MavenCli.execute(MavenCli.java:863) | |
[WARNING] at org.apache.maven.cli.MavenCli.doMain(MavenCli.java:288) | |
[WARNING] at org.apache.maven.cli.MavenCli.main(MavenCli.java:199) | |
[WARNING] at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method) | |
[WARNING] at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) | |
[WARNING] at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) | |
[WARNING] at java.lang.reflect.Method.invoke(Method.java:498) | |
[WARNING] at org.codehaus.plexus.classworlds.launcher.Launcher.launchEnhanced(Launcher.java:289) | |
[WARNING] at org.codehaus.plexus.classworlds.launcher.Launcher.launch(Launcher.java:229) | |
[WARNING] at org.codehaus.plexus.classworlds.launcher.Launcher.mainWithExitCode(Launcher.java:415) | |
[WARNING] at org.codehaus.plexus.classworlds.launcher.Launcher.main(Launcher.java:356) | |
[INFO] ------------------------------------------------------------------------ | |
[INFO] Reactor Summary: | |
[INFO] | |
[INFO] Apache TinkerPop :: Gremlin.Net .................... SUCCESS [ 10.511 s] | |
[INFO] Apache TinkerPop :: Gremlin.Net - Tests ............ FAILURE [01:10 min] | |
[INFO] ------------------------------------------------------------------------ | |
[INFO] BUILD FAILURE | |
[INFO] ------------------------------------------------------------------------ | |
[INFO] Total time: 01:21 min | |
[INFO] Finished at: 2020-06-10T11:16:17+00:00 | |
[INFO] Final Memory: 91M/784M | |
[INFO] ------------------------------------------------------------------------ | |
[ERROR] Failed to execute goal org.eobjects.build:dotnet-maven-plugin:0.24:integration-test-verify (default-integration-test-verify) on project gremlin-dotnet-tests: Dotnet integration tests failed -> [Help 1] | |
[ERROR] | |
[ERROR] To see the full stack trace of the errors, re-run Maven with the -e switch. | |
[ERROR] Re-run Maven using the -X switch to enable full debug logging. | |
[ERROR] | |
[ERROR] For more information about the errors and possible solutions, please read the following articles: | |
[ERROR] [Help 1] http://cwiki.apache.org/confluence/display/MAVEN/MojoFailureException | |
[ERROR] | |
[ERROR] After correcting the problems, you can resume the build with the command | |
[ERROR] mvn <goals> -rf :gremlin-dotnet-tests | |
travis_time:end:1443953d:start=1591787248939905506,finish=1591787778062717826,duration=529122812320,event=script | |
[0K[31;1mThe command "touch gremlin-dotnet/src/.glv && touch gremlin-dotnet/test/.glv && mvn clean install -q -DskipTests && mvn verify -pl :gremlin-dotnet,:gremlin-dotnet-tests -P gremlin-dotnet" exited with 1.[0m | |
travis_fold:start:cache.2 | |
[0Kstore build cache | |
travis_time:start:33441c09 | |
[0Ktravis_time:end:33441c09:start=1591787778067746602,finish=1591787778070923293,duration=3176691,event=cache | |
[0Ktravis_time:start:1dc98f44 | |
[0K[32;1mnothing changed[0m | |
travis_time:end:1dc98f44:start=1591787778075524639,finish=1591787779071839048,duration=996314409,event=cache | |
[0Ktravis_fold:end:cache.2 | |
[0K | |
Done. Your build exited with 1. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment