Thanks!
I did try 1.3.174 the other day and noticed it fixed my issues!
Brian
On Tue, Oct 29, 2013 at 12:51 AM, Thomas Mueller <
thomas.tom.muel...@gmail.com> wrote:
> Hi,
>
> By the way, those bugs have been fixed now. There is now a WriteBuffer
> that auto-increases capacity (similar to a By
ting thread
> conflicts with the main thread. Concurrency problems are always hard to
> test... I'm thinking about how to ensure things like this can't happen.
>
> Anyway, for your use case, the solution is quite easy: disable the
> background thread. You don't need
re?
> - How to you process the data (concurrently, when do you call commit, do
> you call save yourself and if yes when,...)?
> - How large is a typical record?
> - What data types do you use?
>
> Regards,
> Thomas
>
>
>
> On Wed, Oct 9, 2013 at 11:41 PM, Brian Bray
you could build an off-heap LIRS cache. It shouldn't be complicated to
> implement (the cache would simply needs a map factory).
> Regards,
> Thomas
>
>
>
> On Wed, Oct 9, 2013 at 7:52 PM, Brian Bray
> > wrote:
>
>> Thomas,
>>
>> Here is a more
Thomas,
Here is a more elusive issue that I'm wondering if its a bug in
MVMap/MVStore.
I'm currently using MVStore as a large, temporary disk cache, I have a java
program that scans about 10GB of raw CSV-ish files, and for each file,
plucks out a few fields I care about and stores it in a MV
do something similar to closing
> the map, but in addition to that will also remove all data.
>
> Regards,
> Thomas
> Hi,
>
> Yes, this is a bug, I will fix it. Thanks for reporting it!
>
> Regards,
> Thomas
>
>
>
> On Thu, Oct 3, 2013 at 1:31 AM, Brian
This test throws a "Map is closed" exception (in 1.3.173) and I don't
believe it should. Looks like MVMap.openMap(...) is not checking for
"!old.isClosed()"?
@Test
public void testMVMapClearReOpen() {
// open MVMap
File f = new File(System.getProperty("java.io.tmpdir"), "cache.d
ap users with a composite key ("Foo"/"Bar" = {1, 1}).
> That's basically what you do in a relational database. The disadvantage is
> that accessing the keys in sorted order is not possible / not easy.
>
> Regards,
> Thomas
>
>
>
>
>
> On
Hi,
I've been watching the development of the MVStore engine as a potential
solution for an idea I'm working on where I need to store large associative
arrays where the data looks something like this for an example "users"
structure.
user[12345].name.first = "Foo"
user[12345].name.last = "Bar"
