Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re^7: Algorithm for cancelling common factors between two lists of multiplicands

by tmoertel (Chaplain)
on Aug 11, 2005 at 06:20 UTC ( #482854=note: print w/replies, xml ) Need Help??


in reply to Re^6: Algorithm for cancelling common factors between two lists of multiplicands
in thread Algorithm for cancelling common factors between two lists of multiplicands

The pattern (_:_) will not match an empty list [], so the first definition will match only when both input lists are non-empty. If one or both of the inputs are empty, the second definition will match.
  • Comment on Re^7: Algorithm for cancelling common factors between two lists of multiplicands

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://482854]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (5)
As of 2022-12-04 19:24 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?