|
Mario Vernari wrote: Typically, I copy the same piece of code two or three times, then I take the last results. I use sleep 5 seconds, then go for it.
M.D.V.
If something has a solution... Why do we have to worry about?. If it has no solution... For what reason do we have to worry about?
Help me to understand what I'm saying, and I'll explain it better to you
Rating helpful answers is nice, but saying thanks can be even nicer.
|
|
|
|
|
|
I'm just an old C++ dinosaur, so my guess is that B and D are the fastest, followed by A and C, and finally the indecipherable twaddle of E--unless it's some kind of secret code for "Hint: you're looking for a single character and therefore don't have to construct "~" , in which case it's probably faster than A and C but slower than B and D.
|
|
|
|
|
Greg Utas wrote: finally the indecipherable twaddle of E--unless it's some kind of secret code for "Hint: you're looking for a single character and therefore don't have to construct "~"
Nope: it's saying "Look for this using a binary comparison, rather than using a culture or shift specific sort order" - basically "compare strings as byte arrays" but using 16 bit values. In theory, this should be much quicker than a non-ordinal comparison as you don't have to deal with "special cases" or "'t' == 'T'", and most processors have machine code instructions for byte based searching and comparing.
"I have no idea what I did, but I'm taking full credit for it." - ThisOldTony
AntiTwitter: @DalekDave is now a follower!
|
|
|
|
|
Next time I can't decipher some twaddle, I'll know who to turn to.
|
|
|
|
|
|
No, it's ok. Read the sticky on top: The Lounge[^] Point2: Technical discussions are welcome...
|
|
|
|
|
Jorgen is right - this isn't a question seeking help, it's a "Hey! look at this!" discussion.
"I have no idea what I did, but I'm taking full credit for it." - ThisOldTony
AntiTwitter: @DalekDave is now a follower!
|
|
|
|
|
Also one of the more interesting posts here in recent times.
|
|
|
|
|
Something similar I tried some years ago: Counting Lines in a String[^]
It shows another couple of methods you could have tried.
"I have no idea what I did, but I'm taking full credit for it." - ThisOldTony
AntiTwitter: @DalekDave is now a follower!
|
|
|
|
|
After close examination, the fastest option is 'skip that block'.
|
|
|
|
|
It might well depend on the string being searched and what is being searched.
|
|
|
|
|
|
Sigh... I was in passionate relationship with VMS from 1980 to 1994. The end of era...[^]
/ravi
|
|
|
|
|
I feel your pain, Ravi. My experience with VAX/VMS ended before yours in 1989, but I still remember the amazing feeling of consistency about things, and how Everything Just Worked.
Software Zen: delete this;
|
|
|
|
|
I first did serious programming on a PDP-10 and felt the same way about it.
|
|
|
|
|
My first programming experiences were on PDP-11s.
|
|
|
|
|
Are you an Ada programmer too?
~d~
|
|
|
|
|
No, but the husband of a friend of mine worked on the VAX ADA compiler at DEC.
/ravi
|
|
|
|
|
~d~
|
|
|
|
|
Noooo! At least I just updated mine last week.
Huh. I guess it pays to read the e-mail that contained my licenses:
"
The HPE OpenVMS Hobbyist licenses we are issuing in 2020 will be the last set.
Subsequently, HPE will not issue new HPE OpenVMS Hobbyist licenses.
Users who wish to avail of HPE OpenVMS long term licenses are encouraged to purchase permanent licenses at standard prices.
"
Yeah, no, I'm not buying it.
They've announced the end of the Hobbyist Program before.
I don't think it really costs them anything to provide Hobbyist licenses.
modified 8-Apr-20 17:25pm.
|
|
|
|
|
Slight wind of hope in the article:
Quote: VSI is considering one option to continue hobbyist-class licenses.
TTFN - Kent
|
|
|
|
|
PIEBALDconsult wrote: I don't think it really costs them anything to provide Hobbyist licenses. ... whereas killing it will cost them a lot of happy and loyal customers.
I wanna be a eunuchs developer! Pass me a bread knife!
|
|
|
|
|
I think they feel they need to protect themselves against anyone who would try to use a Hobbyist License to run a business or otherwise make money.
Which is part of why they have to be renewed yearly.
Were I ever contracted to use one of mine to write an OpenVMS program for money, that might violate my agreement.
I'm not exactly holding my breath awaiting a million-dollar gig.
My systems spend most of their time powered off. About the only time I power them up is when I need to apply the new licenses.
Once in a while I power one up to try out a bit of C code to check compatibility with other compilers.
|
|
|
|
|
PIEBALDconsult wrote: I think they feel they need to protect themselves against anyone who would try to use a Hobbyist License to run a business or otherwise make money.
Which is part of why they have to be renewed yearly.
Were I ever contracted to use one of mine to write an OpenVMS program for money, that might violate my agreement.
I'm not exactly holding my breath awaiting a million-dollar gig.
Quite. And is anyone, anywhere, actually buying new VMS licences? Surely not, except very rarely where porting existing code to Linux is just too expensive.
Who gets the money for existing VMS support contracts? Does HPE provide the support or does VSI get it?
It reminds me of the situation with Xinuos OpenServer 5 and 6 and UnixWare 7: Surely no one is buying new licences for these. The only income source for Xinuos on these must be support of existing contracts. (Is anyone buying OpenServer 10, for that matter?).
If support of existing contracts is in fact the primary income source, one wonders why they don't open source it (this comment applies to both OpenVMS and OpenServer/UnixWare).
|
|
|
|