Wednesday, March 2, 2016

Digest for comp.lang.c++@googlegroups.com - 20 updates in 6 topics

wij@totalbb.net.tw: Mar 01 11:51PM -0800

On Wednesday, March 2, 2016 at 6:42:21 AM UTC+8, Lynn McGuire wrote:
> https://developerblog.redhat.com/2016/02/29/why-cstdlib-is-more-complicated-than-you-might-think/?
 
> I still want a standard user interface library and a standard graphics library.
 
> Lynn
 
In C++, nothing can really be certain, for example:
try {
auto x=printf("abc"); // how to understand this?
...
}
catch(std::exception&) {
// may be nothing related to printf or "abc"
// basically, everything is unknown here
};
Christopher Pisz <nospam@notanaddress.com>: Mar 02 11:38AM -0600

On 3/1/2016 4:41 PM, Lynn McGuire wrote:
 
> I still want a standard user interface library and a standard graphics
> library.
 
> Lynn
 
I wish we could just have C++ without C. So, many problems come from C.
So many developers that would use C++ if not for the messes C made.
 
--
I have chosen to troll filter/ignore all subthreads containing the
words: "Rick C. Hodgins", "Flibble", and "Islam"
So, I won't be able to see or respond to any such messages
---
scott@slp53.sl.home (Scott Lurndal): Mar 02 05:53PM


>> Lynn
 
>I wish we could just have C++ without C. So, many problems come from C.
>So many developers that would use C++ if not for the messes C made.
 
I suspect that C++ wouldn't exist if it hadn't maintained compatibility
with C.
 
If you want C++ without C, use Java.
Lynn McGuire <lmc@winsim.com>: Mar 02 12:32PM -0600

On 3/2/2016 11:38 AM, Christopher Pisz wrote:
 
>> Lynn
 
> I wish we could just have C++ without C. So, many problems come from C. So many developers that would use C++ if not for the messes C
> made.
 
I believe that the major usage of C nowadays is embedded software such as EMS (engine management systems) where dynamic allocation of
memory is strictly forbidden. C++ will probably never be used in such environments.
 
And of course, device drivers. And the basic portions of operating systems. And, etc.
 
Lynn
Wouter van Ooijen <wouter@voti.nl>: Mar 02 07:46PM +0100

Op 02-Mar-16 om 7:32 PM schreef Lynn McGuire:
 
> I believe that the major usage of C nowadays is embedded software such
> as EMS (engine management systems) where dynamic allocation of memory is
> strictly forbidden. C++ will probably never be used in such environments.
 
Why? C++, when applied appropriately, is so much better than C on such
targets.
 
Wouter
scott@slp53.sl.home (Scott Lurndal): Mar 02 07:15PM

>> strictly forbidden. C++ will probably never be used in such environments.
 
>Why? C++, when applied appropriately, is so much better than C on such
>targets.
 
Truth. Many of the embedded projects that our processors are used with
are written in C++. Perhaps a majority of them. Aided by the fact
that C++ _is_ derived from C.
Lynn McGuire <lmc@winsim.com>: Mar 02 03:19PM -0600

On 3/2/2016 1:15 PM, Scott Lurndal wrote:
 
> Truth. Many of the embedded projects that our processors are used with
> are written in C++. Perhaps a majority of them. Aided by the fact
> that C++ _is_ derived from C.
 
What do you do when your embedded program runs out of ram? Does the car crash?
 
Lynn
Ian Collins <ian-news@hotmail.com>: Mar 03 10:20AM +1300

Lynn McGuire wrote:
>> are written in C++. Perhaps a majority of them. Aided by the fact
>> that C++ _is_ derived from C.
 
> What do you do when your embedded program runs out of ram? Does the car crash?
 
Most smaller embedded applications (whether C or C++) don't use dynamic
allocation.
 
--
Ian Collins
legalize+jeeves@mail.xmission.com (Richard): Mar 02 09:47PM

[Please do not mail me a copy of your followup]
 
Lynn McGuire <lmc@winsim.com> spake the secret code
 
>I still want a standard user interface library and a standard graphics library.
 
You write this as if there were no portable way of writing graphics
applications, but the plethora of such programs puts the lie to your
portrayal of the state of affairs.
 
