ok brandon, that's a thought. build the hash on the hard drive at the time of
data creation. you mention collision resolution. so let me build my hash on the
hard drive using my 6 million buckets but increase the size of each bucket from
5 slots to 20. right? i can't exactly recreate my
On Tue, 2016-01-26 at 18:40 -0800, Scotty C wrote:
> alright george, i'm open to new ideas. here's what i've got going.
> running 64 bit linux mint OS on a 2 core laptop with 2 gb of ram. my
> key is 128 bits with ~256 bits per record. so my 1 gb file contains
> ~63 million records and ~32 million
On Tue, Jan 26, 2016 at 1:32 AM, Neil Van Dyke wrote:
> you want to do "filename globbing"
There's also the glob package [1], which should give the exact same API as
the shell. No need to remember the trailing "$" or specifically exclude
dotfiles.
(require glob)
(glob
> On Jan 25, 2016, at 5:51 PM, Greg Williams wrote:
>
> On Saturday, April 25, 2015 at 3:12:20 PM UTC-7, 'John Clements' via
> users-redirect wrote:
>> I have a long-running racket server that’s connecting to a MySQL back end.
>> It has a connection pool wrapped in a
robby findler, you the man. i like the copy-port idea. i incorporated it and it
is nice and fast and easily fit into the existing code.
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from this group and stop receiving emails
neil van dyke, i have used the system function before but had forgotten what it
was called and couldn't find it as a result in the documentation. my problem
with using the system function is that i need 2 versions of it: windoz and
linux. the copy-port function is a write once use across
gneuner2 (george), you are over thinking this thing. my test data of 1 gb is
but a small sample file. i can't even hash that small 1 gb at the time of data
creation. the hashed data won't fit in ram. at the time i put the redundant
data on the hard drive, i do some constant time sorting so that
In DrRacket you can type f1 when your insertion point is on the word "help".
Robby
On Tue, Jan 26, 2016 at 4:28 PM, Brian Adkins wrote:
> I was doing some reading on Scheme, and I came across the following page:
>
> http://bastibe.de/2012-09-20-story-about-schemes.html
>
On Tuesday, January 26, 2016 at 6:03:41 PM UTC-5, Robby Findler wrote:
> In DrRacket you can type f1 when your insertion point is on the word "help".
>
> Robby
Awesome - thanks. I'm not sure if you meant 'insertion point is on the word
"filter" ', or not, but for fun, I hit F1 with the
Right, sorry. :)
On Tue, Jan 26, 2016 at 5:15 PM, Brian Adkins wrote:
> On Tuesday, January 26, 2016 at 6:03:41 PM UTC-5, Robby Findler wrote:
>> In DrRacket you can type f1 when your insertion point is on the word "help".
>>
>> Robby
>
> Awesome - thanks. I'm not sure if
On Tuesday, January 26, 2016 at 6:15:41 PM UTC-5, Brian Adkins wrote:
> On Tuesday, January 26, 2016 at 6:03:41 PM UTC-5, Robby Findler wrote:
> > In DrRacket you can type f1 when your insertion point is on the word "help".
> >
> > Robby
>
> Awesome - thanks. I'm not sure if you meant 'insertion
On Tuesday, January 26, 2016 at 6:21:13 PM UTC-5, Brian Adkins wrote:
> On Tuesday, January 26, 2016 at 6:15:41 PM UTC-5, Brian Adkins wrote:
> > On Tuesday, January 26, 2016 at 6:03:41 PM UTC-5, Robby Findler wrote:
> > > In DrRacket you can type f1 when your insertion point is on the word
> > >
On Tuesday, January 26, 2016 at 6:30:59 PM UTC-5, Brian Adkins wrote:
> On Tuesday, January 26, 2016 at 6:21:13 PM UTC-5, Brian Adkins wrote:
> > On Tuesday, January 26, 2016 at 6:15:41 PM UTC-5, Brian Adkins wrote:
> > > On Tuesday, January 26, 2016 at 6:03:41 PM UTC-5, Robby Findler wrote:
> > >
On Wed, Jan 27, 2016 at 12:35 AM, Brian Adkins wrote:
> Just out of curiosity, does this work for anyone else? In other words, in the
> Dr. Racket repl:
>
> (require racket/help)
> (help filter)
>
> does that scroll down to the filter description in section 4.9, or is
On Tuesday, January 26, 2016 at 6:39:23 PM UTC-5, olopierpa wrote:
> On Wed, Jan 27, 2016 at 12:35 AM, Brian Adkins wrote:
>
> > Just out of curiosity, does this work for anyone else? In other words, in
> > the Dr. Racket repl:
> >
> > (require racket/help)
> > (help filter)
> >
> > does that
On Tuesday, January 26, 2016 at 6:42:43 PM UTC-5, Brian Adkins wrote:
> On Tuesday, January 26, 2016 at 6:39:23 PM UTC-5, olopierpa wrote:
> > On Wed, Jan 27, 2016 at 12:35 AM, Brian Adkins wrote:
> >
> > > Just out of curiosity, does this work for anyone else? In other words, in
> > > the Dr.
On Wed, Jan 27, 2016 at 12:46 AM, Brian Adkins wrote:
> Ok, this is odd, it works with both Chrome and Safari *if* they're not
> already open when (help filter) is evaluated. If they are already open, the
> URL is missing the anchor.
In my case, the default browser is
On Tuesday, January 26, 2016 at 6:52:14 PM UTC-5, olopierpa wrote:
> On Wed, Jan 27, 2016 at 12:46 AM, Brian Adkins wrote:
>
> > Ok, this is odd, it works with both Chrome and Safari *if* they're not
> > already open when (help filter) is evaluated. If they are already open, the
> > URL is
On Tuesday, January 26, 2016 at 6:55:26 PM UTC-5, Brian Adkins wrote:
> On Tuesday, January 26, 2016 at 6:52:14 PM UTC-5, olopierpa wrote:
> > On Wed, Jan 27, 2016 at 12:46 AM, Brian Adkins wrote:
> >
> > > Ok, this is odd, it works with both Chrome and Safari *if* they're not
> > > already open
On 1/26/2016 2:51 PM, Scotty C wrote:
gneuner2 (george), you are over thinking this thing. my test data of 1 gb is
but a small sample file. i can't even hash that small 1 gb at the time of data
creation. the hashed data won't fit in ram. at the time i put the redundant
data on the hard drive,
+1 on George Neuner's comments about how one can do smart processing of
huge files in small space. (I almost said something about that myself,
but didn't have time to get into that kind of discussion, so I stuck to
only the simpler file concatenation question.)
BTW, students who have 8GB RAM
alright george, i'm open to new ideas. here's what i've got going. running 64
bit linux mint OS on a 2 core laptop with 2 gb of ram. my key is 128 bits with
~256 bits per record. so my 1 gb file contains ~63 million records and ~32
million keys. about 8% will be dupes leaving me with ~30
22 matches
Mail list logo