Cadence® system design and verification solutions, integrated under our System Development Suite, provide the simulation, acceleration, emulation, and management capabilities.
System Development Suite Related Products A-Z
Cadence® digital design and signoff solutions provide a fast path to design closure and better predictability, helping you meet your power, performance, and area (PPA) targets.
Full-Flow Digital Solution Related Products A-Z
Cadence® custom, analog, and RF design solutions can help you save time by automating many routine tasks, from block-level and mixed-signal simulation to routing and library characterization.
Overview Related Products A-Z
Driving efficiency and accuracy in advanced packaging, system planning, and multi-fabric interoperability, Cadence® package implementation products deliver the automation and accuracy.
Cadence® PCB design solutions enable shorter, more predictable design cycles with greater integration of component design and system-level simulation for a constraint-driven flow.
An open IP platform for you to customize your app-driven SoC design.
Comprehensive solutions and methodologies.
Helping you meet your broader business goals.
A global customer support infrastructure with around-the-clock help.
24/7 Support - Cadence Online Support
Locate the latest software updates, service request, technical documentation, solutions and more in your personalized environment.
Cadence offers various software services for download. This page describes our offerings, including the Allegro FREE Physical Viewer.
Get the most out of your investment in Cadence technologies through a wide range of training offerings.
This course combines our Allegro PCB Editor Basic Techniques, followed by Allegro PCB Editor Intermediate Techniques.
Virtuoso Analog Design Environment Verifier 16.7
Learn learn to perform requirements-driven analog verification using the Virtuoso ADE Verifier tool.
Exchange ideas, news, technical information, and best practices.
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.
It's not all about the technlogy. Here we exchange ideas on the Cadence Academic Network and other subjects of general interest.
Cadence is a leading provider of system design tools, software, IP, and services.
I am trying to do some efficient list processing and would like to use a tconc list. I need to build my list in the order that I find objects, so I cannot use the cons command. This list will grow quite large and as it is growing, I have a while loop processing the data on the front of the list. In the middle of the while loop, many items can be added to the end of the list. I can use the tconc command to efficiently add items to the end of the tconc list, but each time through the while loop, I want to remove the first item from the list with cdr. I don't know how to do this efficiently with a tconc list.
There is a nice description of how tconc works on Sourcelink: http://sourcelink.cadence.com/docs/db/kdb/2002/Apr/11001694.html
However, as you can see, the tconc structure is a list that contains your list and a pointer to the last item in your list. If you want to create a tconc list by other means, you would need to do it this way (note: lconc is the same as tconc, except lconc appends a list to the end of your list and tconc appends one item to the end of your list):
a=list(1 2 3 4)a=cons(a last(a)) => ((1 2 3 4) 4)OR this way:a=list(1 2 3 4)a=lconc(nil a) => ((1 2 3 4) 4)
First, I could take the cdr of the car of my tconc list, then I could use one of the above approaches to rebuild my tconc list. However, I think it would be expensive since last must traverse to the end of the list. Likewise, I assume that lconc has the same overhead.
Anyone have any ideas?
If you don't worry about the memory usage (grow of tconc list) at all, then, I though I could suggest a work-around for the cdr operation on the first list of a tconc list.
Suppose there is a tconc list, TCONC. We can use car(TCONC) to get the pointer to the first item of TCONC, which is the list that you like to do cdr on. This new sub list WILL BE updated when you make any addition to the original TCONC if you use tconc function. So, you can do "cdr" on the sub list when you use tconc to operate the original TCONC.
i TCONC = nil
\i TCONC = tconc(TCONC 1)
\t ((1) 1)
\i subList = (car TCONC)
\i TCONC = tconc(TCONC 2)
\t ((1 2) 2)
\i TCONC = tconc(TCONC 3)
\t ((1 2 3) 3)
\i TCONC = tconc(TCONC 4)
\t ((1 2 3 4) 4)
\i TCONC = tconc(TCONC "end")
\t ((1 2 3 4 "end") "end")
\t (1 2 3 4 "end")
\i subList = (cdr subList)
\t (2 3 4 "end")
\t (3 4 "end")
\i TCONC = tconc(TCONC "extra")
\t ((1 2 3 4 "end" "extra") "extra")
\t (3 4 "end" "extra")
So, the cdr on the first element (a list by itself) of the tconc list is working fine.
However, if you worry about the the memory usage, then, this trick will not be a successful work-around since front list elements will not be released for collection/reuse (TCONC is still lock them)
In reply to Tongju:
I like your thinking! I tried that in my simple testcase and was able to run in 0.12 seconds instead of 22 seconds. I don't think the memory is an issue since the tconc list will be freed when the routine finishes. I'll try it in my original code.