Here is a list of all variables with links to the classes they belong to:

- b -

• B : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ComponentInfo, frodo2.benchmarks.kidneys.KidneyExchange.ABO
• BACKTRACK_MSG_TYPE : frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >
• bestOffer : frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• bestOfferer : frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• bestSol : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ComponentInfo, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ComponentInfo
• bestUtil : frodo2.algorithms.duct.SearchNode< V extends Addable< V > >
• bidder : frodo2.benchmarks.auctions.cats.Bid
• bidderID : frodo2.benchmarks.auctions.cats.Bidder
• biddersList : frodo2.benchmarks.auctions.cats.Auction
• bidID : frodo2.benchmarks.auctions.cats.Bid
• bidPattern : frodo2.benchmarks.auctions.main.CATSToXCSP
• bidsList : frodo2.benchmarks.auctions.cats.Auction, frodo2.benchmarks.auctions.cats.Bidder, frodo2.benchmarks.auctions.cats.Good
• bigInt : frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.FakeEncryptedInteger
• bitLength : frodo2.algorithms.mpc_discsp.PaillierPublicKey
• blackHole : frodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > >
• bloodA : frodo2.benchmarks.kidneys.KidneyExchange
• bloodB : frodo2.benchmarks.kidneys.KidneyExchange
• bloodO : frodo2.benchmarks.kidneys.KidneyExchange
• bound : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo, frodo2.algorithms.duct.tests.DUCTagentTest
• BOUND_MSG_TYPE : frodo2.algorithms.duct.Normalize< V extends Addable< V > >, frodo2.algorithms.duct.Sampling< V extends Addable< V > >
• boundClass : frodo2.algorithms.duct.Sampling< V extends Addable< V > >
• bounds : frodo2.algorithms.duct.SearchNode< V extends Addable< V > >
• branchingFactor : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• byteArray : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.IntArrayWrapper