Re: Cost of calling a standard library function

From: hutch-- (hutch_at_movsd.com)
Date: 03/01/04 

Date: 29 Feb 2004 15:45:06 -0800

Wannabee,

Don't get your knickers in a knot, its just a matter of fact that
BetovAsm does not handle structures so you must use an array instead.
An array is an abstract as well.

The second pice of code should be a lot faster on a dedicated 16 byte
copy.

You will always have problems posting code in a format that very few
understand and are even less willing to learn and it will be to your
advantage over time to learn the dominant notation as it will expose
you to far more code that is far better written than what you will
have seen so far.

You can get code examples from Intel, AMD and the mountain of properly
written MASM code that is available from many different sources in 32
bit.

Now in that data you will see notation for structures, unions and
other more complex data managing methods and it will be to your
advantage to learn them as it extends your capacity many times over
when you master them.

It does not matter if you are writing in NASM, FASM, MASM, TASM,
GoAsm, GAS or HLA that seems to be able to use most of them, its
whether you have enough capacity to learn how to do the more difficult
stuff and that has finally been what the debate has been about,
capacity.

Regards,

hutch at movsd dot com

Relevant Pages

  • Increase capacity of a standard logical drive - cluster configurat
    ... We need to increase the capacity of one array in order to present the same ... array in order to have a bigger disk, ... letters that are associates with the logical drives. ...
    (microsoft.public.windows.server.clustering)
  • Re: sizeof([ALLOCATED MEMORY])
    ... applications exist which could make use of that extra memory if only ... Perhaps I should elucidate "dynamic array". ... Repeated growth in size can lead to quadratic expense due to continually ... the array keep track of both a logical size and a physical capacity ...
    (comp.lang.c)
  • Re: Can you fix this program? : C++ Dynamic Array Problems
    ... Dynamic Array similar to System.Collections.ArrayList in .NET. ... Capacity = 0; ... void FoldersCollection::Add(Folder folder) ... int newCapacity = Capacity*2; ...
    (microsoft.public.dotnet.languages.vc)
  • Re: Comparison to Comparison
    ... alive", no matter how long you wait after the Collect call, and no ... regardless of the size of the array. ... As near as I can tell, the issue is that when you assign into the objectas part of the argument to the WeakReference constructor, the compiler generates a hidden local variable. ... But, absent a more invasive inspection of the execution of the code, I'd admit that even your code example isn't proof of that. ...
    (microsoft.public.dotnet.languages.csharp)
  • Re: Array.Clear vs List<>.Clear
    ... so every time you add one element over the List.Capacity, the it will create a new array, copy the elements, add the new item and then destroying the old array. ... default size starts out at 4 elements, and each time you exceed the capacity of the list, the newly allocated storage has double the previous capacity. ... It's true that for smaller lists, there are more allocations, and so the copying is a larger part of the overall time cost. ... But then, for smaller lists, the total time cost is significantly lower anyway, so that proportional difference isn't really a big deal. ...
    (microsoft.public.dotnet.languages.csharp)
Loading