I would like to propose an improvement to the C and well c++ language, because I believe it should be available in both languages that would allow us to write more performant code in a Higher Level language without having to write assemble level or low-level c with assemble.

I have proposed typically something similar to javascript, however, this applies to all languages
c, c++ as limitation of all them, goto doesn't hit the mark, comes up a little short.
In c, c++ inline would probably get one near there with compiler optermizations, but it is still not a great way to write code.

I would like to allow loops structures, to do what I describe below, but basically the same applies for c/c++, however, one would be using explicit function inlining.

Typically I am sure that there would be many solutions of comparison, where we would be able to start taking advantage of this to improve the speed of algorithms,
which currently high level languages basically limit.



07 April 2020 - Additional Native Ptr BitMap Flags bit position to int or ptr, value and visa versa visa for languages and CPU  

Also thinking about it stepping a pointer onwards and de-referencing to access the value, I think could also have special optimization, to look
at making this one operation stepAndLoadValue, but I would have go and check the instruction set of various process, but definitely benefit from that
I have go check them out and arm instruction set.
may need a char^ like in delphi, but means variable acts like a pointer, however, pair with its dereferenced version, possibly lazy evaluated.
That would save me from have to have to variables here to reduce the double dereferencing, it's simpler to work with a variable
that have both accessible, thinking maybe look like an iterator, first, second. concept, to keep backwards compatibility with operators.
the wrapping class could then just simplify things and reduce require number of variables for optimal performance.

Overall this reduce the number of if statements and things and allows for faster branch prediction.
Typicaly have string which are null terminated, is much faster as reduces all underlying checks. well at least other languages,
c is not doing that but still, wanting the most performant code.


function match(char* str) {

char* matchme = "matchme\0";

let countMatch = 0;

for(char* ch = str, char chd = ch*;chd != '\0';ch++, chd = *ch)
  // could make this an inline function. 
  char* chs = str, char chds   = chs*; 
  char* mech = matchme, char mechd = *mech ;  
  while(true)  { // sure that by now compiler optermized, could just say loop
     if (chds != mechd) {
        if(mechd == '\0')   {
          continue; // kicks out of the loop and skip the rest of the parent look code, for a case that fail, in the case of successfully match, then countMatch++ will execute.
  mech++; mechd = * mech;    chs++; chds = *chs ; 

Kind Regards,

Wesley Oliver


Virus-free. www.avg.com

Skype: wezley_oliver
MSN messenger: wesley.olis@gmail.com