I am trying to figure out the best way to do this and granted I am not sure my
architecture is the most sane or sensible way to handle it. I am trying to
build my DB interface and I want to allow the system to deal with numerous
types of data stores. So I have a config file that is read and
da...@davidchristiansen.dk> wrote:
> On 11/05/2016 09:14 AM, Ken MacKenzie wrote:
>
>> And particularly if you use emacs, what add ons or setup do you do for
>> racket or scheme editing in general.
>>
>
> I use mostly Emacs. Aside from what's already been recommended here, I
> r
So as much as I know there is much love for Dr Racket, I am not the biggest
fan. Yes I must admit some of its helper features are great for working in
racket and if I must debug something it is probably the best place to work.
Anyway was wondering what other editors people use. I have been a
I am wondering why not use a filter on the list?
Ken
On Monday, October 31, 2016 at 10:53:25 PM UTC-4, meino.cramer wrote:
> Hi,
>
> I have a lng list of something. And I have a recursive serach
> function to crawl down the list and search for a previously determined
> item.
> When found,
No this is reminding me that I need to think of my intended implementations and
this is not a worth while thing to implement at the terminal level and also a
case of prematurely attempting to optimize before dealing with the solution.
Intended implementation is I see a large part of this living
So a curiosity question. Right now I am reading in a line of terminal input
from the user and handling it. I am thinking of switching the program to
handle the input character by character, and just wondering how to do that but
also have it seem to the user that the program is waiting for
Yeah that is much more concise than mine. My newbie lack of knowledge on the
stdlib is showing.
Ken
On Saturday, October 29, 2016 at 11:12:50 AM UTC-4, Stephen Chang wrote:
> string-join already expects a list of strings, so are you sure you want apply?
> Can you give a more specific example?
Not 100% sure of what you're asking so if I got this wrong pseudo code it for
me. Remember I am kind of new to racket but I will give it a go:
As I understand it you have a list of lists of strings perhaps like this...
(('this' 'is' 'one')('this' 'is' 'another')('this' 'is' 'the' 'last'))
As a curiosity what happens when you run it as such
racket shwrefmt.rkt > debug.log
Ken
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to
sentence against the file
index.senses. Documentation for that file is online. Anyway this is part
of an NLP approach I am working on.
Ken
On Fri, Oct 28, 2016 at 3:41 PM, David Storrs <david.sto...@gmail.com>
wrote:
> On Fri, Oct 28, 2016 at 3:24 PM, Ken MacKenzie <deviloc...@gmail.
In a future version of what I am working on I see regex being an excellent
solution. My search is against a file I load into a list at program
initialization. However for other parts of this to load a list based on a
partial file filtered with regex may be a better solution.
There is also
Excellent thank you. To note I am searching the docs but I see I did not
scroll far enough. I went to go find string-prefix in the doc and also found
string-contains and string-suffix in the same set of examples.
So you gave me an inadvertent trifecta of useful information.
It also means
I have two things I am trying to compare, both strings.
What I want to know is if string a is the beginning of string b.
Example (pseudo code)
string a = this
string b = that
string c = thisandthat
a... == c #t
b... == c #f
Hope I am making sense here. I couldn't figure out a way so at
Perhaps not the answer you want, but you could always pull the source from the
github repo and compile it for arm.
Ken
On Thursday, October 27, 2016 at 9:21:57 PM UTC-4, meino.cramer wrote:
> Hi,
>
> after putting Racket on my desktop Linux box and on my tablet
> (ARCHLinux chroot, x86 CPU) I
I hope to be a trend setter. Haven't really introduced myself but I find
racket a great toolset for getting
ll, a little bit of nostalgia.
> >
> > MHO, Jos
> >
> > -Original Message-
> > From: racket-users@googlegroups.com [mailto:racket-users@
> googlegroups.com] On Behalf Of Ken MacKenzie
> > Sent: jueves, 27 de octubre de 2016 19:28
> > To: Racket
Thank you for the information. Good to know. Performance isn't the first
thing I am thinking about, but as I am tinkering and getting running with
Racket I like to kind of dig into the underlying structure to know the cost of
certain operations.
Ken
> For accessing an arbitrary member, yes.
Thank you that makes sense. Vectors are fixed length so in theory could I also
say a Vector is possibly more performant than an equivalent list?
Ken
On Thursday, October 27, 2016 at 12:58:06 PM UTC-4, Jon Zeppieri wrote:
> On Thu, Oct 27, 2016 at 12:16 PM, Ken MacKenzie <devil...@gma
This is a question more about the footprint of each. Deep down is a Struct
really just syntactic sugar over a list. As in most things in Lisp from my
understanding are all just lists, it is the basic building block of all data.
Is a struct also just a list and the element names enumerations
As a confirmation was part of my upgrades this morning in trusty.
On Thursday, October 27, 2016 at 11:01:01 AM UTC-4, asumu wrote:
> Hi folks,
>
> The Ubuntu PPA should now be updated for v6.7:
>
> https://launchpad.net/~plt/+archive/ubuntu/racket
>
> It should be available for precise,
e error message is saying there's an extra pair of parentheses
> somewhere, for example:
> > (1)
> > (define-struct foo () #:transparent)
> > ((foo))
>
> On Wed, Oct 26, 2016 at 1:16 PM, Ken MacKenzie <deviloc...@gmail.com>
> wrote:
>
>> New to racket and pl
New to racket and playing with a little something. Here is my code:
#lang racket/base
22 matches
Mail list logo
