Hi Gil,
I totally agree with your assessment. We should not introduce another
way of reviving the almost collectable objects and I fully support
tightening the specification so that soft and weak references to the
same referent and to other referents from which this referent is
reachable are
> On Jan 24, 2016, at 12:14 PM, Peter Levart wrote:
>
> Hi Gil,
>
> The algorithm complexity has been on my mind too and I've been thinking of
> how to maintain a key (or it's address) -> ephemeron mapping most efficiently.
This can vary. It's possible to do true O(1)
Hi Remi,
Hi Yumin,
I'm one of the developers of ASM,
I've pushed a new versions of ASM (the future 5.1) in the trunk that should let
you create constant method handles on an interface,
when i have updated ASM for Java 8, i've overlooked that case, sorry for that.
The code is mostly similar
Hello!
I'm investigating Stream.limit() performance for parallel ordered
streams when no SUBSIZED optimization is performed.
Consider the following code, for example:
AtomicInteger counter = new AtomicInteger();
int[] result = IntStream.range(0, 1_000_000).parallel().filter(x -> true)
Hi all,
Please review the trivial test bug fix for:
https://bugs.openjdk.java.net/browse/JDK-8147912
Bug Description: Since the test case "parseWithZoneWithoutOffset" is using hard
code as input data it will fail on some non-English locales (de_DE locale).
Webrev:
Hi Yumin,
I'm one of the developers of ASM,
I've pushed a new versions of ASM (the future 5.1) in the trunk that should let
you create constant method handles on an interface,
when i have updated ASM for Java 8, i've overlooked that case, sorry for that.
The code is mostly similar to your patch
Hi,
I had an idea recently on how to expedite the collection of an object.
It is simple - just don't let it live long.
Here's a concept prototype:
http://cr.openjdk.java.net/~plevart/misc/CloseableMemory/CloseableMemory.java
The overhead of the check in access methods (getByte()/setByte())
A note on implementation possibilities:
If I read the implementation correctly, a "weakness" of the current
implementation approach for making sure value-referents (and their transitively
reachable) objects are kept alive if key referents are alive is that it
requires multiple passes through
Hi, Remi
Thanks for your update!
Glad to see it fixed in ASM. wish get the new version soon.
Thanks
Yumin
On 1/24/2016 7:36 AM, Remi Forax wrote:
Hi Yumin,
I'm one of the developers of ASM,
I've pushed a new versions of ASM (the future 5.1) in the trunk that should let
you create
Hi Gil,
The algorithm complexity has been on my mind too and I've been thinking
of how to maintain a key (or it's address) -> ephemeron mapping most
efficiently. As I have written in a reply to Mandy, if we say that
individual phase2 of processing of the normal References has complexity
O(N)
10 matches
Mail list logo