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 long list here:
listA=list(P1 P2 P3 ... Px-1 Px Px+1 ... Pn)
for a given Px, I want to substitute Px with 2 new elements Px1 Px2 :
ListB=list(P1 P2 P3 ... Px-1 Px1 Px2 Px+1 ... Pn)
I know how to do it using "reverse()" function.
But based on SKILL Language User Guide, reverse() can generate a lot of memeory.
Is there a more efficient way to do this? I don't care if it is destructive or nondestructive.
Here is my code using reverse():
listB2=rplaca(member(Px listA) Px2) ;listB2=>list(Px2 ... Pn)
listB1=reverse(rplaca(member(Px2 reverse(listA) Px1) ;listB1=>list(P1 P2 P3 ... Px-1 Px1)
listB=append(listB1 listB2) ;ListB=>list(P1 P2 P3 ... Px-1 Px1 Px2 Px+1 ... Pn)
match=member(Px listA)listB= if(eq(match listA) then constar(Px1 Px2 cdr(listA)) else rplaca(match Px1) rplacd(match cons(Px2 cdr(match))) listA )
You also should consider whether a list is the right data structure for your needs - I presume whatever you are doing needs to be ordered, otherwise you could have just stuck Px2 on the beginning. Or used a table.
In reply to Andrew Beckett:
Actually, listA is the points of a path object. It should remain their original order.
Further more, if i want to break listA into 2 seperate sublists
listA1=list(P1 P2 P3 ... Px-1)
listA2=list(Px ... Pn)
What should I do to get listA1 and listA2?
Can I just break the pointer (or called link) between Px-1 and Px?
Thanks again for your quick reply.
In reply to sparksu:
Something like this:
match=nilforeach(map rem listA when(cadr(rem)==Px match=rem))listA2=cdr(match)rplacd(match nil)listA1=listA
Note this doesn't handle the case where the match is at the beginning of the list - but that's cheap to check for and handle, as I did in the previous response. Potentially you could make the foreach stop as soon as it finds a match by doing:
prog(() foreach(map rem listA when(cadr(rem)==Px match=rem return() ) ))
The surrounding prog allows you to use return() to exit the foreach early.