[
https://issues.apache.org/jira/browse/TINKERPOP-1985?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel=16519851#comment-16519851
]
ASF GitHub Bot commented on TINKERPOP-1985:
---
GitHub user spmallette opened a pull request:
GitHub user spmallette opened a pull request:
https://github.com/apache/tinkerpop/pull/884
TINKERPOP-1985 Changing position on bulk import/export
https://issues.apache.org/jira/browse/TINKERPOP-1985
Deprecated `BulkLoaderVertexProgram` and `BulkDumperVertexProgram`. BLVP is
[
https://issues.apache.org/jira/browse/TINKERPOP-1990?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel=16519792#comment-16519792
]
ASF GitHub Bot commented on TINKERPOP-1990:
---
Github user spmallette commented on the issue:
Github user spmallette commented on the issue:
https://github.com/apache/tinkerpop/pull/882
I will try to find some time to do TINKERPOP-1991 and see what is involved.
If it's a mess then maybe we don't try to shove TINKERPOP-1991 into 3.4.0 and
await 3.5.0 then just merge
GitHub user spmallette opened a pull request:
https://github.com/apache/tinkerpop/pull/883
TINKERPOP-1864 Run python glv tests on GraphSON 2.0 and 3.0
https://issues.apache.org/jira/browse/TINKERPOP-1864
There was about a 10 second time increase for adding the additional
[
https://issues.apache.org/jira/browse/TINKERPOP-1990?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel=16519740#comment-16519740
]
ASF GitHub Bot commented on TINKERPOP-1990:
---
GitHub user dkuppitz opened a pull request:
GitHub user dkuppitz opened a pull request:
https://github.com/apache/tinkerpop/pull/882
TINKERPOP-1990 Add a shortestPath() step
Implemented `ShortestPathVertexProgram` and `ShortestPathVertexProgramStep`.
`docker/build.sh -t -i -n -d` passed.
VOTE: +1
I
> Also, wouldn't you need to configure a serializer for
'DseGraph.searchType'?
that's the nice part of with() - internally that falls into a standard Map
in bytecode and no serialization hassles. it still leaves the graph
provider to expose a "DseGraph" type of class, but at least there is
No, that makes it non-portable, provider-specific. That is, I can't
cut-n-paste that from one graph db to the next. Also, wouldn't you need to
configure a serializer for 'DseGraph.searchType'?
I think we can start with a small, simple set.
startsWith(String)
startsWith(Search,String)
Just thinking out loud here, but i wonder if we could keep our predicate
list more or less as-is, but then use with() to modulate a has() to be
provider specific:
g.V().
has('longText',eq("a.*").
with(DseGraph.searchType, tokenRegex)
In other words, this would be the standard way that
stephen mallette created TINKERPOP-1991:
---
Summary: Algorithm DSL
Key: TINKERPOP-1991
URL: https://issues.apache.org/jira/browse/TINKERPOP-1991
Project: TinkerPop
Issue Type:
Create an issue in JIRA for this:
https://issues.apache.org/jira/browse/TINKERPOP-1991
On Fri, Jun 1, 2018 at 4:35 PM Stephen Mallette
wrote:
> Right now we have pageRank() and peerPressure() just sorta hanging out in
> our core traversal API, but they really don't fit well there. Plus, as we
Daniel Kuppitz created TINKERPOP-1990:
-
Summary: Add a shortestPath() step
Key: TINKERPOP-1990
URL: https://issues.apache.org/jira/browse/TINKERPOP-1990
Project: TinkerPop
Issue Type:
[
https://issues.apache.org/jira/browse/TINKERPOP-967?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel=16519611#comment-16519611
]
ASF GitHub Bot commented on TINKERPOP-967:
--
Github user spmallette commented on the issue:
Github user spmallette commented on the issue:
https://github.com/apache/tinkerpop/pull/876
Some more notes from Marko (i haven't had a chance to let them sink in
myself, just pasting them here):
```text
times(a,2) == loops(a,eq(2))
```
the idea being, you
[
https://issues.apache.org/jira/browse/TINKERPOP-1365?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel=16519422#comment-16519422
]
ASF GitHub Bot commented on TINKERPOP-1365:
---
GitHub user spmallette opened a pull request:
GitHub user spmallette opened a pull request:
https://github.com/apache/tinkerpop/pull/881
TINKERPOP-1365 Refactored use of Random in tests
Each test suite now uses the same instance of Random which prints the seed
given to it so that if there is a failure, we can easily try to
[
https://issues.apache.org/jira/browse/TINKERPOP-1365?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
stephen mallette updated TINKERPOP-1365:
Summary: Log the seed used to initialize Random in tests (was: Eliminate
Hi,
I'm new about Java gremlin. I need an help on gremlin over OrientDB.
This is my scenario:
On my graph I have 2 Vertex classes, type A and type B.
Let A is a Vertex of type A and it is linked to 0 or more Vertices of type B.
So now I need to find both any A (filtering by a field of A) and
[
https://issues.apache.org/jira/browse/TINKERPOP-967?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel=16519114#comment-16519114
]
ASF GitHub Bot commented on TINKERPOP-967:
--
Github user GCHQResearcher1337 commented on the
Github user GCHQResearcher1337 commented on the issue:
https://github.com/apache/tinkerpop/pull/876
@spamallete I think I steered away from that because I initially
misunderstood what marko meant - as you pointed out the plumbing (`incrLoops`
taking a `stepLabel`) for nested repeats
Github user jorgebay commented on the issue:
https://github.com/apache/tinkerpop/pull/880
lgtm, VOTE +1
---
[
https://issues.apache.org/jira/browse/TINKERPOP-1989?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel=16518997#comment-16518997
]
ASF GitHub Bot commented on TINKERPOP-1989:
---
Github user jorgebay commented on the issue:
23 matches
Mail list logo