Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2001
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2001

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Q: Is there an "inverse" of ToRules?

  • To: mathgroup at smc.vnet.net
  • Subject: [mg31058] Re: [mg31038] Q: Is there an "inverse" of ToRules?
  • From: BobHanlon at aol.com
  • Date: Sat, 6 Oct 2001 03:32:28 -0400 (EDT)
  • Sender: owner-wri-mathgroup at wolfram.com

In a message dated 2001/10/5 1:48:07 AM, mcoleman at bondspace.com writes:

>Is there an "inverse" to the ToRules function? That is, a function 
>that converts rules to equations (expressed in == form), which could 
>then be used in the Solve function?
>

{a -> b, c -> d, e -> f} /. 
  (x_ -> y_) :> (x == y)

{a == b, c == d, e == f}


Bob Hanlon
Chantilly, VA  USA


  • Prev by Date: BMP->Table
  • Next by Date: Using results of Solve[simultaneous equations]
  • Previous by thread: Re: Q: Is there an "inverse" of ToRules?
  • Next by thread: How to get the MathID (MachineID) under MS Windows most quickly