Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7578299
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 30, 20262026-05-30T17:23:56+00:00 2026-05-30T17:23:56+00:00

Is there a fast way to copy a generic TList? Copy.Capacity := List.Count; for

  • 0

Is there a fast way to copy a generic TList?

Copy.Capacity := List.Count;
for Item in List do
  Copy.Add (Item);

is very slow. There seems to be no way to use CopyMemory since I can’t get the memory adress of the internal array (which is obvious from an information hiding viewpoint). I miss something like

List.Copy (Copy);

which uses the knowledge of the internal representation to improve performance. Can it be done?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-30T17:23:57+00:00Added an answer on May 30, 2026 at 5:23 pm

    For the generic TList<T> it is simply not possible to implement the function you want. That’s because copy the contents of T may involve more than a simple memory copy. If T contains any managed types (i.e. strings, interfaces etc.) then the reference counts on those managed objects must be incremented.

    • If your T does contain managed types then I doubt that you can do much better then the code you already have.
    • If your T does not contain any managed types then a memory copy is viable but you will need to create your own class to encapsulate this list since TList<T> is not appropriate.
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Is there a fast way to count the amount of successive null bytes starting
Is there a fast/efficiency way to check if a table is empty? DECLARE @StartEndTimes
I need to check in some fast way if there is any text nodes
It seems that there are several really fast prime factorization algorithms around (one that
I am looking for a very fast way to filter down a collection in
Is there any fast way to find the largest power of 10 smaller than
Using jQuery, is there a fast way to loop through all unchecked checkboxes on
I am given a boost::filesystem::path. Is there a fast way to get the number
Is there any fast way, or do I have to convert manually them? Thanks.
Is there a fast way in the Address Book framework on the iOS platform

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.