• Skip to main content
  • Skip to search
  • Skip to footer
Cadence Home
  • This search text may be transcribed, used, stored, or accessed by our third-party service providers per our Cookie Policy and Privacy Policy.

  1. Community Forums
  2. Custom IC SKILL
  3. how to declare an array of unknown size

Stats

  • Locked Locked
  • Replies 11
  • Subscribers 143
  • Views 25540
  • Members are here 0
This discussion has been locked.
You can no longer post new replies to this discussion. If you have a question you can start a new discussion

how to declare an array of unknown size

Sri Charan B
Sri Charan B over 13 years ago

Hi,

I am trying to implement a code where i came in need of an array which can increase the size of the array during the runtime. I mean the size of the array shall not be declared using the 'declare' command but during the run time if new elements are to be added into that array i will use it or else the array shall be empty.

I need this because i am at a juncture where i cannot expect or fix the size of the array to a particular value so guys please help me.

Thanks in advance for any help,

  • Cancel
Parents
  • Andrew Beckett
    Andrew Beckett over 13 years ago

    Two implementations:

     procedure(CCFunique(lst)
      let((uniq)
        foreach(elem lst
          unless(member(elem uniq)
            uniq=cons(elem uniq)
          )
        )
        uniq
      )
    )


    procedure(CCFunique(lst)
      let(((uniq makeTable('uniq)))
        foreach(elem lst
          uniq[elem]=t
        )
        uniq->?
      )
    )

    The first uses lists directly, whereas the second uses a hash table to collect the duplicates. The first is probably more straightforward to understand, but will be slower for larger lists (well, if the list of unique items is larger) because the member() function will do a repeated sequential search.

    Take your pick!

    Regards,

    Andrew.

    • Cancel
    • Vote Up 0 Vote Down
    • Cancel
Reply
  • Andrew Beckett
    Andrew Beckett over 13 years ago

    Two implementations:

     procedure(CCFunique(lst)
      let((uniq)
        foreach(elem lst
          unless(member(elem uniq)
            uniq=cons(elem uniq)
          )
        )
        uniq
      )
    )


    procedure(CCFunique(lst)
      let(((uniq makeTable('uniq)))
        foreach(elem lst
          uniq[elem]=t
        )
        uniq->?
      )
    )

    The first uses lists directly, whereas the second uses a hash table to collect the duplicates. The first is probably more straightforward to understand, but will be slower for larger lists (well, if the list of unique items is larger) because the member() function will do a repeated sequential search.

    Take your pick!

    Regards,

    Andrew.

    • Cancel
    • Vote Up 0 Vote Down
    • Cancel
Children
No Data

Community Guidelines

The Cadence Design Communities support Cadence users and technologists interacting to exchange ideas, news, technical information, and best practices to solve problems and get the most from Cadence technology. The community is open to everyone, and to provide the most value, we require participants to follow our Community Guidelines that facilitate a quality exchange of ideas and information. By accessing, contributing, using or downloading any materials from the site, you agree to be bound by the full Community Guidelines.

© 2025 Cadence Design Systems, Inc. All Rights Reserved.

  • Terms of Use
  • Privacy
  • Cookie Policy
  • US Trademarks
  • Do Not Sell or Share My Personal Information