Re: [PD] your favorite key:value data structure?

[Dan Wilcox]

Wow. Nice! Do you mind if I repackage it in the rc-patches? I usually pull 
together useful things posted to this list...

> On Jul 19, 2017, at 8:56 PM, pd-list-requ...@lists.iem.at wrote:
> 
> From: oliver <oli...@klingt.org <mailto:oli...@klingt.org>>
> Subject: Re: [PD] your favorite key:value data structure?
> Date: July 19, 2017 at 8:56:33 PM GMT+2
> Cc: Pd-List <pd-l...@mail.iem.at <mailto:pd-l...@mail.iem.at>>
> 
> 
> just in case you're interested:
> 
> here's a "coll"-like abstraction i made recently that is vanilla only and 
> uses mainly the [text] object. help file included
> 
> best
> 
> oliver


Dan Wilcox
@danomatika <http://twitter.com/danomatika>
danomatika.com <http://danomatika.com/>
robotcowboy.com <http://robotcowboy.com/>



___
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management -> 
https://lists.puredata.info/listinfo/pd-list

Re: [PD] your favorite key:value data structure?

[oliver]

Dan Wilcox wrote:

Wow. Nice! Do you mind if I repackage it in the rc-patches? I usually
pull together useful things posted to this list...


of course, you're welcome !

what's still missing is an "insert" method. miller announced a native 
[text insert] for the new PD release (that i didn't dare to test yet), 
so maybe it's already there and just needs implementation.


i'm using this abstraction myself for quite a while now and it seems to 
be working as expected, though i obviously can't guarantee it's 100% bug 
free ...


more to come soon ;-)

best

oliver

___
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management -> 
https://lists.puredata.info/listinfo/pd-list

Re: [PD] your favorite key:value data structure?

[Jonathan Wilkes via Pd-list]

> By default, "search" matches only lines whose first field(s) match the search 
key(s).  OTOH, if you have a duplicate key and want to find anything besides 
the 
first occurence of the key it will be tricky.

Could also just reimplement dogensym in Pd. :)
-Jonathan

> cheers
> Miller





   #N struct 1003-values text buf;
