This is an automated email from the ASF dual-hosted git repository. afs pushed a commit to branch main in repository https://gitbox.apache.org/repos/asf/jena.git
commit 802b05ec9a25818319f964c45d7b52b66a37fa10 Author: Andy Seaborne <[email protected]> AuthorDate: Wed May 13 09:12:48 2026 +0100 Update javadoc (GraphMem) --- .../src/main/java/org/apache/jena/mem/GraphMemFast.java | 16 ++++++++-------- .../main/java/org/apache/jena/mem/GraphMemLegacy.java | 7 +++++-- 2 files changed, 13 insertions(+), 10 deletions(-) diff --git a/jena-core/src/main/java/org/apache/jena/mem/GraphMemFast.java b/jena-core/src/main/java/org/apache/jena/mem/GraphMemFast.java index bf765ed8f9..873ff0daa9 100644 --- a/jena-core/src/main/java/org/apache/jena/mem/GraphMemFast.java +++ b/jena-core/src/main/java/org/apache/jena/mem/GraphMemFast.java @@ -27,14 +27,14 @@ import org.apache.jena.mem.store.fast.FastTripleStore; /** * A graph that stores triples in memory. This class is not thread-safe. * <p> - * Purpose: GraphMem2Fast is a strong candidate for becoming the new default in-memory graph in the upcoming Jena 5, - * thanks to its improved performance and relatively minor increase in memory usage. - * <p> - * Faster than {@link GraphMemLegacy} (specially Graph#add, Graph#find and Graph#stream) - * Removing triples is a bit slower than {@link GraphMemLegacy}. - * Memory consumption is about 6-35% higher than {@link GraphMemLegacy} - * Maps and sets are based on {@link org.apache.jena.mem.collection.FastHashBase} - * Benefits from multiple small optimizations. (see: {@link FastTripleStore}) + * Compared to {@link GraphMemLegacy}: + * <ul> + * <li>Faster than {@link GraphMemLegacy} (specially Graph#add, Graph#find and Graph#stream) + * <li>Removing triples is a bit slower than {@link GraphMemLegacy}. + * <li>Memory consumption is about 6-35% higher than {@link GraphMemLegacy} + * <li>Maps and sets are based on {@link org.apache.jena.mem.collection.FastHashBase} + * <li>Benefits from multiple small optimizations. (see: {@link FastTripleStore}) + * </ul> * <p> * The heritage of GraphMem: * <ul> diff --git a/jena-core/src/main/java/org/apache/jena/mem/GraphMemLegacy.java b/jena-core/src/main/java/org/apache/jena/mem/GraphMemLegacy.java index 3ce36d6f54..f126828743 100644 --- a/jena-core/src/main/java/org/apache/jena/mem/GraphMemLegacy.java +++ b/jena-core/src/main/java/org/apache/jena/mem/GraphMemLegacy.java @@ -22,12 +22,15 @@ package org.apache.jena.mem; import org.apache.jena.mem.store.TripleStore; +import org.apache.jena.mem.store.legacy.ArrayBunch; +import org.apache.jena.mem.store.legacy.HashedBunchMap; import org.apache.jena.mem.store.legacy.LegacyTripleStore; /** * A graph that stores triples in memory. This class is not thread-safe. * <p> - * Purpose: Use this graph implementation if you want to maintain the 'old' behavior of GraphMem or if your memory + * Purpose: Use this graph implementation if you want to maintain the 'old' behavior of GraphMem, + * while being "same term", or if your memory * constraints prevent you from utilizing more memory-intensive solutions. * <p> * Slightly improved performance compared to {@link org.apache.jena.memvalue.GraphMemValue} @@ -42,7 +45,7 @@ import org.apache.jena.mem.store.legacy.LegacyTripleStore; * <p> * This implementation is based on the original {@link org.apache.jena.memvalue.GraphMemValue} implementation. * The main difference is that it strictly uses term equality for all nodes. - * The inner workings of the used structures like ArrayBunch and HashedBunchMap are not changed. + * The inner workings of the used structures like {@link ArrayBunch} and {@link HashedBunchMap} are not changed. */ public class GraphMemLegacy extends GraphMem {
