[
https://issues.apache.org/jira/browse/TINKERPOP-2263?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
stephen mallette closed TINKERPOP-2263.
---------------------------------------
Resolution: Invalid
For usage questions please utilize the Gremlin Users mailing list:
https://groups.google.com/forum/#!forum/gremlin-users
As a quick answer though to your question though, I will say that:
1. I'm not aware of anyone using TinkerGraph on Android (though I suppose
someone could be)
2. Nothing has been done in the development of TinkerGraph to consider the
Android environment
I'm also not terribly knowledgeable about Android development to say whether
TinkerGraph is Android ready. As for GC problems I've not known TinkerGraph to
have such issues but I've not run it in a resource constrained environment so
it's hard to say. If you experiment further and wish to share your findings on
the gremlin-users list it might help others who are trying to do the same as
you. Also, perhaps posting your question there might yield some answers from
people who have tried doing this before. Thanks!
> Could TinkerGraph be used in Android?
> -------------------------------------
>
> Key: TINKERPOP-2263
> URL: https://issues.apache.org/jira/browse/TINKERPOP-2263
> Project: TinkerPop
> Issue Type: Bug
> Reporter: Guocheng Zhu
> Priority: Major
>
> *I have a project that want to use in-memory graph database in Android. I use
> to tinkerGraph, but I meet GC problem for a while. Will the following
> statement cause a lot of GC?*
> 1）List<Vertex> children = g.V(id).out("HAS").has("state",
> statId).not(in("NEXT").has("state",
> statId)).union(identity(),repeat(out("NEXT").has("state",
> statId)).emit()).toList();
> 2）g.V(id).out("Visible").repeat(out("HAS")).emit().or(has("package",
> "com.android.settings").has("text", P.within(forbidList)),has("class",
> "android.widget.CheckBox")
> ).repeat(in("HAS")).until(in("HAS").has("class",
> "android.widget.ListView")).repeat(out("HAS"))
> .emit().property("forbid", "true").iterate();
> 3）path = g.withComputer().V(v).shortestPath().with(ShortestPath.edges,
> Direction.OUT).with(target, __.hasId(id)).simplePath().next();
>
>
--
This message was sent by Atlassian JIRA
(v7.6.14#76016)