#N struct 1003-dict float x float y array a 1003-values;
#N canvas 401 34 484 597 10;
#N canvas 551 134 450 323 \$0-values 0;
#X obj 72 44 struct \$0-values text buf;
#X restore 172 47 pd \$0-values;
#N canvas 288 224 449 324 hash 0;
#X obj 133 22 inlet;
#X obj 133 74 list fromsymbol;
#X obj 133 138 +;
#X obj 133 160 t a;
#X obj 133 182 +;
#X obj 133 204 t a;
#X obj 118 243 f;
#X obj 118 265 &;
#X obj 384 27 inlet;
#X obj 384 49 - 1;
#X obj 118 287 outlet;
#N canvas 0 0 450 300 list-drip 0;
#X obj 69 88 t a a;
#X obj 69 245 spigot;
#X obj 108 153 bang;
#X obj 108 172 1;
#X obj 229 153 route bang;
#X obj 189 154 bang;
#X obj 189 173 0;
#X obj 108 118 list split 2;
#X obj 238 383 list split;
#X obj 305 332 list length;
#X obj 305 354 >> 1;
#X obj 69 264 t a a a a;
#X obj 69 450 list split;
#X obj 136 402 list length;
#X obj 136 427 >> 1;
#X obj 37 23 inlet;
#X obj 296 179 outlet;
#X text 79 23 Copyright 2009 by Mathieu Bouchard;
#X obj 37 57 t b a;
#X obj 471 123 outlet;
#X text 526 125 signal end of list;
#X text 387 27 made compatible with [list-drip]: fbar 2009;
#X connect 0 0 1 0;
#X connect 0 1 7 0;
#X connect 1 0 11 0;
#X connect 2 0 3 0;
#X connect 3 0 1 1;
#X connect 4 1 16 0;
#X connect 5 0 6 0;
#X connect 6 0 1 1;
#X connect 7 0 2 0;
#X connect 7 2 4 0;
#X connect 7 2 5 0;
#X connect 8 0 0 0;
#X connect 9 0 10 0;
#X connect 10 0 8 1;
#X connect 11 0 12 0;
#X connect 11 1 13 0;
#X connect 11 2 8 0;
#X connect 11 3 9 0;
#X connect 12 1 0 0;
#X connect 13 0 14 0;
#X connect 14 0 12 1;
#X connect 15 0 18 0;
#X connect 18 0 19 0;
#X connect 18 1 0 0;
#X restore 133 101 pd list-drip;
#X obj 133 44 trigger anything bang;
#X obj 249 116 f 0;
#X connect 0 0 12 0;
#X connect 1 0 11 0;
#X connect 2 0 3 0;
#X connect 3 0 2 1;
#X connect 3 0 4 0;
#X connect 4 0 5 0;
#X connect 5 0 4 1;
#X connect 5 0 6 1;
#X connect 6 0 7 0;
#X connect 7 0 10 0;
#X connect 8 0 9 0;
#X connect 9 0 7 1;
#X connect 11 0 2 0;
#X connect 11 1 6 0;
#X connect 12 0 1 0;
#X connect 12 1 13 0;
#X connect 13 0 2 1;
#X connect 13 0 4 1;
#X restore 224 298 pd hash;
#N canvas 240 343 450 323 \$0-dict 0;
#X obj 167 120 filledpolygon 900 0 1 0 0 20 0 20 20 0 20;
#X obj 89 34 struct \$0-dict float x float y array a \$0-values;
#X restore 172 24 pd \$0-dict;
#N canvas 289 250 450 300 \$0-data 0;
#X restore 170 71 pd \$0-data;
#N canvas 555 302 450 346 \$0-init-data 0;
#X obj 101 80 f \$0;
#X msg 128 126 clear \, scalar \$1-dict 5 5;
#X obj 128 148 s pd-\$0-data;
#X obj 101 56 inlet;
#X obj 101 102 t a a;
#X obj 101 197 pointer;
#X obj 101 219 outlet;
#X msg 101 175 traverse pd-\$1-data \, next;
#X connect 0 0 4 0;
#X connect 1 0 2 0;
#X connect 3 0 0 0;
#X connect 4 0 7 0;
#X connect 4 1 1 0;
#X connect 5 0 6 0;
#X connect 7 0 5 0;
#X restore 273 46 pd \$0-init-data;
#X obj 273 24 loadbang;
#X obj 273 68 trigger bang pointer;
#X msg 273 93 1024;
#X text 307 92 hashtable size;
#X obj 291 347 element \$0-dict a;
#X obj 197 387 text search -s \$0-values buf;
#X obj 273 126 setsize \$0-dict a;
#X obj 197 413 sel -1;
#X obj 178 477 text set -s \$0-values buf;
#X msg 197 435 1e+06;
#X obj 170 184 t a a;
#X obj 197 230 t a a;
#X obj 197 206 list split 1;
#X obj 171 135 inlet;
#X obj 171 157 list;
#X obj 79 135 inlet;
#X obj 79 157 list split 1;
#X obj 112 507 text get -s \$0-values buf;
#X obj 79 422 f;
#X obj 79 179 t b a a;
#X obj 79 444 sel -1;
#X obj 79 555 outlet;
#X text 81 111 READ;
#X text 172 110 WRITE;
#X text 23 19 2017 Jonathan Wilkes;
#X obj 112 529 list split 1;
#X connect 1 0 9 0;
#X connect 4 0 6 0;
#X connect 5 0 4 0;
#X connect 6 0 7 0;
#X connect 6 1 9 1;
#X connect 6 1 11 1;
#X connect 7 0 1 1;
#X connect 7 0 11 0;
#X connect 9 0 10 1;
#X connect 9 0 13 3;
#X connect 9 0 22 3;
#X connect 10 0 12 0;
#X connect 10 0 23 1;
#X connect 12 0 14 0;
#X connect 12 1 13 1;
#X connect 14 0 13 1;
#X connect 15 0 13 0;
#X connect 15 1 17 0;
#X connect 16 0 10 0;
#X connect 16 1 1 0;
#X connect 17 0 16 0;
#X connect 18 0 19 0;
#X connect 19 0 15 0;
#X connect 20 0 21 0;
#X connect 21 0 24 0;
#X connect 22 0 30 0;
#X connect 23 0 25 0;
#X connect 24 0 23 0;
#X connect 24 1 10 0;
#X connect 24 2 1 0;
#X connect 25 0 26 0;
#X connect 25 1 22 0;
#X connect 30 1 26 0;
___
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management -> 
https://lists.puredata.info/listinfo/pd-list

