• 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. Fast access to N-th figure in number

Stats

  • Locked Locked
  • Replies 7
  • Subscribers 142
  • Views 6485
  • 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

Fast access to N-th figure in number

Slawa
Slawa over 15 years ago

Hello

    How quickly to receive N-th sign after a comma in number with a floating point? For example there are numbers

1.0             2.431             3.00              4.54            5.678
How to receive 3 sign after a comma for these numbers? It is necessary for me to receive in the given example of number 0 1 0 0 8 accordingly. Quantity of such primary numbers in my problem equally N therefore operation necessary for me should be the fastest.

Regards

Slawa 

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

    Slawa,

    I doubt this would end up being a performance bottleneck in any practical code you write. Multiplication is pretty fast compared with many other higher level operations (such as list construction and garbage collection). You could also use something like this:

     atoi(substring(index(sprintf(nil "%.9f" n) ".") 4 1))

    I used 9 digits in the sprintf because if you only use 3, it will round the 3rd digit - depends of course what you want. I'd be really surprised if this was faster though.

    I did a quick check (using the SKILL profiler) and if I run 10 million calls to the above two different statements, the mod() version takes 15 seconds (5 of which is in gc, 4 in truncate, and only 1 in times), whereas the string-based approach takes 30 seconds, 15 of which is in sprintf, and 10 in substring and index.

    15 seconds for 10 million calls is not exactly bad... and as I said, I'd expect building a list with this number of items would almost certainly take longer.

    Regards,

    Andrew.

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

    Slawa,

    I doubt this would end up being a performance bottleneck in any practical code you write. Multiplication is pretty fast compared with many other higher level operations (such as list construction and garbage collection). You could also use something like this:

     atoi(substring(index(sprintf(nil "%.9f" n) ".") 4 1))

    I used 9 digits in the sprintf because if you only use 3, it will round the 3rd digit - depends of course what you want. I'd be really surprised if this was faster though.

    I did a quick check (using the SKILL profiler) and if I run 10 million calls to the above two different statements, the mod() version takes 15 seconds (5 of which is in gc, 4 in truncate, and only 1 in times), whereas the string-based approach takes 30 seconds, 15 of which is in sprintf, and 10 in substring and index.

    15 seconds for 10 million calls is not exactly bad... and as I said, I'd expect building a list with this number of items would almost certainly take longer.

    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