comp.programming Google Group

Re: trees

cbfalco...@yahoo.com (CBFalconer) — Sun, 27 Jul 2008 00:55:07 UT

Make yourself a struct (or equivalent, depending on language)
describing a scheduler. Do the same for a job. Then build
software to do what you want. You will be free to revise the
structs as needed, and eventually you will probably come up with a
workable system. Obviously if you are free to move jobs to

Re: vectorized computation in C++ such as those in Matlab (Matlab to ?C++)?

will...@wilbur.25thandclement.com (William Ahern) — Sun, 27 Jul 2008 01:29:16 UT

<snip>
This is out of my element, but I have written some vector code in GCC, just
for my own edification. I'm not sure how you would translate the above
code... I don't exactly see the vectors, unless I'm misinterpreting. Anyhow:
[link]

Re: trees

p...@informatimago.com (Pascal J. Bourguignon) — Sun, 27 Jul 2008 00:45:23 UT

There is no need for any data structure.
Let J be the number of jobs.
Let S be the number of schedulers.
If J<S*n then there is no solution.
If S*m<J then there is no solution.
Otherwise, allocate J div S jobs to each scheduler,
and the remaining J mod S jobs to the J mod S first schedulers.

trees

sngtnai...@gmail.com — Sat, 26 Jul 2008 22:48:44 UT

Hello
I want to implement the following but Im not sure what data structure
to use.
I have a list of jobs that need to be allocated to schedulers. The
number of schedulers in the
system depend upon the number of jobs. Each scheduler can handle
between n & m jobs. Each scheduler handles at the max m jobs.

boss herrenkleidung online linus herrenmode kaufen boss herrenmode kaufen herrenmode kaufen braeutigam we herrenmode kaufen

thechatte...@googlemail.com — Sat, 26 Jul 2008 19:42:46 UT

boss herrenkleidung online linus herrenmode kaufen boss herrenmode
kaufen herrenmode kaufen braeutigam we herrenmode kaufen
+
+
+
+++ MAENNERKLEIDUNG KAUFEN +++ MAENNERKLEIDUNG ONLINE BESTELLEN +++
+
[link]
[link]
[link]

Re: Dynamic data structures

p...@informatimago.com (Pascal J. Bourguignon) — Sat, 26 Jul 2008 16:41:50 UT

In the case of a stack, you don't need to use one big block, you can
easily use a stack of small blocks.
Even for datastructure with other access mode (eg arrays with random
access), you can use this trick, adding just an indirection on each
access. See for example:
[link]

Dynamic data structures

roman.toe...@hispeed.ch (Roman Töngi) — Sat, 26 Jul 2008 15:52:12 UT

I've learned a strategy to resize the size of a data structure to
implement a dynamic data structure as follows:
E.g. for a stack:
- If the stack if full, create a new one with double of the old size.
before insertion operation it looks like:
after insertion operation:
- If number of elements in the stack gets below a quarter of the size

Re: Program compression

p...@informatimago.com (Pascal J. Bourguignon) — Sat, 26 Jul 2008 11:06:55 UT

Not in languages that don't provide syntactic abstraction.
Let's take a simple example, the Memento pattern:
[link]
Everytime you want to apply this pattern to a new class, you have to
add the following methods and class, take care not to miss a member to
save/restore/keep in the memento:

Re: Program compression

r...@see.sig.invalid (Richard Heathfield) — Sat, 26 Jul 2008 09:06:27 UT

Robert Maas, [link] said:
In any (even relatively sensible) language where it takes /more/ than one
line of code, it only takes more than one line the /first/ time - because
the programmer will wrap it into a function (or procedure, or subroutine,
or whatever) and, in future, call the function (or whatever). So this

Re: Program compression

Sat, 26 Jul 2008 08:43:34 UT

OK, let's say you have a text string which contains the notation
for a nested list starting from the beginning of the string. How
many lines of code, in various modern FPLs, would it take to parse
that nested-list notation to produce an actual nested list
structure, and also report back in another value the position in

Re: paritioning an array evenly without moving data

mcdowe...@mcdowella.demon.co.uk (A.G.McDowell) — Sat, 26 Jul 2008 05:20:57 UT

In article <81074afd-7670-4162-a5be-67163 26d1...@u12g2000prd.googlegrou p
s.com>, JamesBarbetti <James.Barbe...@gmail.com> writes
Try searching for "quantile" as well as median. You may find, for
example
"For large datasets in external memory, Pohl [25] established
that any deterministic algorithm that computes the exact

Re: 16-bit value in 3 bytes?

thadsm...@acm.org (Thad Smith) — Sat, 26 Jul 2008 04:03:23 UT

You listed 28 characters for numeric encoding. Three characters would give
28^3 = 21952 possible values, less than 15 bits. If there were 32
characters, you would encode 5 bits for each character, yielding 15 bits
for 3 characters, plus 1 character for sign, giving 2^16 -1 possible values.

Genital Hair Removal

mzai_...@yahoo.com (farnson) — Sat, 26 Jul 2008 03:36:27 UT

Laser Hair Removal - What You Need To Know
[link]
Laser Hair Removal Parlors In The City Of Toronto
[link]
Genital Hair Removal
[link]

Re: 16-bit value in 3 bytes?

andrejohn....@gmail.com (Andre-John Mas) — Sat, 26 Jul 2008 02:12:18 UT

To provide an example, here are a sequence of packets. The first
character is the packet type and the following bytes represent x,y,z,
x rotation, y rotation and z rotation.
dH000H000H000H000H000H000
dH000H000H000H000H000G??:
dH000H000H000H000H000G?NM
dH000H000H000H000H000G?<M
dH000G???H000H000H000G?KB

Re: finding the median of a list without sorting

gene.ress...@gmail.com (Gene) — Sat, 26 Jul 2008 01:11:35 UT

The practical CS answer is to return the middle pair and punt the
decision to the caller!