Plenty of solutions already exist and there is no need to try and cram
them into the standard.
--
"The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline>
The Computer Graphics Museum <http://computergraphicsmuseum.org>
The Terminals Wiki <http://terminals.classiccmp.org>
Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>
legalize+jeeves@mail.xmission.com (Richard): Mar 02 09:50PM

[Please do not mail me a copy of your followup]
 
Lynn McGuire <lmc@winsim.com> spake the secret code
 
>I believe that the major usage of C nowadays is embedded software such
 
I thought the major use of C nowadays was on the linux kernel because
linus got a stick up his ass about C++.
 
Plenty of people are doing device drivers, operating system components
(or even entire operating systems) and embedded applications in C++.
 
20 years ago an entire operating system (BeOS) was written in C++.
--
"The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline>
The Computer Graphics Museum <http://computergraphicsmuseum.org>
The Terminals Wiki <http://terminals.classiccmp.org>
Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>
legalize+jeeves@mail.xmission.com (Richard): Mar 02 09:51PM

[Please do not mail me a copy of your followup]
 
Lynn McGuire <lmc@winsim.com> spake the secret code
>> are written in C++. Perhaps a majority of them. Aided by the fact
>> that C++ _is_ derived from C.
 
>What do you do when your embedded program runs out of ram? Does the car crash?
 
This has nothing to do with C++. C has a heap as well.
 
Just like in C, you can choose not to use the heap.
--
"The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline>
The Computer Graphics Museum <http://computergraphicsmuseum.org>
The Terminals Wiki <http://terminals.classiccmp.org>
Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>
ram@zedat.fu-berlin.de (Stefan Ram): Mar 01 11:59PM

>Hmmm... not to my ears. The vowel in the WAV file sounds like the
[symbol]
>that ppears in the Wikipedia page
 
But then why does Bjarne write in his FAQ:
 
»The second U is a bit like the OO in OOP, but still
short; maybe Strov-stroop will give an idea.«?
 
I believe that the »v« might be related to what
is also known as »stød« or a »creaky voice«.
 
But the sound in the English pronunciation of »stroop«
is as in »loop«, that is, [u], not [O].
bleachbot <bleachbot@httrack.com>: Mar 02 09:33PM +0100

bleachbot <bleachbot@httrack.com>: Mar 02 09:55PM +0100

bleachbot <bleachbot@httrack.com>: Mar 02 10:32PM +0100

Ramine <ramine@1.1>: Mar 02 04:34PM -0800

Hello.......
 
 
 
Here is my thoughts on mathematical queuing theory...
 
I have read some books that explain mathematical queuing theory,
but i was not satisfied, because i was interesting in how to model
an Ecommerce website, but mathematical queuing theory on those
books have answered the question on how to fix the arrival rate
that is markovien, that means the inter-arrival are distributed in
an exponential manner, and i have read more books that talked about the
case when the database server have an hyper-exponential distribution
and i have understood how to model it mathematically when
the Ecommerce have a read-mostly workload with writer transactions
that are less or equal to 30% of the total transactions, but
queuing theory didn't answer all my questions, because mathematical
queuing theory does answer the question of what is the waiting time
of the internet user of the website when the waiting time is dependant
on the arrival rate that must not go beyond the Kned of the queues, but
this is not a sufficient condition to model the Ecommerce website,
because how can you fix efficiently the number of internet connections
on the webserver and how to have a control on the waiting time
efficiently in a dependant manner on the number of connections, the
mathematical queuing theory books that i have read have not answered
those questions, so i have come with a new algorithm that permit to have
an efficient control on the waiting time of the internet users of the
Ecommerce website, and that permit to fix efficiently the number of
internet connections on the webserver to have more control
on the waiting time for a better QOS, and for this i have come with a
new windows synchronization semaphore that is FIFO fair
and that optimize more the waiting time for a better QOS.
 
 
This was my second project.
 
 
Thank you,
Amine Moulay Ramdane.
Ramine <ramine@1.1>: Mar 02 03:36PM -0800

