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 have a list which includes several lists inside. Is there any way that I can sort the lists alphabetly based on the first part of each list (signal name)?
list("V105A_ymax_v9overshoot_1" float(0.9975) float(1.1025) "[V]" )list("V105A_riseTime_v9ramptime_1" float(300u) float(2m) "[s]" )list("V5A_DS3_delay10_v5a_on_1" float(0.0) float(500u) "[s]" )list("V33A_DSW_peakToPeak_v4vripple_1" float(0.0) float(50.0m) "[V]" )list("V5A_DS3_ymin_v2pgoodincr_1" float(4.65) float(4.85) "[V]" )list("DPWROK_delay90_pwrok_delay_1" float(10m) float(15m) "[s]" )list("V33A_DSW_average_v4voutavg_1" float(3.135) float(3.465) "[V]" )list("V105A_ymin_v9pgoodincr_1" float(0.965) float(1.03) "[V]" )
The simplest way to do this is to use sortcar() with your example. Assuming myList contains the list:
That outputs this:
(("DPWROK_delay90_pwrok_delay_1" 0.01 0.015 "[s]") ("V105A_riseTime_v9ramptime_1" 0.0003 0.002 "[s]") ("V105A_ymax_v9overshoot_1" 0.9975 1.1025 "[V]") ("V105A_ymin_v9pgoodincr_1" 0.965 1.03 "[V]") ("V33A_DSW_average_v4voutavg_1" 3.135 3.465 "[V]") ("V33A_DSW_peakToPeak_v4vripple_1" 0.0 0.05 "[V]") ("V5A_DS3_delay10_v5a_on_1" 0.0 0.0005 "[s]") ("V5A_DS3_ymin_v2pgoodincr_1" 4.65 4.85 "[V]"))
In the absence of sortcar, you could do:
myList=sort(myList lambda((a b) alphalessp(car(a) car(b))))
In other words, the second argument to sort is a function that compares two values and returns t if the first is "less" than the second. You can then do whatever comparison you like - here I'm using alphalessp on the car of each entry, which is your signal name here. I could equally well sort on the second entry in each list (the numbers) by doing:
myList=sort(myList lambda((a b) cadr(a)<cadr(b)))
And so on.
In reply to Andrew Beckett:
never mind. I think I can build the list twice.
Thanks for the tips.
In reply to mbchang:
To respond to your last question (that's now disappeared) - how about sorting everything in the list except for the first element? In that case you could sort the cdr of the list, that is to say, everything in the 'tail' of the list, after taking the first item (the 'head') away. Beware that "sort" is a destructive list operator, so you must save the return result of the sort function since it modifies the list in place.
Hopefully this helps you?
In reply to skillUser:
This could probalby do it.
Andrew wasn't the intial code from you? Can't remeber.
In reply to berndfi:
I agree (the code wasn't from me though - I don't believe in having the type of variables encoded in the names as it makes them hard to read, so it wasn't my code).