soft and program: Digest for comp.programming.threads@googlegroups.com

Thursday, February 26, 2015

Digest for comp.programming.threads@googlegroups.com - 19 updates in 7 topics

comp.programming.threads@googlegroups.com

Google Groups

Topic digest
View all topics

test - 1 Update
C++ or Object Pascal - 1 Update
cmsg cancel <mc8ko6$2qr$2@dont-email.me> - 13 Updates
I am an arab but i am "french" - 1 Update
Don't worry guys - 1 Update
How do I look inside an .exe file to view the programming - 1 Update
Complexity and divide-and-conquer methods - 1 Update

test

homer500@gmail.com: Feb 25 04:37PM -0800

This is a test.

C++ or Object Pascal

Ramine <ramine@1.1>: Feb 25 04:37PM -0800

Hello,

I have tried to look at the C++ language and compare it to
Object Pascal, because i am also a Delphi and FreePascal develloper
that is using Object Pascal(i mean object pascal that is more powerful,
not pascal), so i have tried to look at the syntax of C++ patiently
to feel more what is C++ and C , and i have come to the follwing conclusion:

If you look at the "for" statement:

In Object Pascal we write this:

for i := 0 to 6 do

But in C and C++ we write this:

for (i = 0; i < 7; i++)

So as you have noticed there is an "i++" that we must add in C and C++,
so Object Pascal is more beautiful and easier here...

Other than that there is also the "case" statement:

In Object Pascal we write this:

case n of
0: str := 'alpha';
1: str := 'beta';
2: str := 'gamma';
else
str := 'invalid';
end; // case

but in C and C++ we write this:

switch (n)
{
case 0 : str = "alpha";
break;
case 1 : str = "beta";
break;
case 2 : str = "gamma";
break;
default: str = "invalid";
} // switch

So notice with me that in C++ and C you have to write
the "switch" word and you have to write all over again many times
the "case" word, but in Object pascal you write only one time
the "case" word, so Object Pascal is beautiful and easier here...

Other than that i was amazed to not find in C and C++ the data type that
we call "sets" in Object Pascal...

For example in Object Pascal we can do this with the "sets" type:

type
col_t = (red, blu, grn); // enum.
MySetType := set of col_t;
var
a, b, c : MySetType;
begin
a := []; // empty set
a := a + [red]; // union
b := a - [blu]; // difference
c := a * b; // intersection
if [red] in a then ...
(* Note that sets are generally used to handle non-exclusive flags in
Object Pascal. *)

But in C and C++ there is no equivalent type of the "sets" of Object
Pascal, so Object Pascal is beautiful and simple easier here again...

Also in Object Pascal, i have noticed that it's much easier to work with
strings than in C and C++... so Object pascal is more beautiful and
easier here also...

Also i have noticed that it's much easier to create a dynamic link
library(so or dll) with Delphi or FreePascal than with C++ or C compilers...

I think also that i don't need to speak about the macros in C++ or C,
because macros can become easily "cryptic" in C++ or C and that's bad...

And i have noticed that it's much easier to work with dynamic arrays
with Object Pascal than with C++ or C.

So i think i will not continu this comparison between Object Pascal
an C++ and C, because i think C++ and C are a mess.

So i think overall Object Pascal is more "beautiful" and easier than C++
and C, and i think that's the strenght of Object Pascal.

Thank you,
Amine Moulay Ramdane.

cmsg cancel <mc8ko6$2qr$2@dont-email.me>

bleachbot <bleachbot@httrack.com>: Feb 25 09:00PM +0100

bleachbot <bleachbot@httrack.com>: Feb 25 10:36PM +0100

I am an arab but i am "french"

Ramine <ramine@1.1>: Feb 25 01:56PM -0800

Hello,

I am an arab but i am "french", because i always talk and think french
in my daily life...

So i want to share with you this french song of compagnie creole, listen
to it , it's so beautiful...

https://www.youtube.com/watch?v=FNw0X8jy-IA

Thank you,
Amine Moulay Ramdane.

Don't worry guys

Ramine <ramine@1.1>: Feb 25 01:41PM -0800

Hello guys..

Don't worry guys, i will post just few posts in this newsgroup...
so don't be so harsh, and about comp.programming, i was not the person
who have caused people to flee from comp.programming, the newsgroups
of comp.programming and comp.programming.thread was dying in fact before
i have posted in them, so i have decided to post some content there
about parallel programming and such, i didn't want to harm this
comp.programming or comp.programming.threads newsgroups, but since they
were dying , i just wanted to post some content about parallel
programming and such to not let them die...

That's all guys...

Thank you for your time...

Amine Moulay Ramdane.

How do I look inside an .exe file to view the programming

ljshole@gmail.com: Feb 25 10:29AM -0800

> u guyz r rude. serouslee, the brew Ian axed a str8t up qestion.
> shur, he haz limited bakground knowledge but that doesn't meen you should tear into hymn about the complexity of your work. OK, you're a programmer, we're past that... Now answer our god dam qestions about compooters without being a snoody.
> "Given how poorly your question is asked"... get over yourshelf

Thank you my brother. Because they can tell the guy was asking a question what vaguely; they could have just asked him what he meant by explaining a few things to him and not biting his head off.

Complexity and divide-and-conquer methods

Ramine <ramine@1.1>: Feb 25 01:06PM -0800

Hello,

I have come to an interesting subject..

I was asking myself right now what is exactly is the big and important
improvement that brings Object oriented programming like C++ or Object
Pascal or Java or C# ?

I have thought rapidly at this and i think the BIG improvement that
brings object oriented programming is that it tries to "minimize" at
best "complexity" so that it can improve the criterion of
"maintainability" etc.. but how can we look at object programming ?
i think that by analogy it look like divide-and-conquer methods and
algorithms, i mean that object oriented programming is like an
"optimization" that minimizes at best the "complexity",
divide-and-conquer methods and algorithms also try to minimize at best
the number of steps or instructions that an algorithm have to do and we can
measure that as a time complexity expressing it by a O().

Thank you,
Amine Moulay Ramdane.

You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page.
To unsubscribe from this group and stop receiving emails from it send an email to comp.programming.threads+unsubscribe@googlegroups.com.

soft and program

Thursday, February 26, 2015

Digest for comp.programming.threads@googlegroups.com - 19 updates in 7 topics

No comments:

Blog Archive

About Me