Hello........
 
 
I was working all those previous days on my new projects,
i have worked on two projects, my first project cons=ist of
an optimal implementation that uses Dijkstra's algorithm with
a binary heap that takes a time complexity to E*log(V), V is
the number of vertices and E is the number of edges. This library can be
used in parallel clusters mannerby dividing your graph in many parts to
speed much your parallel algorithm, also i have added an option that
permit you to pass the edges of the graph that you can substract from
your graph to be able to give you algorithm more control if you want for
example to ignore congestions in some roads...
 
This was my first project that i am finishing.
 
My second project is about capacity planning , i have come
with an algorithm that permit you to fix the number of internet
connections easily and have control on the waiting time
of the internet users that are using for example your Ecommerce
website, my new algorithm uses a new semaphore that is
FIFO fair because it must be FIFO fair to be be more optimal,
and i will also show you how to model an Ecommerce with queuing
theory that contain a queue with an hyperexponential service that
can be approximated with an M/M/1 queue when the writer transactions are
less or equal to 30% of the total transactions and the Ecommerce have a
read-mostly workload.
 
 
I am right now finishing my second project.
 
 
 
 
Thank you,
Amine Moulay Ramdane.
Ramine <ramine@1.1>: Mar 02 03:57PM -0800

Read again......
 
Hello,
 
 
I was working all those previous days on my new projects,
i have worked on two projects, my first project consist of
an optimal implementation that uses Dijkstra's algorithm with
a binary heap that takes a time complexity of E*log(V), V is
the number of vertices and E is the number of edges. This library can be
used in parallel clusters manner by dividing your graph in many parts to
speed much your parallel algorithm, also i have added an option that
permit you to pass the edges of the graph that you can substract from
your graph to be able to give you algorithm more control if you want for
example to ignore congestions in some roads...
 
This was my first project that i am finishing.
 
My second project is about capacity planning , i have come
with an algorithm that permit you to fix the number of internet
connections easily and have control on the waiting time
of the internet users that are using for example your Ecommerce
website, my new algorithm uses a new semaphore that is
FIFO fair because it must be FIFO fair to be be more optimal,
and i will also show you how to model an Ecommerce with queuing
theory that contain a queue with an hyperexponential service that
can be approximated with an M/M/1 queue when the writer transactions are
less or equal to 30% of the total transactions and the Ecommerce have a
read-mostly workload.
 
 
I am right now finishing my second project.
 
 
 
 
Thank you,
Amine Moulay Ramdane.
Bertel Lund Hansen <gadekryds@lundhansen.dk>: Mar 02 12:52PM +0100

Stefan Ram skrev:
 
> short; maybe Strov-stroop will give an idea.«?
 
> I believe that the »v« might be related to what
> is also known as »stød« or a »creaky voice«.
 
No. There is a stød after "Strou", but the v has nothing to do
with it. And don't use a creaky voice when speaking Danish - or
any other language for that matter.
 
> But the sound in the English pronunciation of »stroop«
> is as in »loop«, that is, [u], not [O].
 
That is not the correct sound. It's just Bjarne's best guess at
how to describe the sound.
 
Crossposted to: comp.lang.c++, dk.kultur.sprog
 
--
Bertel - stadig med Linux
"Alf P. Steinbach" <alf.p.steinbach+usenet@gmail.com>: Mar 02 01:20AM +0100

On 01.03.2016 21:40, Juha Nieminen wrote:
> its size."
 
> If it's non-binding, I interpret that as the implementation just
> having an empty shrink_to_fit() function as being valid.
 
Yes, formally.
 
The reason that it's non-binding is that it can be inefficient,
completely no-win, to reduce capacity in some situations.
 
And so the easy to use function has a safety catch, while those who are
bent on reducing the capacity no matter what, and know what they're
doing, can easily accomplish that via e.g. the swap idiom.
 
Note that this has only very peripherally to do with shrinking an
allocation itself.
 
Unlike std::string, a std::vector can't use the short buffer
optimization, and can't be generally based on e.g. `malloc` and
`realloc`. Experiments (I think e.g. Howard Hinnant tried this) have
shown that it can be significantly faster with `realloc`. So I think it
ideally should be done as an optimization for the case of built-in type
as item type, but unfortunately it can't be done for the general case.
 
 
Cheers & hth.,
 
- Alf
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.lang.c+++unsubscribe@googlegroups.com.
Posted by at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)