Re: [PD] your favorite key:value data structure?

[Dan Wilcox]

See also [m_symbolarray] in rjlib

> On Jul 19, 2017, at 7:38 AM, pd-list-requ...@lists.iem.at wrote:
> 
> From: Ali Momeni <batc...@gmail.com <mailto:batc...@gmail.com>>
> Subject: Re: [PD] your favorite key:value data structure?
> Date: July 19, 2017 at 12:06:27 AM GMT+2
> To: Alexandre Torres Porres <por...@gmail.com <mailto:por...@gmail.com>>
> Cc: Pd-List <pd-list@lists.iem.at <mailto:pd-list@lists.iem.at>>, Peter 
> Nyboer <p...@nbor.us <mailto:p...@nbor.us>>
> 
> 
> Thanks for clarifying Alexandre.
> 
> I would like a pure Vanilla solution because I need to run my application on 
> a raspberry pi, an iOS device, and Android, and in the browser.
> I'll make do with the 'text' object for now unless there is an obvious 
> alternative (or a way to use 'struct' with 'keys').
> 
> -ali


Dan Wilcox
@danomatika <http://twitter.com/danomatika>
danomatika.com <http://danomatika.com/>
robotcowboy.com <http://robotcowboy.com/>



___
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management -> 
https://lists.puredata.info/listinfo/pd-list

Re: [PD] your favorite key:value data structure?

[Ali Momeni]

Thanks for clarifying Alexandre.

I would like a pure Vanilla solution because I need to run my application
on a raspberry pi, an iOS device, and Android, and in the browser.
I'll make do with the 'text' object for now unless there is an obvious
alternative (or a way to use 'struct' with 'keys').

-ali

On Tue, Jul 18, 2017 at 5:31 PM, Alexandre Torres Porres 
wrote:

> 2017-07-18 17:45 GMT-03:00 Ali Momeni :
>
>>
>> My understanding is that 'coll' is NOT a part of vanilla, but rather a
>> part of 'cyclone', not maintained by Miller.  Since I'm looking for a pure
>> Vanilla solution, this is not a good choice.  right?
>>
>
> Yep, [coll] is an external from cyclone, not part of vanilla. It is not
> maintained by Miller, but this doesn't mean that it is not being
> maintained, as cyclone is in active development and maintenance. But it is
> not clear why you need a vanilla solution, if it is a matter of an external
> being maintained or not. Usually this restriction comes from a matter of
> doing something with libpd, sometimes it is a case of personal preference...
>
> As I understand, [coll] and [text] may have different features, though I
> wouldn't know about them, like I just asked, as well as I asked if there
> could be any benefit in also cloning max's [dict] object.
>
> cheers
>
___
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management -> 
https://lists.puredata.info/listinfo/pd-list

Re: [PD] your favorite key:value data structure?

[Alexandre Torres Porres]

2017-07-18 17:45 GMT-03:00 Ali Momeni :

>
> My understanding is that 'coll' is NOT a part of vanilla, but rather a
> part of 'cyclone', not maintained by Miller.  Since I'm looking for a pure
> Vanilla solution, this is not a good choice.  right?
>

Yep, [coll] is an external from cyclone, not part of vanilla. It is not
maintained by Miller, but this doesn't mean that it is not being
maintained, as cyclone is in active development and maintenance. But it is
not clear why you need a vanilla solution, if it is a matter of an external
being maintained or not. Usually this restriction comes from a matter of
doing something with libpd, sometimes it is a case of personal preference...

