Re: C or C++ for FOSS/linux?

On a sunny day (Fri, 29 Dec 2006 21:07:55 +0000) it happened Rui Maciel
<rui.maciel@xxxxxxxxx> wrote in <459583b3$0$28806$a729d347@xxxxxxxxxxxxxxx>:

If you want to provide any new origial functionality, then you will still
have to code it.
Coding in C is simpler and faster that is Stroussup language.

Simpler and faster? Answer me this: when writing a C programmer what do you
do when you need a simple data structure like a linked list?

I cut and paste from a previous coded linked list.
It is written so generic that all I have to do is change some name that
takes 5 seconds with my editor.
If the structures making up the list need other members, then you will have to
specify those in C++ too.
That said I have seen people write linked lists in 5 lines in C in probably less
then 5 seconds.
Just that it took me much longer to understand their code :-)

Qt 4 is the worst bloat I have seen in Linux since Linux 0.8 came out.
.

Relevant Pages

  • Re: performance of hardware dynamic scheduling
    ... Each element of the data structure is a member ... |> of several linked lists, any of which may be the principal search route. ... |> sub-groups, but the number of elements in a sub-group may be very large, ... Handling such structures in Fortran 77 was a right pain! ...
    (comp.arch)
  • Re: Sparse matrix assmbly Finite Volumes
    ... matrix in a sparse format on the spot (without the need of computing ... dynamic data structure and I created the matrix element if one was ... where the first pass creates the nonzero pattern ... If you do what I did, just use linked lists that store only the j's. ...
    (comp.lang.fortran)
  • Re: Sparse matrix assmbly Finite Volumes
    ... matrix in a sparse format on the spot (without the need of computing ... dynamic data structure and I created the matrix element if one was ... where the first pass creates the nonzero pattern ... If you do what I did, just use linked lists that store only the j's. ...
    (comp.lang.fortran)
  • Re: which data structure to use , when
    ... have seen a perticular problem and used a perticular data structure, ... The correct answer is of course that you should pick the data structure ... seem to end up using linked lists. ...
    (comp.programming)
  • Re: lookup data structure that returns the previous element as well
    ... lookup data structure that returns the previous element as well ... >I am looking for a data structure that I need to use as follows. ... ambiguous (previous in-order node -- or the node's parent). ... I assume you mean the former, as you mention linked lists. ...
    (comp.lang.c)