I just installed 6.2.1 on a Linux VPS via the "Unix Source + Built Packages",
and the install went smoothly. I created a standalone executable of a simple
IRC bot I'm putting together via:
raco exe ircbot.rkt
When I run it the vsz=209440 and rss=63396. ~ 64 MB seems a little high to me.
Are t
On Wednesday, August 12, 2015 at 1:02:00 PM UTC-4, Juan Francisco Cantero
Hurtado wrote:
> On 08/12/2015 05:24 AM, Brian Adkins wrote:
> > I just installed 6.2.1 on a Linux VPS via the "Unix Source + Built
> > Packages", and the install went smoothly. I created a standa
I received a Raspberry Pi 2 Model B yesterday, so naturally I wanted to get
Racket on it as soon as possible :)
I read somewhere that "Unix Source + Built Packages" was better than "Unix
Source", but since I've received performance improvements from building Ruby
from sources vs. installing a p
On Saturday, August 15, 2015 at 9:37:21 AM UTC-4, Brian Adkins wrote:
> I received a Raspberry Pi 2 Model B yesterday, so naturally I wanted to get
> Racket on it as soon as possible :)
>
> I read somewhere that "Unix Source + Built Packages" was better than "Unix
On Saturday, August 15, 2015 at 9:54:21 AM UTC-4, Matthew Flatt wrote:
> At Sat, 15 Aug 2015 06:37:21 -0700 (PDT), Brian Adkins wrote:
> > The Raspberry Pi has a 4 core CPU, so it pains me to see it pegged at
> > only 25% this whole time. Is it possible to build Racket from Uni
On Saturday, August 15, 2015 at 9:37:21 AM UTC-4, Brian Adkins wrote:
> I received a Raspberry Pi 2 Model B yesterday, so naturally I wanted to get
> Racket on it as soon as possible :)
>
> I read somewhere that "Unix Source + Built Packages" was better than "Unix
Consider the following:
(define x "abc")
(match '(1 "abc")
[ (list 1 y) #:when (string=? y x) #t ]
[ _ #f ])
Is there a way to accomplish the same thing more concisely by interpolating the
value of x into the pattern? For example (non-working syntax):
(define x "abc")
(match '(1 "abc")
[
l such as "abc" since I need to do this
programmatically. The #:when clause and/or the ? function are reasonable work
arounds - I'm just hoping there's a more concise way to get the value of x into
the pattern.
> On Aug 18, 2015, at 12:55 AM, Brian Adkins wrote:
>
On Tuesday, August 18, 2015 at 1:24:38 AM UTC-4, Alex Knauth wrote:
> On Aug 18, 2015, at 1:18 AM, Brian Adkins wrote:
>
> > On Tuesday, August 18, 2015 at 1:13:16 AM UTC-4, Alex Knauth wrote:
> >> Is == what you're looking for?
> >> Or do you wa
I'm writing a Reversi/Othello game engine in Racket as a learning exercise.
Since my macbook pro has 4 cores and 8 hardware threads, I'd like to see what
sort of speedup I can get by parallelizing it.
I read through chapter 20 of the Racket Guide, and I *think* places may be more
suitable than
On Monday, August 31, 2015 at 1:27:42 PM UTC-4, Brian Adkins wrote:
> I'm writing a Reversi/Othello game engine in Racket as a learning exercise.
> Since my macbook pro has 4 cores and 8 hardware threads, I'd like to see what
> sort of speedup I can get by parallelizing it.
On Thursday, September 3, 2015 at 12:27:01 PM UTC-4, Jens Axel Søgaard wrote:
> [...]
>
> For this task places will be the perfect choice.
>
> [...]
Great - thanks for the advice. I'll create a non-parallel version first as a
baseline, and then a version with places. Once I have some code to s
Someone tweeted about The Evolution of Lisp:
http://www.csee.umbc.edu/courses/331/resources/papers/Evolution-of-Lisp.pdf
As I was reading through it, I came across (p. 52) Steele's "acceptance test".
I was curious how Racket might handle it, so I tried the factorial example,
which passed, and t
This is my own fault, but maybe Dr Racket could be made a little clearer. I had
hit -+ a few times to increase the font size, and I wanted to go back to
the default. -0 did not work as expected, then I checked the menus and
didn't find anything. Then I pulled up preferences which opens to the Fo
On Tuesday, November 3, 2015 at 5:46:23 PM UTC-5, Brian Adkins wrote:
> This is my own fault, but maybe Dr Racket could be made a little clearer. I
> had hit -+ a few times to increase the font size, and I wanted to go
> back to the default. -0 did not work as expected, then I ch
On Tuesday, November 3, 2015 at 5:55:58 PM UTC-5, Brian Adkins wrote:
> On Tuesday, November 3, 2015 at 5:46:23 PM UTC-5, Brian Adkins wrote:
> > This is my own fault, but maybe Dr Racket could be made a little clearer. I
> > had hit -+ a few times to increase the font size, and
The more I dig into Racket, the more I like it. It seems like a perfect fit for
both my personality and the type of applications I am, and will be, writing.
For the vast majority of what I need to do, it's a great fit.
I do occasionally encounter a need for raw speed, so I'm looking for a
compl
On Thursday, November 19, 2015 at 5:37:12 PM UTC-5, johnbclements wrote:
> > Any thoughts from folks that are FFI'ing from/to Racket and/or using a
> > second language in the same system as Racket ?
>
> My “thoughts" are more along the lines of cheerleading. I worked on Hygiene
> for Rust, and I
On Thursday, November 19, 2015 at 6:25:19 PM UTC-5, Matthias Felleisen wrote:
> Brian,
>
> -- when you say "raw speed", do you need "Fortran" level speed for numerical
> algorithms or just "somewhat faster than Racket, almost close to C"? If it's
> the latter, Rust may work out for you.
I wou
On Thursday, November 19, 2015 at 7:45:45 PM UTC-5, Neil Van Dyke wrote:
> Brian Adkins wrote on 11/19/2015 07:08 PM:
> > The example that provided the initial motivation is extremely simple -
> > process 45M+ text records with some minor transformations (including
> > compu
On Thursday, November 19, 2015 at 9:56:01 PM UTC-5, gustavo wrote:
> > I did *some* hand optimizing. Here's the code for the soundex and some
> > string helper functions I created:
> >
> > https://gist.github.com/lojic/1deba97f2e2eb2fe3fc0
> >
>
> I'm optimistic and I think that there is still so
On Thursday, November 19, 2015 at 11:08:07 PM UTC-5, Brian Adkins wrote:
> On Thursday, November 19, 2015 at 9:56:01 PM UTC-5, gustavo wrote:
> > > I did *some* hand optimizing. Here's the code for the soundex and some
> > > string helper functions I created:
> >
On Thursday, November 19, 2015 at 11:18:16 PM UTC-5, Brian Adkins wrote:
> On Thursday, November 19, 2015 at 11:08:07 PM UTC-5, Brian Adkins wrote:
> > On Thursday, November 19, 2015 at 9:56:01 PM UTC-5, gustavo wrote:
> > > > I did *some* hand optimizing. Here's the cod
On Friday, November 20, 2015 at 5:40:32 AM UTC-5, Hendrik Boom wrote:
> On Thu, Nov 19, 2015 at 02:01:02PM -0800, Brian Adkins wrote:
> > The more I dig into Racket, the more I like it. It seems like a perfect fit
> > for both my personality and the type of applications I
On Friday, December 11, 2015 at 7:31:25 AM UTC-5, Jay McCarthy wrote:
> From humble beginnings, module.c has gone from 340 lines to 12,729
> lines today (about 2 lines per day). We have seen amazing features
> like submodules and functions like
> syntax-local-lift-module-end-declaration.
>
> So mu
On Friday, December 11, 2015 at 7:55:50 AM UTC-5, Brian Adkins wrote:
> On Friday, December 11, 2015 at 7:31:25 AM UTC-5, Jay McCarthy wrote:
> > From humble beginnings, module.c has gone from 340 lines to 12,729
> > lines today (about 2 lines per day). We have seen amazing fe
On Friday, December 11, 2015 at 8:08:58 AM UTC-5, Jay McCarthy wrote:
> On Fri, Dec 11, 2015 at 7:55 AM, Brian Adkins wrote:
> > Excuse my ignorance of Racket internals & implementation, but I'm curious
> > about why the module system is implemented in C vs. Racket.
On Friday, December 11, 2015 at 8:17:39 AM UTC-5, Robby Findler wrote:
> Well, the current "racket" repo is only a small part of what we
> distribute. You might try that same thing on the standard
> distribution.
>
> Robby
Interesting. When I download the "Unix Source" from racket-lang.org, I get
On Friday, December 11, 2015 at 9:06:16 AM UTC-5, Matthew Flatt wrote:
> Jay's explanation sounds right to me.
>
> Naturally, we've wanted to move more code out of C for a long time. I
> think the pieces are finally moving into place so that it will really
> start to happen over the next year or s
On Thursday, November 19, 2015 at 5:37:12 PM UTC-5, johnbclements wrote:
> > ...
> > Any thoughts from folks that are FFI'ing from/to Racket and/or using a
> > second language in the same system as Racket ?
>
> My “thoughts" are more along the lines of cheerleading. I worked on Hygiene
> for R
I'm not sure if something changed with 6.3, but I have the output of:
racket -l errortrace -t parser.rkt
in the following gist:
https://gist.githubusercontent.com/lojic/9cd8a3a88ef2e110b9de/raw/79e9892326101333d11987c8e3a3b9df93adc63a/profile%2520output
I'm having trouble understanding the outp
On Saturday, January 16, 2016 at 9:40:51 PM UTC-5, Vincent St-Amour wrote:
> Brian,
>
> The Racket profiler is an edge profiler. So in addition to telling you
> which code time is spent in, it's also telling you which callers caused
> which proportion of that time.
>
> In the case of [48], it's t
A while ago, I started a thread about whether Rust or C would be a better
complement to Racket. After much more Rust research/coding, I got very tired of
fighting the compiler, so I decided to blow the dust off my C skills (I haven't
done any serious coding in C since 1996), and code up the app
On Saturday, January 16, 2016 at 10:32:26 PM UTC-5, Brian Adkins wrote:
> A while ago, I started a thread about whether Rust or C would be a better
> complement to Racket. After much more Rust research/coding, I got very tired
> of fighting the compiler, so I decided to blow the dust
et a feel for
> what’s going on without being able to run the programs.
>
> > On Jan 16, 2016, at 19:32, Brian Adkins wrote:
> >
> > A while ago, I started a thread about whether Rust or C would be a better
> > complement to Racket. After much more Rust research/co
On Saturday, January 16, 2016 at 11:26:14 PM UTC-5, Neil Van Dyke wrote:
> Your code is very string-ops-heavy, and I would start looking at that.
> One thing you could do is look for opportunities to construct fewer
> intermediate strings, including across multiple procedure calls. You
> could
On Saturday, January 16, 2016 at 11:54:05 PM UTC-5, Brian Adkins wrote:
> On Saturday, January 16, 2016 at 11:26:14 PM UTC-5, Neil Van Dyke wrote:
> > Your code is very string-ops-heavy, and I would start looking at that.
> > One thing you could do is look for opportunities to
lse
> ""])))
> ;; ===
>
>
>
>
>
>
>
> On Sun, Jan 17, 2016 at 1:24 AM, Jon Zeppieri wrote:
>
>
>
>
>
> On Sat, Jan 16, 2016 at 11:29 PM, Brian Adkins wrote:
>
>
> I'm happy to run experiments and repo
On Sunday, January 17, 2016 at 2:50:19 PM UTC-5, Brian Adkins wrote:
>
> With built-in string-trim, the lowest of three runs was 10293. Using your
> string-trim the lowest of three runs was 7618, so it reduced the runtime by
> 26%.
Although, I probably should've menti
On Sunday, January 17, 2016 at 2:54:39 PM UTC-5, Brian Adkins wrote:
> On Sunday, January 17, 2016 at 2:50:19 PM UTC-5, Brian Adkins wrote:
> >
> > With built-in string-trim, the lowest of three runs was 10293. Using your
> > string-trim the lowest of three runs was 76
>
> *** I tried a few more changes that avoid allocating intermediate
> bytes, but they are more complex and with 200K rows I estimate that
> the difference in run time would be only 0.02s. If I find something
> bigger, I'll write again.
>
> Gustavo
>
> PS: How man
On Monday, January 18, 2016 at 11:23:37 AM UTC-5, Brian Adkins wrote:
> [...]
> Thanks. Yes, I have a lot of cleanup to do - I basically hacked this together
> as fast as I could to experiment.
>
> I had wondered about caching the soundex values in the past, so I just coded
>
I've finalized the sequential version of my program to convert a large
fixed-length field file into two distinct output files (one per table) suitable
for bulk import into postgres.
https://gist.github.com/lojic/413f972bcaf1a6b156e2
On a single core, the runtime is 5.35x longer than the C progr
On Tuesday, January 19, 2016 at 1:13:44 AM UTC-5, Brian Adkins wrote:
> I've finalized the sequential version of my program to convert a large
> fixed-length field file into two distinct output files (one per table)
> suitable for bulk import into postgres.
>
> https://g
My initial experiment with places is a bit disappointing:
Sequential version: cpu time: 2084 real time: 2091 gc time: 91
Places version: cpu time: 16895 real time: 3988 gc time: 4244
Using 8x the CPU time seems quite high.
And more importantly, the places version only wrote 128,541 lines to the
On Wednesday, January 20, 2016 at 11:28:59 PM UTC-5, Brian Adkins wrote:
> My initial experiment with places is a bit disappointing:
>
> Sequential version: cpu time: 2084 real time: 2091 gc time: 91
>
> Places version: cpu time: 16895 real time: 3988 gc time: 4244
>
>
On Thursday, January 21, 2016 at 7:48:44 AM UTC-5, Robby Findler wrote:
> It may be the overhead of communicating the data is dominating the
> time spent working.
>
> Would it work to the main place open the file, count the number of
> lines, and then just tell the worker places which chunks of th
On Thursday, January 21, 2016 at 7:48:44 AM UTC-5, Robby Findler wrote:
> It may be the overhead of communicating the data is dominating the
> time spent working.
>
> Would it work to the main place open the file, count the number of
> lines, and then just tell the worker places which chunks of th
On Thursday, January 21, 2016 at 10:58:51 AM UTC-5, Sam Tobin-Hochstadt wrote:
> Hi Brian,
>
> A few suggestions:
>
> 1. You really want to use synchronization to determine when to end,
> not sleeping. Have each place write a message back to its parent when
> it is done, and have the parent wait
On Thursday, January 21, 2016 at 12:50:26 PM UTC-5, antoine wrote:
> Bonjour,
>
> Maybe for avoiding transforming mutable data to immutable data you could use
> make-shared-bytes and transfer the data by this mean? Don't know the
> underlying
> implementation of make-shared-bytes it didn't seem t
On Wednesday, January 20, 2016 at 11:47:57 PM UTC-5, Brian Adkins wrote:
> On Wednesday, January 20, 2016 at 11:28:59 PM UTC-5, Brian Adkins wrote:
> > My initial experiment with places is a bit disappointing:
> >
> > Sequential version: cpu time: 2084 real time: 2091 gc tim
On Thursday, January 21, 2016 at 2:12:51 PM UTC-5, Brian Adkins wrote:
> On Wednesday, January 20, 2016 at 11:47:57 PM UTC-5, Brian Adkins wrote:
> > On Wednesday, January 20, 2016 at 11:28:59 PM UTC-5, Brian Adkins wrote:
> > > My initial experiment with places is a
On Thursday, January 21, 2016 at 2:26:50 PM UTC-5, antoine wrote:
> To make it clear here is what i have in mind:
>
> #lang racket
>
> ;; dummy function, just remplace by A
> (define (do-stuff shared-data data-length)
> (values
>(make-bytes data-length 65)
>data-length))
>
> (define p
On Thursday, January 21, 2016 at 2:53:48 PM UTC-5, Brian Adkins wrote:
>
> Ok, so the huge place channel for each worker isn't the main issue. I changed
> the code so the output process sends a message to the main process every N
> messages, and the main process waits on a
On Thursday, January 21, 2016 at 6:54:54 PM UTC-5, Neil Van Dyke wrote:
> If I understand correctly, you're ultimately looking for a general way
> that you can write this kind of record processing code simply in the
> future. And that, right now, you're investing some one-time
> experimental ef
I was doing some reading on Scheme, and I came across the following page:
http://bastibe.de/2012-09-20-story-about-schemes.html
The author mentions:
"That said, I found plt-racket to be a joy to work with. (help filter) will
open your browser with the appropriate help page for filter. Amazing.
up a more relevant page - the
search results for searching help with filter; where the command-line repl
opens up the page with the help for filter - the command-line (help) form
appears to expect a procedure symbol and shows the specific help for it.
> On Tue, Jan 26, 2016 at 4:28 PM, Brian
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.
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 po
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, R
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)
>
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
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 alread
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&#x
I'm sure this is a really bad idea, but I couldn't resist after finding section
3.3.8 in the Dr. Racket documentation - what fun :)
(define (∃ member list)
(cond [ (∅? list) ∅ ]
[ (≡ member (α list)) list ]
[ else (∃ member (ω list)) ]))
(∃ 8 '(3 9 8 5))
Using "alpha" for "car
On Thursday, January 28, 2016 at 5:30:57 PM UTC-5, Brian Adkins wrote:
> I'm sure this is a really bad idea, but I couldn't resist after finding
> section 3.3.8 in the Dr. Racket documentation - what fun :)
>
> (define (∃ member list)
> (cond [ (∅? list) ∅ ]
>
On Wednesday, October 7, 2015 at 11:18:41 PM UTC-4, Sam Tobin-Hochstadt wrote:
> A few thoughts:
>
> 1. This is a great idea -- one of the reasons that I think Racket has
> avoided lots of little dialects despite syntactic flexibility is
> standardizing the community on one thing. I'm glad you're
Is there an advantage to having assoc return the associated list vs. the tail
of the associated list? Wouldn't it be better for it to behave more like
hash-ref ? Do folks typically just define their own function such as the
following ?
(define daynums (map list
'(sunday mon
On Sunday, January 31, 2016 at 1:05:17 PM UTC-5, Alexis King wrote:
> > On Jan 29, 2016, at 21:55, Brian Adkins wrote:
> >
> > Was any consensus reached on this? I've been working through some exercises
> > in Racket that a friend is implementing in Elixir, and I ju
I'm trying to install the html-parsing package, and I'm getting a connection
refused error. Is this just a transient issue?
$ raco pkg install html-parsing
Resolving "html-parsing" via
https://download.racket-lang.org/releases/6.4/catalog/
tcp-connect: connection failed
address: mirror.racket-
I'm looking for an html parser that can handle real world web pages that are
typically invalid (similar to Ruby's Nokogiri). I came across recommendations
for the html-parsing package, so I went to:
https://pkgs.racket-lang.org/
I couldn't find it via the parsing or parser tags, but using my b
On Wednesday, February 17, 2016 at 10:20:21 AM UTC-5, Neil Van Dyke wrote:
> Brian Adkins wrote on 02/17/2016 10:04 AM:
> > http://www.neilvandyke.org/racket-html-parsing/
> >
> > takes me to Neil's page with a more recent history: PLaneT 3:0 — 2015-04-24
>
On Wednesday, February 17, 2016 at 10:35:44 AM UTC-5, Brian Adkins wrote:
> On Wednesday, February 17, 2016 at 10:20:21 AM UTC-5, Neil Van Dyke wrote:
> > Brian Adkins wrote on 02/17/2016 10:04 AM:
> > > http://www.neilvandyke.org/racket-html-parsing/
> > >
> >
On Wednesday, February 17, 2016 at 10:28:48 AM UTC-5, Ben Greenman wrote:
> You should be able to install html-parsing now.
I'm no longer getting connection refused, but now I'm getting a 403.
$ raco pkg install html-parsing
Resolving "html-parsing" via
https://download.racket-lang.org/releases/
On Wednesday, February 17, 2016 at 1:53:56 PM UTC-5, Matthew Flatt wrote:
> At Wed, 17 Feb 2016 10:45:26 -0800 (PST), Brian Adkins wrote:
> > On Wednesday, February 17, 2016 at 10:28:48 AM UTC-5, Ben Greenman wrote:
> > > You should be able to install html-parsing now.
>
On Friday, February 19, 2016 at 11:46:17 AM UTC-5, Neil Van Dyke wrote:
> BTW, I now intend to move my packages to the new package system shortly,
> and I'll then stop supporting the PLaneT ones.
>
> (There's some urgency to moving now, so I'm going to punt on workarounds
> for the version-relat
I began compiling very crude statistics on programming language popularity back
in 2009, and just kept doing it periodically. Initially I did it manually, but
I finally got smart and wrote the following Racket program to scrape the
results automatically:
https://gist.github.com/lojic/83fff86aee
On Wednesday, February 24, 2016 at 12:24:59 PM UTC-5, Vincent St-Amour wrote:
> If we add up the "Racket" and "Scheme" numbers (the latter being, I
> suspect, mostly Racket), the total is pretty close to Ruby. I find that
> amusing. :)
>
> Actually, I'm curious what the numbers look like if you co
On Wednesday, February 24, 2016 at 2:40:23 PM UTC-5, Robby Findler wrote:
> Scheme is great. Racket isn't Scheme, although it draws a ton of
> inspiration from the language and it's design. Viva Scheme! Viva
> Racket!
>
> Robby
I agree, but I have mixed emotions. The lisp community is better than
What is the process for providing additions to Racket's standard library? Do
people just submit pull requests, or is there a particular vetting process, to
determine whether a function is generally useful enough to warrant inclusion in
the standard library, that should happen first to avoid clut
On Thursday, February 25, 2016 at 8:36:22 AM UTC-5, Robert Herman wrote:
> Cool, Brian!
>
> I am not able to scroll past the page view. The scroll is bottomed out, but
> clearly there is more text on your page. I am using Firefox to view.
>
> Just curious about your experience with pony lang? I
On Thursday, February 25, 2016 at 9:02:07 AM UTC-5, Robert Herman wrote:
> On Thursday, February 25, 2016 at 8:49:41 PM UTC+7, Brian Adkins wrote:
> > On Thursday, February 25, 2016 at 8:36:22 AM UTC-5, Robert Herman wrote:
> > > Cool, Brian!
> > >
> > > I am n
If any of you happen to be in the Triangle area of NC, I created a Lisp &
Scheme meetup today:
http://www.meetup.com/Triangle-Lisp-Scheme/
I founded TriFunc in 2009 here, but the broad scope & niche interest has always
been a problem (especially after the Clojure (headquartered in the Triangle)
I've finally begun a project to create a web framework for Racket. Are there
any particular license issues that I should be aware of in this regard?
The MIT License is used by both Rails and Phoenix, and I've used it for other
side projects, so I'm inclined to use it for this new framework unles
On Wednesday, March 2, 2016 at 12:17:55 AM UTC-5, Neil Van Dyke wrote:
> Brian Adkins wrote on 03/01/2016 11:31 PM:
> > Are there any particular license issues that I should be aware of in this
> > regard?
>
> I don't know. Looks like core Racket is now LGPLv3, which i
This is very premature, but out of curiosity, when is the deadline for
submitting talk proposals for Racketcon? I'd like to use the date as a
motivational tool to help me make enough progress on the web framework to be
talk-worthy!
Thanks,
Brian
--
You received this message because you are su
On Saturday, February 27, 2016 at 8:15:41 PM UTC-5, Neil Van Dyke wrote:
> OK, I've moved 23 of my Racket packages from PLaneT to the new package
> system, and I plan to move several more. Exactly what's been moved, and
> is planned to move, is tracked at "http://www.neilvandyke.org/racket/";.
>
>
> Vincent
>
>
>
>
> On Wed, 02 Mar 2016 11:50:56 -0600,
> Brian Adkins wrote:
>>
>> This is very premature, but out of curiosity, when is the deadline for
>> submitting talk proposals for Racketcon? I'd like to use the date as a
>>
Is there anything analogous to Rack (Ruby) or WSGI (Python), i.e. a standard
protocol between web servers and web applications, in the Racket world?
http://rack.github.io/
https://www.python.org/dev/peps/pep-/#abstract
Thanks,
Brian
--
You received this message because you are subscribed
t; I haven't found any racket implementation so far.
>
> On 03/03/2016 04:16 PM, Brian Adkins wrote:
> > Is there anything analogous to Rack (Ruby) or WSGI (Python), i.e. a
> > standard protocol between web servers and web applications, in the Racket
> > worl
On Thursday, March 3, 2016 at 12:23:28 PM UTC-5, Brian Adkins wrote:
> On Thursday, March 3, 2016 at 12:15:27 PM UTC-5, antoine wrote:
> > There is the fastcgi protocol http://www.fastcgi.com/drupal/ (maybe it
> > is underlying rack and wsgi).
> > I have done basic tes
Does RackUnit provide a facility similar to the setup & teardown functions of
other unit testing frameworks? In other words, I'd like to execute some code
before each test w/o coding each test to call a setup function or having to
create my own macro given how common this is.
As far as I can te
and I don't feel that you should, you could
> look at current-check-around and do something like:
>
>
> (let ([old (current-check-around)])
> (parameterize ([current-check-around (lambda (c) (before!) (old c)
> (after!))])
> (check-equal? )
> (check-eq
suite > A nested test suite > Another test
> Another test
> FAILURE
> name: check-equal?
> location: unsaved-editor:17:26
> actual: 1
> expected: 2
> . Check failure
>
> (Before #f)
> 1 success(es) 1 failure(s) 0 error(s) 2 test(s)
I'm toying around with porting a small Elixir program to Racket. The following
gist has both programs:
https://gist.github.com/lojic/66c00514dab54b84c56e
One thing that's quite awkward in my Racket version is the need for the extra
place channels (ch1, ch2).
So, for example, the size function
On Tuesday, March 8, 2016 at 5:10:45 PM UTC-5, Brian Adkins wrote:
> I'm toying around with porting a small Elixir program to Racket. The
> following gist has both programs:
>
> https://gist.github.com/lojic/66c00514dab54b84c56e
>
> One thing that's quite awkward
st system that
> integrates well with the rest of the language and to just use the language's
> features for extensibility.
>
> Jay
>
>
> On Tue, Mar 8, 2016 at 1:35 PM, Brian Adkins wrote:
> Not exactly. I'm looking for a way to run a function before *each*, of
to keep expanding the `for` macro to do more and more
>> towards the Lisp `do` macro is a bad move, IMHO, because it is so much more
>> complicated and non-orthogonal. It's better to make a test system that
>> integrates well with the rest of the language and to just
I coded up a sequential and parallel version of N-Queens, then did a ton of
benchmark runs of 13-Queens to compare the time. For each configuration
(sequential or parallel w/ M workers), I ran the programs 6 times, threw out
the high two & low two and averaged the middle two numbers.
The spread
On Friday, March 11, 2016 at 7:42:22 PM UTC-5, Brian Adkins wrote:
> I coded up a sequential and parallel version of N-Queens, then did a ton of
> benchmark runs of 13-Queens to compare the time. For each configuration
> (sequential or parallel w/ M workers), I ran the programs 6 tim
1 - 100 of 268 matches
Mail list logo