As I understand, [coll] and [text] may have different features, though I
wouldn't know about them, like I just asked, as well as I asked if there
could be any benefit in also cloning max's [dict] object.

cheers
___
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management -> 
https://lists.puredata.info/listinfo/pd-list

Re: [PD] your favorite key:value data structure?

[Ali Momeni]

Thanks everyone, this is all very helpful.

"text":
Great.  Can use search, works fine.

"coll":
My understanding is that 'coll' is NOT a part of vanilla, but rather a part
of 'cyclone', not maintained by Miller.  Since I'm looking for a pure
Vanilla solution, this is not a good choice.  right?

"struct":
I understand that you can invent complex data structures with this object.
My 2 questions are:
-is there an easy/out-of-the-vanilla-box way to go from text files to
struct?
-i don't see how struct implements the "key" of my desired key/value pair.
 is that the name of the pd subpatch that has the struct object in it?

Thanks also for the hot PuRestJson tip, will look into that for future
adventures.

ali


On Tue, Jul 18, 2017 at 2:54 PM, Peter Nyboer  wrote:

> Maybe PuRestJson fits the bill?
> I checked this out a while ago on CHIP using vanilla. I had some issues
> that were eventually fixed, but I ended up doing the bulk of the work in
> python then passing some control data over to PD via OSC.
> I was using it to load data from EchoNest into a PD patch.
> But it probably will do what you want.
>
> https://github.com/residuum/PuRestJson
>
> Peter
>
___
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management -> 
https://lists.puredata.info/listinfo/pd-list

Re: [PD] your favorite key:value data structure?

[Alexandre Torres Porres]

As long as we're at it, what are the difference between [text] and
[cyclone/coll] and where do they do the same thing?

Also, it seems [coll] is deprecated in Max, they have a new object named
[dict], which might be the "python like dictionary" kind of thing, and this
is what Max suggests using instead of coll.

So, I was wondering if there would be any great advantage of cloning [dict]
into cyclone, or if you could do the same things with [text] anyway.

cheers

2017-07-18 15:33 GMT-03:00 Jonathan Wilkes via Pd-list <pd-list@lists.iem.at
>:

> > Hello Jonathan,
>
> > Thanks for your reply.
> > I'm not quite sure what you mean.
>
> > What pd-vanilla object do you use to implement "Variable number of keys
> of arbitrarily typed values"
> [text], [coll], etc.
>
> > or "set number of keys with set value types"?
> data structures
>
> The benefit of the latter is that you know the number of "slots" ahead of
> time so you can populate
> the data without needing to allocate memory.
>
> > I should add that I'm interested ultimately in a data structure that I
> can populate from text files, read by PD.
>
> In that case I don't think the benefit I mentioned wrt data structures
> matters because
> the I/O speed will be your limiting factor.
>
> My suggestion would be to start with the more expressive vanilla object--
> [text]-- and see
> if it fulfills your needs. Keep in mind though that it is at core not a
> key/value store but instead
> a 2-dimensional array of atoms. E.g., you can decide that the first item
> in each line is your
> key, but the text class interface does nothing to prevent you from adding
> more lines that
> duplicate that same key.
>
> -Jonathan
>
> > -ali
>
>
>
> On Tue, Jul 18, 2017 at 1:16 PM, Jonathan Wilkes <jancs...@yahoo.com>
> wrote:
>
> Variable number of keys of arbitrarily typed values, or
> set number of keys with set value types?
>
> -Jonathan
>
>
> --
> *From:* Ali Momeni <batc...@gmail.com>
> *To:* Pd-List <pd-list@lists.iem.at>
> *Sent:* Tuesday, July 18, 2017 1:09 PM
> *Subject:* [PD] your favorite key:value data structure?
>
> Hello all,
>
> I'm looking for something analogous to the Max "coll" object, or a python
> dictionary, or anything with key value pairs.
>
> I'm aware of the 'cyclone' and its 'coll' object.
>
> i'm wondering if there is a pd-vanilla friendly alternative to this 3rd
> party external.
>
> any hints?
>
> thanks in advance,
>
> ali
> __ _
> Pd-list@lists.iem.at mailing list
> UNSUBSCRIBE and account-management -> https://lists.puredata.info/
> listinfo/pd-list <https://lists.puredata.info/listinfo/pd-list>
>
>
>
>
>
>
> ___
> Pd-list@lists.iem.at mailing list
> UNSUBSCRIBE and account-management -> https://lists.puredata.info/
> listinfo/pd-list
>
>
___
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management -> 
https://lists.puredata.info/listinfo/pd-list

Re: [PD] your favorite key:value data structure?

[Miller Puckette]

> 
> My suggestion would be to start with the more expressive vanilla object-- 
> [text]-- and see 
> if it fulfills your needs. Keep in mind though that it is at core not a 
> key/value store but instead 
> a 2-dimensional array of atoms. E.g., you can decide that the first item in 
> each line is your 
> key, but the text class interface does nothing to prevent you from adding 
> more lines that 
> duplicate that same key.
> 
> -Jonathan
> 
By default, "search" matches only lines whose first field(s) match the search
key(s).  OTOH, if you have a duplicate key and want to find anything besides the
first occurence of the key it will be tricky.

cheers
Miller


___
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management -> 
https://lists.puredata.info/listinfo/pd-list

Re: [PD] your favorite key:value data structure?

[Jonathan Wilkes via Pd-list]

> Hello Jonathan,

> Thanks for your reply.
> I'm not quite sure what you mean.

> What pd-vanilla object do you use to implement "Variable number of keys of 
> arbitrarily typed values" 
[text], [coll], etc.

> or "set number of keys with set value types"?data structures

The benefit of the latter is that you know the number of "slots" ahead of time 
so you can populate 
the data without needing to allocate memory.

> I should add that I'm interested ultimately in a data structure that I can 
> populate from text files, read by PD.

In that case I don't think the benefit I mentioned wrt data structures matters 
because 
the I/O speed will be your limiting factor.

My suggestion would be to start with the more expressive vanilla object-- 
[text]-- and see 
if it fulfills your needs. Keep in mind though that it is at core not a 
key/value store but instead 
a 2-dimensional array of atoms. E.g., you can decide that the first item in 
each line is your 
key, but the text class interface does nothing to prevent you from adding more 
lines that 
duplicate that same key.

-Jonathan

> -ali


On Tue, Jul 18, 2017 at 1:16 PM, Jonathan Wilkes <jancs...@yahoo.com> wrote:

Variable number of keys of arbitrarily typed values, or 
set number of keys with set value types?
-Jonathan


  From: Ali Momeni <batc...@gmail.com>
 To: Pd-List <pd-list@lists.iem.at> 
 Sent: Tuesday, July 18, 2017 1:09 PM
 Subject: [PD] your favorite key:value data structure?
  
Hello all,
I'm looking for something analogous to the Max "coll" object, or a python 
dictionary, or anything with key value pairs.  
I'm aware of the 'cyclone' and its 'coll' object.
i'm wondering if there is a pd-vanilla friendly alternative to this 3rd party 
external.
any hints?
thanks in advance,
ali__ _
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management -> https://lists.puredata.info/ 
listinfo/pd-list


   



   ___
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management -> 
https://lists.puredata.info/listinfo/pd-list

Re: [PD] your favorite key:value data structure?

[Miller Puckette]

I think you can do this with "text", using "search" to find the line number
containing the key and then "get".

cheers
Miller

On Tue, Jul 18, 2017 at 01:20:46PM -0400, Ali Momeni wrote:
> Hello Jonathan,
> 
> Thanks for your reply.
> I'm not quite sure what you mean.
> 
> What pd-vanilla object do you use to implement "Variable number of keys of
> arbitrarily typed values" or "set number of keys with set value types"?
> 
> I should add that I'm interested ultimately in a data structure that I can
> populate from text files, read by PD.
> 
> -ali
> 
> On Tue, Jul 18, 2017 at 1:16 PM, Jonathan Wilkes <jancs...@yahoo.com> wrote:
> 
> > Variable number of keys of arbitrarily typed values, or
> > set number of keys with set value types?
> >
> > -Jonathan
> >
> >
> > --
> > *From:* Ali Momeni <batc...@gmail.com>
> > *To:* Pd-List <pd-list@lists.iem.at>
> > *Sent:* Tuesday, July 18, 2017 1:09 PM
> > *Subject:* [PD] your favorite key:value data structure?
> >
> > Hello all,
> >
> > I'm looking for something analogous to the Max "coll" object, or a python
> > dictionary, or anything with key value pairs.
> >
> > I'm aware of the 'cyclone' and its 'coll' object.
> >
> > i'm wondering if there is a pd-vanilla friendly alternative to this 3rd
> > party external.
> >
> > any hints?
> >
> > thanks in advance,
> >
> > ali
> > ___
> > Pd-list@lists.iem.at mailing list
> > UNSUBSCRIBE and account-management -> https://lists.puredata.info/
> > listinfo/pd-list
> >
> >
> >

> ___
> Pd-list@lists.iem.at mailing list
> UNSUBSCRIBE and account-management -> 
> https://lists.puredata.info/listinfo/pd-list


___
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management -> 
https://lists.puredata.info/listinfo/pd-list

Re: [PD] your favorite key:value data structure?

[Ali Momeni]

Hello Jonathan,

Thanks for your reply.
I'm not quite sure what you mean.

What pd-vanilla object do you use to implement "Variable number of keys of
arbitrarily typed values" or "set number of keys with set value types"?

I should add that I'm interested ultimately in a data structure that I can
populate from text files, read by PD.

-ali

On Tue, Jul 18, 2017 at 1:16 PM, Jonathan Wilkes <jancs...@yahoo.com> wrote:

> Variable number of keys of arbitrarily typed values, or
> set number of keys with set value types?
>
> -Jonathan
>
>
> --
> *From:* Ali Momeni <batc...@gmail.com>
> *To:* Pd-List <pd-list@lists.iem.at>
> *Sent:* Tuesday, July 18, 2017 1:09 PM
> *Subject:* [PD] your favorite key:value data structure?
>
> Hello all,
>
> I'm looking for something analogous to the Max "coll" object, or a python
> dictionary, or anything with key value pairs.
>
> I'm aware of the 'cyclone' and its 'coll' object.
>
> i'm wondering if there is a pd-vanilla friendly alternative to this 3rd
> party external.
>
> any hints?
>
> thanks in advance,
>
> ali
> ___
> Pd-list@lists.iem.at mailing list
> UNSUBSCRIBE and account-management -> https://lists.puredata.info/
> listinfo/pd-list
>
>
>
___
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management -> 
https://lists.puredata.info/listinfo/pd-list

Re: [PD] your favorite key:value data structure?

[Jonathan Wilkes via Pd-list]

Variable number of keys of arbitrarily typed values, or 
set number of keys with set value types?
-Jonathan


  From: Ali Momeni <batc...@gmail.com>
 To: Pd-List <pd-list@lists.iem.at> 
 Sent: Tuesday, July 18, 2017 1:09 PM
 Subject: [PD] your favorite key:value data structure?
   
Hello all,
I'm looking for something analogous to the Max "coll" object, or a python 
dictionary, or anything with key value pairs.  
I'm aware of the 'cyclone' and its 'coll' object.
i'm wondering if there is a pd-vanilla friendly alternative to this 3rd party 
external.
any hints?
thanks in advance,
ali___
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management -> 
https://lists.puredata.info/listinfo/pd-list


   ___
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management -> 
https://lists.puredata.info/listinfo/pd-list

[PD] your favorite key:value data structure?

[Ali Momeni]

Hello all,

I'm looking for something analogous to the Max "coll" object, or a python
dictionary, or anything with key value pairs.

I'm aware of the 'cyclone' and its 'coll' object.

i'm wondering if there is a pd-vanilla friendly alternative to this 3rd
party external.

any hints?

thanks in advance,

ali
___
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management -> 
https://lists.puredata.info/listinfo/pd-list