| Ability Score | All Classes | Specific Class | Requirements | Level Up Fighter | Level Up Mage | Level Up Thief |
| Charisma | 13 initial 7 leveling 5 gameplay | 16+:
|
|
|
| |
| Constitution | 9 initial 13 leveling 3 gameplay | |||||
| Dexterity | 9 initial 15 leveling 1 gameplay | Thief 9 initial 11 leveling 4 gameplay | ||||
| Intelligence | 17 initial 6 leveling 2 gameplay | Mage 17 initial 3 leveling 5 gameplay | ||||
| Strength | 9 initial 5 leveling 4 gameplay | Fighter 9 initial 2 leveling 7 gameplay | ||||
| Wisdom | 18 initial 1 leveling 7 gameplay | Mage 18 initial 0 leveling 8 gameplay |
| Shops | Location |
| Aalek's Oddities | The Marketplace, Lower Ward |
| Anze's Anvil | The Marketplace, Lower Ward |
| Bones of the Night | A Wrecked House, Lower Ward |
| Brokah and Miccah's Pawnshop | The Pawn Shop, Lower Ward |
| Cinder's Magic Shoppe | The Marketplace, Lower Ward |
| Crumplepunch the Blacksmith | Outer Curst |
| Dustmen Vault | Gathering Dust Bar, northeast Hive |
| Dver's Concoctions | southwest Hive |
| Gaerien's Dead Looter Booty | Dead Nations |
| Giltspur's Auction Block | Lower Ward |
| Giscorl | southwest Hive |
| Gonclaves' Tailory | The Tailor, Clerk's Ward |
| Kester the Distiller | Inner Curst |
| Marta the Seamstress | Marta the Seamstress' House, Buried Village |
| Old Mebbeth | The midwife's hut, Ragpicker's Square |
| Pestle and Kilnn's Apothecary | The Apothecary, Clerk's Ward |
| Quint the Corpse-Peddler | Quint's Shop, Buried Village |
| Vrischika's Curiosity Shoppe | The Curiosity Shoppe, Clerk's Ward |
| Tainted Barse | Traitor's Gate Tavern, Outer Curst |
| Tylero's Steel | southwest Hive |
| Respawning Enemies | Drops | Notes |
|
|
|
| Hive Thug |
|
|
| Lesser Vargouille |
| |
| Stackable Unlimited Items | Dropped By Respawning Enemies | Infinite Shop Stock |
| Adder's Tear |
| |
| Bandages |
| |
| Blood Charm |
| |
| Blood Fly Charm |
| |
| Bone Charm |
| |
| Charcoal Charm |
| |
| Charm of Infinite Recall |
| |
| Clot Charm |
|
|
| Cockroach Charm |
| |
| Copper Commons |
| |
| Corpse Fly Charm |
| |
| Cranium Rat Charm |
| |
| Dirty Rat Charm |
|
|
| Heart Charm |
| |
| Jagged Bolts | Crumplepunch the Blacksmith | |
| Jar of Embalming Fluid |
| |
| Knot Charm |
| |
| Needle and Thread |
| |
| Rags |
| |
| Sadistic Frame | Aalek's Oddities (1 max) | |
| Scroll of Armor | Cinder's Magic Shoppe (1 max) | |
| Scroll of Ball Lightning | Cinder's Magic Shoppe (1 max) | |
| Scroll of Blindness | Cinder's Magic Shoppe (1 max) | |
| Scroll of Blur | Cinder's Magic Shoppe (1 max) | |
| Scroll of Chromatic Orb | Cinder's Magic Shoppe (1 max) | |
| Scroll of Cone of Cold | Cinder's Magic Shoppe (1 max) | |
| Scroll of Confusion | Cinder's Magic Shoppe (1 max) | |
| Scroll of Cure Critical Wounds |
| |
| Scroll of Cure Light Wounds |
| |
| Scroll of Cure Moderate Wounds |
| |
| Scroll of Cure Serious Wounds |
| |
| Scroll of Cloak of Warding | Cinder's Magic Shoppe (1 max) | |
| Scroll of Elysium's Tears | Cinder's Magic Shoppe (1 max) | |
| Scroll of Force Missiles | Cinder's Magic Shoppe (1 max) | |
| Scroll of Greater Embalming | Dustmen Vault | |
| Scroll of Heal |
| |
| Scroll of Hold Undead |
| |
| Scroll of Ice Knife | Cinder's Magic Shoppe (1 max) | |
| Scroll of Identify | Dustmen Vault | |
| Scroll of Improved Strength | Cinder's Magic Shoppe (1 max) | |
| Scroll of Knock | Cinder's Magic Shoppe (1 max) | |
| Scroll of Magic Missiles | Cinder's Magic Shoppe (1 max) | |
| Scroll of Minor Embalming | Dustmen Vault | |
| Scroll of Remove Curse |
| |
| Scroll of Shroud of Shadows |
| |
| Scroll of Speak With Dead |
| |
| Scroll of Strength | Cinder's Magic Shoppe (1 max) | |
| Scroll of Tasha's Unbearable Derisive Laughter | Cinder's Magic Shoppe (1 max) | |
| Scroll of Vampiric Touch |
| |
| Shamanic Rod | Aalek's Oddities (1 max) | |
| Thrice-Blind Charm |
| |
| Unstackable Unlimited Items | Dropped By Respawning Enemies | Infinite Shop Stock |
| Angle-Less Eye | Vrischika's Curiosity Shoppe | |
| Antler Axe |
| |
| Battle Axe |
| |
| Battle Axe of Quality | Anze's Anvil (2 max) | |
| Bone Dagger |
| |
| Bronze Bracelet |
| |
| Bronze Ring |
| |
| Cheese |
| |
| Copper Earring |
|
|
| Divine Censor |
| |
| Dustman Earring | Dustmen Vault | |
| Dustman Embalming Charm, Greater | Dustmen Vault (2 max) | |
| Dustman Embalming Charm, Lesser | Dustmen Vault (3 max) | |
| Fist Irons |
| |
| Glass Eye | Marta the Seamstress | |
| Gold Bracelet |
| |
| Gold Earring |
| |
| Gold Ring |
| |
| Green Steel Dagger |
| |
| Green Steel Knife |
| |
| Hammer |
| |
| Hammer of Quality | Anze's Anvil (2 max) | |
| High Quality Sledgehammer |
| |
| High Quality Stiletto |
| |
| Iron Knuckles | Tylero's Steel | |
| Iron Spike |
| |
| Jagged Knife |
| |
| Knife |
| |
| Lens of Inherent Viciousness | Vrischika's Curiosity Shoppe (1 max) | |
| Magic Punch Daggers | Anze's Anvil (1 max) | |
| Magnifying Lens | Vrischika's Curiosity Shoppe (1 max) | |
| Maul |
| |
| Poor Quality Mace | Tylero's Steel | |
| Poor Quality Sledgehammer |
| |
| Poor Quality Stiletto | Tylero's Steel | |
| Rusty Dagger |
| Tylero's Steel |
| Scalpel | Dustmen Vault | |
| Silver Bracelet |
| |
| Silver Earring |
| |
| Silver Ring |
| |
| Sledgehammer | Anze's Anvil | |
| Spider Bracelet | Vrischika's Curiosity Shoppe (1 max) | |
| Stiletto | Tylero's Steel | |
| Tarnished Silver Bracelet |
| |
| Teeth of the Fire Drake | Vrischika's Curiosity Shoppe (1 max) | |
| Tome of Bone and Ash | Dustmen Vault | |
| Whispering Flask |
| |
| Wooden Club |
|
| Options - In Game | Value |
| Toggle AI | OFF |
| Options - Gameplay | Value |
| Always Run | YES |
| Enable Cloud Saves | YES |
| Frame Rate | 30 |
| Heal on Rest | YES |
| Show Enemy Health Status | YES |
| Options - Gameplay - Auto-Pause | Value |
| Center on Party Member | YES |
| Character Attacked | YES |
| Character Dead | YES |
| Character Hit | YES |
| Character Injured | YES |
| End of Round | NO |
| Enemy Sighted | YES |
| Spell Cast | YES |
| Target Gone | YES |
| Trap Found | YES |
| Weapon Unusable | YES |


Dear sir/ma, Greetings to you in the name of our Lord. Please permit us to use this medium to thank you once more for given us this avenue to explain our problem to you. But firstly, We will like to tell you who we are so that you will understand and comprehend our point clearly. Our name is Selina&Gabriel Marinze and We are here in Benin Republic but We are from GHANA in West Africa but we are here in Benin Republic We entered as a result of the Death of our Parent in our country. And here in Benin We entered as a refugee . But We are still a student . Am Selina is 24years and gabriel is 22 years , am studying medicine before the out break of the death our parent. Please we need your assistance because our living here is not ok after our father and mother has leaving us alone in this world. But before the death of our father who is a GOLD MERCHANT S.A in Ghana, he has used our name to deposit some fund of $35.5 MILLION UNITED STATE DOLLARS in a finance house and he used our name as the beneficiary of the fund but we are not in access to the fund because,Our father as stated with the finance House that upon our present an investors to manage the fund for us they should release the fund for us. Please what we need from you is to assist us in transfer the fund to your personal account for investment purpose and immediately we hear from you we will summit your particulars to the finance house to effect the transfer to your name as the new beneficiary and the investors to invest the funds for us, so you can now instruct the bank for further transfer of the fund to your account over there so that we can now come over there for the continuation of our education while you help us to manage the fund. And Moreover we agreed to give you 30% of the total funds for your kindly assistance and the remain 70% for invest into any reliable business over there you suggest that is profitable. please if you are ready to assist us, Kindly forward the following so that we can forward it to the bank for open of account with them for you so that they can transfer the fund through telegraphic wire transfer to your nominated account in your country. We NEED YOUR FULL NAME, YOUR ADDRESS AND TELEPHONE NUMBER AND FAX. THIS WILL ENABLE US TO PROCEED FOR THE OPEN OF ACCOUNT IN YOUR FAVOUR AS THE NEW BENEFICARY OF THE FUND.


Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s.
Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s.
Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s.
Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s.
Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s.
Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s.
Lorem Ipsum é simplesmente uma simulação de texto da indústria
Leia mais...Lorem Ipsum é simplesmente uma simulação de texto da indústria
Leia mais...Lorem Ipsum é simplesmente uma simulação de texto da indústria
Leia mais...Lorem Ipsum é simplesmente uma simulação de texto da indústria
Leia mais...


@(pageskinsWithoutEditions: Seq[dfp.PageSkinSponsorship], geotargetedAdFeatures: Seq[dfp.Sponsorship], sponsorshipsWithoutSponsors: Seq[dfp.Sponsorship]) @if(pageskinsWithoutEditions.isEmpty && geotargetedAdFeatures.isEmpty && sponsorshipsWithoutSponsors.isEmpty) {
No known targeting problems.
} else {There are some targeting problems:
@if(pageskinsWithoutEditions.nonEmpty) {These pageskins have no edition set:
See https://frontend.gutools.co.uk/analytics/commercial/pageskins
These ad feature logos are geotargeted:
See https://frontend.gutools.co.uk/analytics/commercial/sponsorships
These paid-for logos have no sponsor set up:
See https://frontend.gutools.co.uk/analytics/commercial/sponsorships


Pat's World Famous Seattle Salmon Cookies
Salmon Cookie Sales
New Store Name:
Min Customers:
Max Customers:
Daily Average Cookies sold:
Create Store


Logout
Add Student
Approve Applications
Add Event
Event Details
Title
Date of Event
Capacity
Event Budget
Location


Inject SQL
You can inject SQL into a string literal (&shortcut:ShowIntentionActions; | Inject language or reference | <SQL dialect>) and then use coding assistance for SQL.


cudd package abstract (Internal)
Internal data structures of the CUDD package.
-
Cudd_AddHook()
- Adds a function to a hook.
-
Cudd_ApaAdd()
- Adds two arbitrary precision integers.
-
Cudd_ApaCompareRatios()
- Compares the ratios of two arbitrary precision integers to two unsigned ints.
-
Cudd_ApaCompare()
- Compares two arbitrary precision integers.
-
Cudd_ApaCopy()
- Makes a copy of an arbitrary precision integer.
-
Cudd_ApaCountMinterm()
- Counts the number of minterms of a DD.
-
Cudd_ApaIntDivision()
- Divides an arbitrary precision integer by an integer.
-
Cudd_ApaNumberOfDigits()
- Finds the number of digits for an arbitrary precision integer.
-
Cudd_ApaPowerOfTwo()
- Sets an arbitrary precision integer to a power of two.
-
Cudd_ApaPrintDecimal()
- Prints an arbitrary precision integer in decimal format.
-
Cudd_ApaPrintDensity()
- Prints the density of a BDD or ADD using arbitrary precision arithmetic.
-
Cudd_ApaPrintExponential()
- Prints an arbitrary precision integer in exponential format.
-
Cudd_ApaPrintHex()
- Prints an arbitrary precision integer in hexadecimal format.
-
Cudd_ApaPrintMintermExp()
- Prints the number of minterms of a BDD or ADD in exponential format using arbitrary precision arithmetic.
-
Cudd_ApaPrintMinterm()
- Prints the number of minterms of a BDD or ADD using arbitrary precision arithmetic.
-
Cudd_ApaSetToLiteral()
- Sets an arbitrary precision integer to a one-digit literal.
-
Cudd_ApaShiftRight()
- Shifts right an arbitrary precision integer by one binary place.
-
Cudd_ApaShortDivision()
- Divides an arbitrary precision integer by a digit.
-
Cudd_ApaSubtract()
- Subtracts two arbitrary precision integers.
-
Cudd_AutodynDisableZdd()
- Disables automatic dynamic reordering of ZDDs.
-
Cudd_AutodynDisable()
- Disables automatic dynamic reordering.
-
Cudd_AutodynEnableZdd()
- Enables automatic dynamic reordering of ZDDs.
-
Cudd_AutodynEnable()
- Enables automatic dynamic reordering of BDDs and ADDs.
-
Cudd_AverageDistance()
- Computes the average distance between adjacent nodes.
-
Cudd_BddToAdd()
- Converts a BDD to a 0-1 ADD.
-
Cudd_BddToCubeArray()
- Builds a positional array from the BDD of a cube.
-
Cudd_BiasedOverApprox()
- Extracts a dense superset from a BDD with the biased underapproximation method.
-
Cudd_BiasedUnderApprox()
- Extracts a dense subset from a BDD with the biased underapproximation method.
-
Cudd_CProjection()
- Computes the compatible projection of R w.r.t. cube Y.
-
Cudd_CheckKeys()
- Checks for several conditions that should not occur.
-
Cudd_CheckZeroRef()
- Checks the unique table for nodes with non-zero reference counts.
-
Cudd_ClassifySupport()
- Classifies the variables in the support of two DDs.
-
Cudd_ClearErrorCode()
- Clear the error code of a manager.
-
Cudd_CofMinterm()
- Computes the fraction of minterms in the on-set of all the positive cofactors of a BDD or ADD.
-
Cudd_Cofactor()
- Computes the cofactor of f with respect to g.
-
Cudd_Complement()
- Returns the complemented version of a pointer.
-
Cudd_CountLeaves()
- Counts the number of leaves in a DD.
-
Cudd_CountMinterm()
- Counts the number of minterms of a DD.
-
Cudd_CountPathsToNonZero()
- Counts the number of paths to a non-zero terminal of a DD.
-
Cudd_CountPath()
- Counts the number of paths of a DD.
-
Cudd_CubeArrayToBdd()
- Builds the BDD of a cube from a positional array.
-
Cudd_DagSize()
- Counts the number of nodes in a DD.
-
Cudd_DeadAreCounted()
- Tells whether dead nodes are counted towards triggering reordering.
-
Cudd_DebugCheck()
- Checks for inconsistencies in the DD heap.
-
Cudd_Decreasing()
- Determines whether a BDD is negative unate in a variable.
-
Cudd_DelayedDerefBdd()
- Decreases the reference count of BDD node n.
-
Cudd_Density()
- Computes the density of a BDD or ADD.
-
Cudd_Deref()
- Decreases the reference count of node.
-
Cudd_DisableGarbageCollection()
- Disables garbage collection.
-
Cudd_DisableReorderingReporting()
- Disables reporting of reordering stats.
-
Cudd_DumpBlifBody()
- Writes a blif body representing the argument BDDs.
-
Cudd_DumpBlif()
- Writes a blif file representing the argument BDDs.
-
Cudd_DumpDDcal()
- Writes a DDcal file representing the argument BDDs.
-
Cudd_DumpDaVinci()
- Writes a daVinci file representing the argument BDDs.
-
Cudd_DumpDot()
- Writes a dot file representing the argument DDs.
-
Cudd_DumpFactoredForm()
- Writes factored forms representing the argument BDDs.
-
Cudd_Dxygtdxz()
- Generates a BDD for the function d(x,y) > d(x,z).
-
Cudd_Dxygtdyz()
- Generates a BDD for the function d(x,y) > d(y,z).
-
Cudd_EnableGarbageCollection()
- Enables garbage collection.
-
Cudd_EnableReorderingReporting()
- Enables reporting of reordering stats.
-
Cudd_EpdCountMinterm()
- Counts the number of minterms of a DD with extended precision.
-
Cudd_EqualSupNorm()
- Compares two ADDs for equality within tolerance.
-
Cudd_EquivDC()
- Tells whether F and G are identical wherever D is 0.
-
Cudd_EstimateCofactorSimple()
- Estimates the number of nodes in a cofactor of a DD.
-
Cudd_EstimateCofactor()
- Estimates the number of nodes in a cofactor of a DD.
-
Cudd_Eval()
- Returns the value of a DD for a given variable assignment.
-
Cudd_ExpectedUsedSlots()
- Computes the expected fraction of used slots in the unique table.
-
Cudd_E()
- Returns the else child of an internal node.
-
Cudd_FindEssential()
- Finds the essential variables of a DD.
-
Cudd_FindTwoLiteralClauses()
- Finds the two literal clauses of a DD.
-
Cudd_FirstCube()
- Finds the first cube of a decision diagram.
-
Cudd_FirstNode()
- Finds the first node of a decision diagram.
-
Cudd_FirstPrime()
- Finds the first prime of a Boolean function.
-
Cudd_ForeachCube()
- Iterates over the cubes of a decision diagram.
-
Cudd_ForeachNode()
- Iterates over the nodes of a decision diagram.
-
Cudd_ForeachPrime()
- Iterates over the primes of a Boolean function.
-
Cudd_FreeTree()
- Frees the variable group tree of the manager.
-
Cudd_FreeZddTree()
- Frees the variable group tree of the manager.
-
Cudd_GarbageCollectionEnabled()
- Tells whether garbage collection is enabled.
-
Cudd_GenFree()
- Frees a CUDD generator.
-
Cudd_Increasing()
- Determines whether a BDD is positive unate in a variable.
-
Cudd_IndicesToCube()
- Builds a cube of BDD variables from an array of indices.
-
Cudd_Init()
- Creates a new DD manager.
-
Cudd_IsComplement()
- Returns 1 if a pointer is complemented.
-
Cudd_IsConstant()
- Returns 1 if the node is a constant node.
-
Cudd_IsGenEmpty()
- Queries the status of a generator.
-
Cudd_IsInHook()
- Checks whether a function is in a hook.
-
Cudd_IsNonConstant()
- Returns 1 if a DD node is not constant.
-
Cudd_IterDerefBdd()
- Decreases the reference count of BDD node n.
-
Cudd_LargestCube()
- Finds a largest cube in a DD.
-
Cudd_MakeBddFromZddCover()
- Converts a ZDD cover to a BDD graph.
-
Cudd_MakeTreeNode()
- Creates a new variable group.
-
Cudd_MakeZddTreeNode()
- Creates a new ZDD variable group.
-
Cudd_MinHammingDist()
- Returns the minimum Hamming distance between f and minterm.
-
Cudd_NewApaNumber()
- Allocates memory for an arbitrary precision integer.
-
Cudd_NextCube()
- Generates the next cube of a decision diagram onset.
-
Cudd_NextNode()
- Finds the next node of a decision diagram.
-
Cudd_NextPrime()
- Generates the next prime of a Boolean function.
-
Cudd_NodeReadIndex()
- Returns the index of the node.
-
Cudd_NotCond()
- Complements a DD if a condition is true.
-
Cudd_Not()
- Complements a DD.
-
Cudd_OutOfMem()
- Warns that a memory allocation failed.
-
Cudd_OverApprox()
- Extracts a dense superset from a BDD with Shiple's underapproximation method.
-
Cudd_Prime()
- Returns the next prime >= p.
-
Cudd_PrintDebug()
- Prints to the standard output a DD and its statistics.
-
Cudd_PrintInfo()
- Prints out statistics and settings for a CUDD manager.
-
Cudd_PrintLinear()
- Prints the linear transform matrix.
-
Cudd_PrintMinterm()
- Prints a disjoint sum of products.
-
Cudd_PrintTwoLiteralClauses()
- Prints the two literal clauses of a DD.
-
Cudd_PrintVersion()
- Prints the package version number.
-
Cudd_PrioritySelect()
- Selects pairs from R using a priority function.
-
Cudd_Quit()
- Deletes resources associated with a DD manager.
-
Cudd_Random()
- Portable random number generator.
-
Cudd_ReadArcviolation()
- Returns the current value of the arcviolation parameter used in group sifting.
-
Cudd_ReadBackground()
- Reads the background constant of the manager.
-
Cudd_ReadCacheHits()
- Returns the number of cache hits.
-
Cudd_ReadCacheLookUps()
- Returns the number of cache look-ups.
-
Cudd_ReadCacheSlots()
- Reads the number of slots in the cache.
-
Cudd_ReadCacheUsedSlots()
- Reads the fraction of used slots in the cache.
-
Cudd_ReadDead()
- Returns the number of dead nodes in the unique table.
-
Cudd_ReadEpsilon()
- Reads the epsilon parameter of the manager.
-
Cudd_ReadErrorCode()
- Returns the code of the last error.
-
Cudd_ReadGarbageCollectionTime()
- Returns the time spent in garbage collection.
-
Cudd_ReadGarbageCollections()
- Returns the number of times garbage collection has occurred.
-
Cudd_ReadGroupcheck()
- Reads the groupcheck parameter of the manager.
-
Cudd_ReadIndex()
- Returns the current position in the order of variable index.
-
Cudd_ReadInvPermZdd()
- Returns the index of the ZDD variable currently in the i-th position of the order.
-
Cudd_ReadInvPerm()
- Returns the index of the variable currently in the i-th position of the order.
-
Cudd_ReadIthClause()
- Accesses the i-th clause of a DD.
-
Cudd_ReadKeys()
- Returns the number of nodes in the unique table.
-
Cudd_ReadLinear()
- Reads an entry of the linear transform matrix.
-
Cudd_ReadLogicZero()
- Returns the logic zero constant of the manager.
-
Cudd_ReadLooseUpTo()
- Reads the looseUpTo parameter of the manager.
-
Cudd_ReadMaxCacheHard()
- Reads the maxCacheHard parameter of the manager.
-
Cudd_ReadMaxCache()
- Returns the soft limit for the cache size.
-
Cudd_ReadMaxGrowthAlternate()
- Reads the maxGrowthAlt parameter of the manager.
-
Cudd_ReadMaxGrowth()
- Reads the maxGrowth parameter of the manager.
-
Cudd_ReadMaxLive()
- Reads the maximum allowed number of live nodes.
-
Cudd_ReadMaxMemory()
- Reads the maximum allowed memory.
-
Cudd_ReadMemoryInUse()
- Returns the memory in use by the manager measured in bytes.
-
Cudd_ReadMinDead()
- Reads the minDead parameter of the manager.
-
Cudd_ReadMinHit()
- Reads the hit rate that causes resizinig of the computed table.
-
Cudd_ReadMinusInfinity()
- Reads the minus-infinity constant from the manager.
-
Cudd_ReadNextReordering()
- Returns the threshold for the next dynamic reordering.
-
Cudd_ReadNodeCount()
- Reports the number of nodes in BDDs and ADDs.
-
Cudd_ReadNodesDropped()
- Returns the number of nodes dropped.
-
Cudd_ReadNodesFreed()
- Returns the number of nodes freed.
-
Cudd_ReadNumberXovers()
- Reads the current number of crossovers used by the genetic algorithm for reordering.
-
Cudd_ReadOne()
- Returns the one constant of the manager.
-
Cudd_ReadPeakLiveNodeCount()
- Reports the peak number of live nodes.
-
Cudd_ReadPeakNodeCount()
- Reports the peak number of nodes.
-
Cudd_ReadPermZdd()
- Returns the current position of the i-th ZDD variable in the order.
-
Cudd_ReadPerm()
- Returns the current position of the i-th variable in the order.
-
Cudd_ReadPlusInfinity()
- Reads the plus-infinity constant from the manager.
-
Cudd_ReadPopulationSize()
- Reads the current size of the population used by the genetic algorithm for reordering.
-
Cudd_ReadRecomb()
- Returns the current value of the recombination parameter used in group sifting.
-
Cudd_ReadRecursiveCalls()
- Returns the number of recursive calls.
-
Cudd_ReadReorderingCycle()
- Reads the reordCycle parameter of the manager.
-
Cudd_ReadReorderingTime()
- Returns the time spent in reordering.
-
Cudd_ReadReorderings()
- Returns the number of times reordering has occurred.
-
Cudd_ReadSiftMaxSwap()
- Reads the siftMaxSwap parameter of the manager.
-
Cudd_ReadSiftMaxVar()
- Reads the siftMaxVar parameter of the manager.
-
Cudd_ReadSize()
- Returns the number of BDD variables in existance.
-
Cudd_ReadSlots()
- Returns the total number of slots of the unique table.
-
Cudd_ReadStderr()
- Reads the stderr of a manager.
-
Cudd_ReadStdout()
- Reads the stdout of a manager.
-
Cudd_ReadSwapSteps()
- Reads the number of elementary reordering steps.
-
Cudd_ReadSymmviolation()
- Returns the current value of the symmviolation parameter used in group sifting.
-
Cudd_ReadTree()
- Returns the variable group tree of the manager.
-
Cudd_ReadUniqueLinks()
- Returns the number of links followed in the unique table.
-
Cudd_ReadUniqueLookUps()
- Returns the number of look-ups in the unique table.
-
Cudd_ReadUsedSlots()
- Reads the fraction of used slots in the unique table.
-
Cudd_ReadVars()
- Returns the i-th element of the vars array.
-
Cudd_ReadZddOne()
- Returns the ZDD for the constant 1 function.
-
Cudd_ReadZddSize()
- Returns the number of ZDD variables in existance.
-
Cudd_ReadZddTree()
- Returns the variable group tree of the manager.
-
Cudd_ReadZero()
- Returns the zero constant of the manager.
-
Cudd_RecursiveDerefZdd()
- Decreases the reference count of ZDD node n.
-
Cudd_RecursiveDeref()
- Decreases the reference count of node n.
-
Cudd_ReduceHeap()
- Main dynamic reordering routine.
-
Cudd_Ref()
- Increases the reference count of a node, if it is not saturated.
-
Cudd_Regular()
- Returns the regular version of a pointer.
-
Cudd_RemapOverApprox()
- Extracts a dense superset from a BDD with the remapping underapproximation method.
-
Cudd_RemapUnderApprox()
- Extracts a dense subset from a BDD with the remapping underapproximation method.
-
Cudd_RemoveHook()
- Removes a function from a hook.
-
Cudd_ReorderingReporting()
- Returns 1 if reporting of reordering stats is enabled.
-
Cudd_ReorderingStatusZdd()
- Reports the status of automatic dynamic reordering of ZDDs.
-
Cudd_ReorderingStatus()
- Reports the status of automatic dynamic reordering of BDDs and ADDs.
-
Cudd_SetArcviolation()
- Sets the value of the arcviolation parameter used in group sifting.
-
Cudd_SetBackground()
- Sets the background constant of the manager.
-
Cudd_SetEpsilon()
- Sets the epsilon parameter of the manager to ep.
-
Cudd_SetGroupcheck()
- Sets the parameter groupcheck of the manager to gc.
-
Cudd_SetLooseUpTo()
- Sets the looseUpTo parameter of the manager.
-
Cudd_SetMaxCacheHard()
- Sets the maxCacheHard parameter of the manager.
-
Cudd_SetMaxGrowthAlternate()
- Sets the maxGrowthAlt parameter of the manager.
-
Cudd_SetMaxGrowth()
- Sets the maxGrowth parameter of the manager.
-
Cudd_SetMaxLive()
- Sets the maximum allowed number of live nodes.
-
Cudd_SetMaxMemory()
- Sets the maximum allowed memory.
-
Cudd_SetMinHit()
- Sets the hit rate that causes resizinig of the computed table.
-
Cudd_SetNextReordering()
- Sets the threshold for the next dynamic reordering.
-
Cudd_SetNumberXovers()
- Sets the number of crossovers used by the genetic algorithm for reordering.
-
Cudd_SetPopulationSize()
- Sets the size of the population used by the genetic algorithm for reordering.
-
Cudd_SetRecomb()
- Sets the value of the recombination parameter used in group sifting.
-
Cudd_SetReorderingCycle()
- Sets the reordCycle parameter of the manager.
-
Cudd_SetSiftMaxSwap()
- Sets the siftMaxSwap parameter of the manager.
-
Cudd_SetSiftMaxVar()
- Sets the siftMaxVar parameter of the manager.
-
Cudd_SetStderr()
- Sets the stderr of a manager.
-
Cudd_SetStdout()
- Sets the stdout of a manager.
-
Cudd_SetSymmviolation()
- Sets the value of the symmviolation parameter used in group sifting.
-
Cudd_SetTree()
- Sets the variable group tree of the manager.
-
Cudd_SetVarMap()
- Registers a variable mapping with the manager.
-
Cudd_SetZddTree()
- Sets the ZDD variable group tree of the manager.
-
Cudd_SharingSize()
- Counts the number of nodes in an array of DDs.
-
Cudd_ShortestLength()
- Find the length of the shortest path(s) in a DD.
-
Cudd_ShortestPath()
- Finds a shortest path in a DD.
-
Cudd_ShuffleHeap()
- Reorders variables according to given permutation.
-
Cudd_SolveEqn()
- Implements the solution of F(x,y) = 0.
-
Cudd_SplitSet()
- Returns m minterms from a BDD.
-
Cudd_Srandom()
- Initializer for the portable random number generator.
-
Cudd_StdPostReordHook()
- Sample hook function to call after reordering.
-
Cudd_StdPreReordHook()
- Sample hook function to call before reordering.
-
Cudd_SubsetCompress()
- Find a dense subset of BDD
f
.
-
Cudd_SubsetHeavyBranch()
- Extracts a dense subset from a BDD with the heavy branch heuristic.
-
Cudd_SubsetShortPaths()
- Extracts a dense subset from a BDD with the shortest paths heuristic.
-
Cudd_SubsetWithMaskVars()
- Extracts a subset from a BDD.
-
Cudd_SupersetCompress()
- Find a dense superset of BDD
f
.
-
Cudd_SupersetHeavyBranch()
- Extracts a dense superset from a BDD with the heavy branch heuristic.
-
Cudd_SupersetShortPaths()
- Extracts a dense superset from a BDD with the shortest paths heuristic.
-
Cudd_SupportIndex()
- Finds the variables on which a DD depends.
-
Cudd_SupportSize()
- Counts the variables on which a DD depends.
-
Cudd_Support()
- Finds the variables on which a DD depends.
-
Cudd_SymmProfile()
- Prints statistics on symmetric variables.
-
Cudd_TurnOffCountDead()
- Causes the dead nodes not to be counted towards triggering reordering.
-
Cudd_TurnOnCountDead()
- Causes the dead nodes to be counted towards triggering reordering.
-
Cudd_T()
- Returns the then child of an internal node.
-
Cudd_UnderApprox()
- Extracts a dense subset from a BDD with Shiple's underapproximation method.
-
Cudd_VectorSupportIndex()
- Finds the variables on which a set of DDs depends.
-
Cudd_VectorSupportSize()
- Counts the variables on which a set of DDs depends.
-
Cudd_VectorSupport()
- Finds the variables on which a set of DDs depends.
-
Cudd_VerifySol()
- Checks the solution of F(x,y) = 0.
-
Cudd_V()
- Returns the value of a constant node.
-
Cudd_Xeqy()
- Generates a BDD for the function x==y.
-
Cudd_Xgty()
- Generates a BDD for the function x > y.
-
Cudd_addAgreement()
- f if f==g; background if f!=g.
-
Cudd_addApply()
- Applies op to the corresponding discriminants of f and g.
-
Cudd_addBddInterval()
- Converts an ADD to a BDD.
-
Cudd_addBddIthBit()
- Converts an ADD to a BDD by extracting the i-th bit from the leaves.
-
Cudd_addBddPattern()
- Converts an ADD to a BDD.
-
Cudd_addBddStrictThreshold()
- Converts an ADD to a BDD.
-
Cudd_addBddThreshold()
- Converts an ADD to a BDD.
-
Cudd_addCmpl()
- Computes the complement of an ADD a la C language.
-
Cudd_addCompose()
- Substitutes g for x_v in the ADD for f.
-
Cudd_addComputeCube()
- Computes the cube of an array of ADD variables.
-
Cudd_addConstrain()
- Computes f constrain c for ADDs.
-
Cudd_addConst()
- Returns the ADD for constant c.
-
Cudd_addDiff()
- Returns plusinfinity if f=g; returns min(f,g) if f!=g.
-
Cudd_addDivide()
- Integer and floating point division.
-
Cudd_addEvalConst()
- Checks whether ADD g is constant whenever ADD f is 1.
-
Cudd_addExistAbstract()
- Existentially Abstracts all the variables in cube from f.
-
Cudd_addFindMax()
- Finds the maximum discriminant of f.
-
Cudd_addFindMin()
- Finds the minimum discriminant of f.
-
Cudd_addGeneralVectorCompose()
- Composes an ADD with a vector of ADDs.
-
Cudd_addHamming()
- Computes the Hamming distance ADD.
-
Cudd_addHarwell()
- Reads in a matrix in the format of the Harwell-Boeing benchmark suite.
-
Cudd_addIteConstant()
- Implements ITEconstant for ADDs.
-
Cudd_addIte()
- Implements ITE(f,g,h).
-
Cudd_addIthBit()
- Extracts the i-th bit from an ADD.
-
Cudd_addIthVar()
- Returns the ADD variable with index i.
-
Cudd_addLeq()
- Determines whether f is less than or equal to g.
-
Cudd_addLog()
- Natural logarithm of an ADD.
-
Cudd_addMatrixMultiply()
- Calculates the product of two matrices represented as ADDs.
-
Cudd_addMaximum()
- Integer and floating point max.
-
Cudd_addMinimum()
- Integer and floating point min.
-
Cudd_addMinus()
- Integer and floating point subtraction.
-
Cudd_addMonadicApply()
- Applies op to the discriminants of f.
-
Cudd_addNand()
- NAND of two 0-1 ADDs.
-
Cudd_addNegate()
- Computes the additive inverse of an ADD.
-
Cudd_addNewVarAtLevel()
- Returns a new ADD variable at a specified level.
-
Cudd_addNewVar()
- Returns a new ADD variable.
-
Cudd_addNonSimCompose()
- Composes an ADD with a vector of 0-1 ADDs.
-
Cudd_addNor()
- NOR of two 0-1 ADDs.
-
Cudd_addOneZeroMaximum()
- Returns 1 if f > g and 0 otherwise.
-
Cudd_addOrAbstract()
- Disjunctively abstracts all the variables in cube from the 0-1 ADD f.
-
Cudd_addOr()
- Disjunction of two 0-1 ADDs.
-
Cudd_addOuterSum()
- Takes the minimum of a matrix and the outer sum of two vectors.
-
Cudd_addPermute()
- Permutes the variables of an ADD.
-
Cudd_addPlus()
- Integer and floating point addition.
-
Cudd_addRead()
- Reads in a sparse matrix.
-
Cudd_addResidue()
- Builds an ADD for the residue modulo m of an n-bit number.
-
Cudd_addRestrict()
- ADD restrict according to Coudert and Madre's algorithm (ICCAD90).
-
Cudd_addRoundOff()
- Rounds off the discriminants of an ADD.
-
Cudd_addScalarInverse()
- Computes the scalar inverse of an ADD.
-
Cudd_addSetNZ()
- This operator sets f to the value of g wherever g != 0.
-
Cudd_addSwapVariables()
- Swaps two sets of variables of the same size (x and y) in the ADD f.
-
Cudd_addThreshold()
- f if f>=g; 0 if f<g.
-
Cudd_addTimesPlus()
- Calculates the product of two matrices represented as ADDs.
-
Cudd_addTimes()
- Integer and floating point multiplication.
-
Cudd_addTriangle()
- Performs the triangulation step for the shortest path computation.
-
Cudd_addUnivAbstract()
- Universally Abstracts all the variables in cube from f.
-
Cudd_addVectorCompose()
- Composes an ADD with a vector of 0-1 ADDs.
-
Cudd_addWalsh()
- Generates a Walsh matrix in ADD form.
-
Cudd_addXeqy()
- Generates an ADD for the function x==y.
-
Cudd_addXnor()
- XNOR of two 0-1 ADDs.
-
Cudd_addXor()
- XOR of two 0-1 ADDs.
-
Cudd_bddAdjPermuteX()
- Rearranges a set of variables in the BDD B.
-
Cudd_bddAndAbstractLimit()
- Takes the AND of two BDDs and simultaneously abstracts the variables in cube. Returns NULL if too many nodes are required.
-
Cudd_bddAndAbstract()
- Takes the AND of two BDDs and simultaneously abstracts the variables in cube.
-
Cudd_bddAndLimit()
- Computes the conjunction of two BDDs f and g. Returns NULL if too many nodes are required.
-
Cudd_bddAnd()
- Computes the conjunction of two BDDs f and g.
-
Cudd_bddApproxConjDecomp()
- Performs two-way conjunctive decomposition of a BDD.
-
Cudd_bddApproxDisjDecomp()
- Performs two-way disjunctive decomposition of a BDD.
-
Cudd_bddBindVar()
- Prevents sifting of a variable.
-
Cudd_bddBooleanDiff()
- Computes the boolean difference of f with respect to x.
-
Cudd_bddCharToVect()
- Computes a vector whose image equals a non-zero function.
-
Cudd_bddClippingAndAbstract()
- Approximates the conjunction of two BDDs f and g and simultaneously abstracts the variables in cube.
-
Cudd_bddClippingAnd()
- Approximates the conjunction of two BDDs f and g.
-
Cudd_bddClosestCube()
- Finds a cube of f at minimum Hamming distance from g.
-
Cudd_bddCompose()
- Substitutes g for x_v in the BDD for f.
-
Cudd_bddComputeCube()
- Computes the cube of an array of BDD variables.
-
Cudd_bddConstrainDecomp()
- BDD conjunctive decomposition as in McMillan's CAV96 paper.
-
Cudd_bddConstrain()
- Computes f constrain c.
-
Cudd_bddCorrelationWeights()
- Computes the correlation of f and g for given input probabilities.
-
Cudd_bddCorrelation()
- Computes the correlation of f and g.
-
Cudd_bddExistAbstract()
- Existentially abstracts all the variables in cube from f.
-
Cudd_bddGenConjDecomp()
- Performs two-way conjunctive decomposition of a BDD.
-
Cudd_bddGenDisjDecomp()
- Performs two-way disjunctive decomposition of a BDD.
-
Cudd_bddIntersect()
- Returns a function included in the intersection of f and g.
-
Cudd_bddIsNsVar()
- Checks whether a variable is next state.
-
Cudd_bddIsPiVar()
- Checks whether a variable is primary input.
-
Cudd_bddIsPsVar()
- Checks whether a variable is present state.
-
Cudd_bddIsVarEssential()
- Determines whether a given variable is essential with a given phase in a BDD.
-
Cudd_bddIsVarHardGroup()
- Checks whether a variable is set to be in a hard group.
-
Cudd_bddIsVarToBeGrouped()
- Checks whether a variable is set to be grouped.
-
Cudd_bddIsVarToBeUngrouped()
- Checks whether a variable is set to be ungrouped.
-
Cudd_bddIsop()
- Computes a BDD in the interval between L and U with a simple sum-of-produuct cover.
-
Cudd_bddIteConstant()
- Implements ITEconstant(f,g,h).
-
Cudd_bddIterConjDecomp()
- Performs two-way conjunctive decomposition of a BDD.
-
Cudd_bddIterDisjDecomp()
- Performs two-way disjunctive decomposition of a BDD.
-
Cudd_bddIte()
- Implements ITE(f,g,h).
-
Cudd_bddIthVar()
- Returns the BDD variable with index i.
-
Cudd_bddLICompaction()
- Performs safe minimization of a BDD.
-
Cudd_bddLeqUnless()
- Tells whether f is less than of equal to G unless D is 1.
-
Cudd_bddLeq()
- Determines whether f is less than or equal to g.
-
Cudd_bddLiteralSetIntersection()
- Computes the intesection of two sets of literals represented as BDDs.
-
Cudd_bddMakePrime()
- Expands cube to a prime implicant of f.
-
Cudd_bddMinimize()
- Finds a small BDD that agrees with
f
over c
.
-
Cudd_bddNPAnd()
- Computes f non-polluting-and g.
-
Cudd_bddNand()
- Computes the NAND of two BDDs f and g.
-
Cudd_bddNewVarAtLevel()
- Returns a new BDD variable at a specified level.
-
Cudd_bddNewVar()
- Returns a new BDD variable.
-
Cudd_bddNor()
- Computes the NOR of two BDDs f and g.
-
Cudd_bddOr()
- Computes the disjunction of two BDDs f and g.
-
Cudd_bddPermute()
- Permutes the variables of a BDD.
-
Cudd_bddPickArbitraryMinterms()
- Picks k on-set minterms evenly distributed from given DD.
-
Cudd_bddPickOneCube()
- Picks one on-set cube randomly from the given DD.
-
Cudd_bddPickOneMinterm()
- Picks one on-set minterm randomly from the given DD.
-
Cudd_bddPrintCover()
- Prints a sum of prime implicants of a BDD.
-
Cudd_bddReadPairIndex()
- Reads a corresponding pair index for a given index.
-
Cudd_bddRead()
- Reads in a graph (without labels) given as a list of arcs.
-
Cudd_bddRealignDisable()
- Disables realignment of ZDD order to BDD order.
-
Cudd_bddRealignEnable()
- Enables realignment of BDD order to ZDD order.
-
Cudd_bddRealignmentEnabled()
- Tells whether the realignment of BDD order to ZDD order is enabled.
-
Cudd_bddResetVarToBeGrouped()
- Resets a variable not to be grouped.
-
Cudd_bddRestrict()
- BDD restrict according to Coudert and Madre's algorithm (ICCAD90).
-
Cudd_bddSetNsVar()
- Sets a variable type to next state.
-
Cudd_bddSetPairIndex()
- Sets a corresponding pair index for a given index.
-
Cudd_bddSetPiVar()
- Sets a variable type to primary input.
-
Cudd_bddSetPsVar()
- Sets a variable type to present state.
-
Cudd_bddSetVarHardGroup()
- Sets a variable to be a hard group.
-
Cudd_bddSetVarToBeGrouped()
- Sets a variable to be grouped.
-
Cudd_bddSetVarToBeUngrouped()
- Sets a variable to be ungrouped.
-
Cudd_bddSqueeze()
- Finds a small BDD in a function interval.
-
Cudd_bddSwapVariables()
- Swaps two sets of variables of the same size (x and y) in the BDD f.
-
Cudd_bddTransfer()
- Convert a BDD from a manager to another one.
-
Cudd_bddUnbindVar()
- Allows the sifting of a variable.
-
Cudd_bddUnivAbstract()
- Universally abstracts all the variables in cube from f.
-
Cudd_bddVarConjDecomp()
- Performs two-way conjunctive decomposition of a BDD.
-
Cudd_bddVarDisjDecomp()
- Performs two-way disjunctive decomposition of a BDD.
-
Cudd_bddVarIsBound()
- Tells whether a variable can be sifted.
-
Cudd_bddVarIsDependent()
- Checks whether a variable is dependent on others in a function.
-
Cudd_bddVarMap()
- Remaps the variables of a BDD using the default variable map.
-
Cudd_bddVectorCompose()
- Composes a BDD with a vector of BDDs.
-
Cudd_bddXnor()
- Computes the exclusive NOR of two BDDs f and g.
-
Cudd_bddXorExistAbstract()
- Takes the exclusive OR of two BDDs and simultaneously abstracts the variables in cube.
-
Cudd_bddXor()
- Computes the exclusive OR of two BDDs f and g.
-
Cudd_tlcInfoFree()
- Frees a DdTlcInfo Structure.
-
Cudd_zddChange()
- Substitutes a variable with its complement in a ZDD.
-
Cudd_zddComplement()
- Computes a complement cover for a ZDD node.
-
Cudd_zddCountDouble()
- Counts the number of minterms of a ZDD.
-
Cudd_zddCountMinterm()
- Counts the number of minterms of a ZDD.
-
Cudd_zddCount()
- Counts the number of minterms in a ZDD.
-
Cudd_zddCoverPathToString()
- Converts a path of a ZDD representing a cover to a string.
-
Cudd_zddDagSize()
- Counts the number of nodes in a ZDD.
-
Cudd_zddDiffConst()
- Performs the inclusion test for ZDDs (P implies Q).
-
Cudd_zddDiff()
- Computes the difference of two ZDDs.
-
Cudd_zddDivideF()
- Modified version of Cudd_zddDivide.
-
Cudd_zddDivide()
- Computes the quotient of two unate covers.
-
Cudd_zddDumpDot()
- Writes a dot file representing the argument ZDDs.
-
Cudd_zddFirstPath()
- Finds the first path of a ZDD.
-
Cudd_zddForeachPath()
- Iterates over the paths of a ZDD.
-
Cudd_zddIntersect()
- Computes the intersection of two ZDDs.
-
Cudd_zddIsop()
- Computes an ISOP in ZDD form from BDDs.
-
Cudd_zddIte()
- Computes the ITE of three ZDDs.
-
Cudd_zddIthVar()
- Returns the ZDD variable with index i.
-
Cudd_zddNextPath()
- Generates the next path of a ZDD.
-
Cudd_zddPortFromBdd()
- Converts a BDD into a ZDD.
-
Cudd_zddPortToBdd()
- Converts a ZDD into a BDD.
-
Cudd_zddPrintCover()
- Prints a sum of products from a ZDD representing a cover.
-
Cudd_zddPrintDebug()
- Prints to the standard output a ZDD and its statistics.
-
Cudd_zddPrintMinterm()
- Prints a disjoint sum of product form for a ZDD.
-
Cudd_zddPrintSubtable()
- Prints the ZDD table.
-
Cudd_zddProduct()
- Computes the product of two covers represented by ZDDs.
-
Cudd_zddReadNodeCount()
- Reports the number of nodes in ZDDs.
-
Cudd_zddRealignDisable()
- Disables realignment of ZDD order to BDD order.
-
Cudd_zddRealignEnable()
- Enables realignment of ZDD order to BDD order.
-
Cudd_zddRealignmentEnabled()
- Tells whether the realignment of ZDD order to BDD order is enabled.
-
Cudd_zddReduceHeap()
- Main dynamic reordering routine for ZDDs.
-
Cudd_zddShuffleHeap()
- Reorders ZDD variables according to given permutation.
-
Cudd_zddSubset0()
- Computes the negative cofactor of a ZDD w.r.t. a variable.
-
Cudd_zddSubset1()
- Computes the positive cofactor of a ZDD w.r.t. a variable.
-
Cudd_zddSymmProfile()
- Prints statistics on symmetric ZDD variables.
-
Cudd_zddUnateProduct()
- Computes the product of two unate covers.
-
Cudd_zddUnion()
- Computes the union of two ZDDs.
-
Cudd_zddVarsFromBddVars()
- Creates one or more ZDD variables for each BDD variable.
-
Cudd_zddWeakDivF()
- Modified version of Cudd_zddWeakDiv.
-
Cudd_zddWeakDiv()
- Applies weak division to two covers.
-
DD_LSDIGIT()
- Extract the least significant digit of a double digit.
-
DD_MINUS_INFINITY()
- Returns the minus infinity constant node.
-
DD_MSDIGIT()
- Extract the most significant digit of a double digit.
-
DD_ONE()
- Returns the constant 1 node.
-
DD_PLUS_INFINITY()
- Returns the plus infinity constant node.
-
DD_ZERO()
- Returns the arithmetic 0 constant node.
-
cuddAddApplyRecur()
- Performs the recursive step of Cudd_addApply.
-
cuddAddBddDoPattern()
- Performs the recursive step for Cudd_addBddPattern.
-
cuddAddCmplRecur()
- Performs the recursive step of Cudd_addCmpl.
-
cuddAddComposeRecur()
- Performs the recursive step of Cudd_addCompose.
-
cuddAddConstrainRecur()
- Performs the recursive step of Cudd_addConstrain.
-
cuddAddExistAbstractRecur()
- Performs the recursive step of Cudd_addExistAbstract.
-
cuddAddIteRecur()
- Implements the recursive step of Cudd_addIte(f,g,h).
-
cuddAddMonadicApplyRecur()
- Performs the recursive step of Cudd_addMonadicApply.
-
cuddAddNegateRecur()
- Implements the recursive step of Cudd_addNegate.
-
cuddAddOrAbstractRecur()
- Performs the recursive step of Cudd_addOrAbstract.
-
cuddAddRestrictRecur()
- Performs the recursive step of Cudd_addRestrict.
-
cuddAddRoundOffRecur()
- Implements the recursive step of Cudd_addRoundOff.
-
cuddAddScalarInverseRecur()
- Performs the recursive step of addScalarInverse.
-
cuddAddUnivAbstractRecur()
- Performs the recursive step of Cudd_addUnivAbstract.
-
cuddAdjust()
- Enforces DD_MINUS_INF_VAL <= x <= DD_PLUS_INF_VAL.
-
cuddAllocNode()
- Fast storage allocation for DdNodes in the table.
-
cuddAnnealing()
- Get new variable-order by simulated annealing algorithm.
-
cuddBddAlignToZdd()
- Reorders BDD variables according to the order of the ZDD variables.
-
cuddBddAndAbstractRecur()
- Takes the AND of two BDDs and simultaneously abstracts the variables in cube.
-
cuddBddAndRecur()
- Implements the recursive step of Cudd_bddAnd.
-
cuddBddBooleanDiffRecur()
- Performs the recursive steps of Cudd_bddBoleanDiff.
-
cuddBddClippingAndAbstract()
- Approximates the conjunction of two BDDs f and g and simultaneously abstracts the variables in cube.
-
cuddBddClippingAnd()
- Approximates the conjunction of two BDDs f and g.
-
cuddBddClosestCube()
- Performs the recursive step of Cudd_bddClosestCube.
-
cuddBddComposeRecur()
- Performs the recursive step of Cudd_bddCompose.
-
cuddBddConstrainRecur()
- Performs the recursive step of Cudd_bddConstrain.
-
cuddBddExistAbstractRecur()
- Performs the recursive steps of Cudd_bddExistAbstract.
-
cuddBddIntersectRecur()
- Implements the recursive step of Cudd_bddIntersect.
-
cuddBddIsop()
- Performs the recursive step of Cudd_bddIsop.
-
cuddBddIteRecur()
- Implements the recursive step of Cudd_bddIte.
-
cuddBddLICompaction()
- Performs safe minimization of a BDD.
-
cuddBddLiteralSetIntersectionRecur()
- Performs the recursive step of Cudd_bddLiteralSetIntersection.
-
cuddBddMakePrime()
- Performs the recursive step of Cudd_bddMakePrime.
-
cuddBddNPAndRecur()
- Implements the recursive step of Cudd_bddAnd.
-
cuddBddRestrictRecur()
- Performs the recursive step of Cudd_bddRestrict.
-
cuddBddTransfer()
- Convert a BDD from a manager to another one.
-
cuddBddXorExistAbstractRecur()
- Takes the exclusive OR of two BDDs and simultaneously abstracts the variables in cube.
-
cuddBddXorRecur()
- Implements the recursive step of Cudd_bddXor.
-
cuddBiasedUnderApprox()
- Applies the biased remapping underappoximation algorithm.
-
cuddCProjectionRecur()
- Performs the recursive step of Cudd_CProjection.
-
cuddCacheFlush()
- Flushes the cache.
-
cuddCacheInsert1()
- Inserts a result in the cache for a function with two operands.
-
cuddCacheInsert2()
- Inserts a result in the cache for a function with two operands.
-
cuddCacheInsert()
- Inserts a result in the cache.
-
cuddCacheLookup1Zdd()
- Looks up in the cache for the result of op applied to f.
-
cuddCacheLookup1()
- Looks up in the cache for the result of op applied to f.
-
cuddCacheLookup2Zdd()
- Looks up in the cache for the result of op applied to f and g.
-
cuddCacheLookup2()
- Looks up in the cache for the result of op applied to f and g.
-
cuddCacheLookupZdd()
- Looks up in the cache for the result of op applied to f, g, and h.
-
cuddCacheLookup()
- Looks up in the cache for the result of op applied to f, g, and h.
-
cuddCacheProfile()
- Computes and prints a profile of the cache usage.
-
cuddCacheResize()
- Resizes the cache.
-
cuddCheckCube()
- Checks whether g is the BDD of a cube.
-
cuddClean()
- Clears the 4 least significant bits of a pointer.
-
cuddClearDeathRow()
- Clears the death row.
-
cuddCofactorRecur()
- Performs the recursive step of Cudd_Cofactor.
-
cuddCollectNodes()
- Recursively collects all the nodes of a DD in a symbol table.
-
cuddComputeFloorLog2()
- Returns the floor of the logarithm to the base 2.
-
cuddConstantLookup()
- Looks up in the cache for the result of op applied to f, g, and h.
-
cuddDeallocMove()
- Adds node to the head of the free list.
-
cuddDeallocNode()
- Adds node to the head of the free list.
-
cuddDeref()
- Decreases the reference count of a node, if it is not saturated.
-
cuddDestroySubtables()
- Destroys the n most recently created subtables in a unique table.
-
cuddDynamicAllocNode()
- Dynamically allocates a Node.
-
cuddExact()
- Exact variable ordering algorithm.
-
cuddE()
- Returns the else child of an internal node.
-
cuddFreeTable()
- Frees the resources associated to a unique table.
-
cuddGarbageCollect()
- Performs garbage collection on the unique tables.
-
cuddGa()
- Genetic algorithm for DD reordering.
-
cuddGetBranches()
- Computes the children of g.
-
cuddHashTableInit()
- Initializes a hash table.
-
cuddHashTableInsert1()
- Inserts an item in a hash table.
-
cuddHashTableInsert2()
- Inserts an item in a hash table.
-
cuddHashTableInsert3()
- Inserts an item in a hash table.
-
cuddHashTableInsert()
- Inserts an item in a hash table.
-
cuddHashTableLookup1()
- Looks up a key consisting of one pointer in a hash table.
-
cuddHashTableLookup2()
- Looks up a key consisting of two pointers in a hash table.
-
cuddHashTableLookup3()
- Looks up a key consisting of three pointers in a hash table.
-
cuddHashTableLookup()
- Looks up a key in a hash table.
-
cuddHashTableQuit()
- Shuts down a hash table.
-
cuddHeapProfile()
- Prints information about the heap.
-
cuddIZ()
- Finds the current position of ZDD variable index in the order.
-
cuddInitCache()
- Initializes the computed table.
-
cuddInitInteract()
- Initializes the interaction matrix.
-
cuddInitLinear()
- Initializes the linear transform matrix.
-
cuddInitTable()
- Creates and initializes the unique table.
-
cuddInsertSubtables()
- Inserts n new subtables in a unique table at level.
-
cuddIsConstant()
- Returns 1 if the node is a constant node.
-
cuddIsInDeathRow()
- Checks whether a node is in the death row.
-
cuddI()
- Finds the current position of variable index in the order.
-
cuddLevelQueueDequeue()
- Remove an item from the front of a level queue.
-
cuddLevelQueueEnqueue()
- Inserts a new key in a level queue.
-
cuddLevelQueueInit()
- Initializes a level queue.
-
cuddLevelQueueQuit()
- Shuts down a level queue.
-
cuddLinearAndSifting()
- BDD reduction based on combination of sifting and linear transformations.
-
cuddLinearInPlace()
- Linearly combines two adjacent variables.
-
cuddLocalCacheClearAll()
- Clears the local caches of a manager.
-
cuddLocalCacheClearDead()
- Clears the dead entries of the local caches of a manager.
-
cuddLocalCacheInit()
- Initializes a local computed table.
-
cuddLocalCacheInsert()
- Inserts a result in a local cache.
-
cuddLocalCacheLookup()
- Looks up in a local cache.
-
cuddLocalCacheProfile()
- Computes and prints a profile of a local cache usage.
-
cuddLocalCacheQuit()
- Shuts down a local computed table.
-
cuddMakeBddFromZddCover()
- Converts a ZDD cover to a BDD graph.
-
cuddNextHigh()
- Finds the next subtable with a larger index.
-
cuddNextLow()
- Finds the next subtable with a smaller index.
-
cuddNodeArray()
- Recursively collects all the nodes of a DD in an array.
-
cuddPrintNode()
- Prints out information on a node.
-
cuddPrintVarGroups()
- Prints the variable groups as a parenthesized list.
-
cuddP()
- Prints a DD to the standard output. One line per node is printed.
-
cuddReclaimZdd()
- Brings children of a dead ZDD node back.
-
cuddReclaim()
- Brings children of a dead node back.
-
cuddRef()
- Increases the reference count of a node, if it is not saturated.
-
cuddRehash()
- Rehashes a unique subtable.
-
cuddRemapUnderApprox()
- Applies the remapping underappoximation algorithm.
-
cuddResizeLinear()
- Resizes the linear transform matrix.
-
cuddResizeTableZdd()
- Increases the number of ZDD subtables in a unique table so that it meets or exceeds index.
-
cuddSatDec()
- Saturating decrement operator.
-
cuddSatInc()
- Saturating increment operator.
-
cuddSetInteract()
- Set interaction matrix entries.
-
cuddShrinkDeathRow()
- Shrinks the death row.
-
cuddShrinkSubtable()
- Shrinks a subtable.
-
cuddSifting()
- Implementation of Rudell's sifting algorithm.
-
cuddSlowTableGrowth()
- Adjusts parameters of a table to slow down its growth.
-
cuddSolveEqnRecur()
- Implements the recursive step of Cudd_SolveEqn.
-
cuddSplitSetRecur()
- Implements the recursive step of Cudd_SplitSet.
-
cuddStCountfree()
- Frees the memory used to store the minterm counts recorded in the visited table.
-
cuddSubsetHeavyBranch()
- The main procedure that returns a subset by choosing the heavier branch in the BDD.
-
cuddSubsetShortPaths()
- The outermost procedure to return a subset of the given BDD with the shortest path lengths.
-
cuddSwapInPlace()
- Swaps two adjacent variables.
-
cuddSwapping()
- Reorders variables by a sequence of (non-adjacent) swaps.
-
cuddSymmCheck()
- Checks for symmetry of x and y.
-
cuddSymmSiftingConv()
- Symmetric sifting to convergence algorithm.
-
cuddSymmSifting()
- Symmetric sifting algorithm.
-
cuddTestInteract()
- Test interaction matrix entries.
-
cuddTimesInDeathRow()
- Counts how many times a node is in the death row.
-
cuddTreeSifting()
- Tree sifting algorithm.
-
cuddT()
- Returns the then child of an internal node.
-
cuddUnderApprox()
- Applies Tom Shiple's underappoximation algorithm.
-
cuddUniqueConst()
- Checks the unique table for the existence of a constant node.
-
cuddUniqueInterIVO()
- Wrapper for cuddUniqueInter that is independent of variable ordering.
-
cuddUniqueInterZdd()
- Checks the unique table for the existence of an internal ZDD node.
-
cuddUniqueInter()
- Checks the unique table for the existence of an internal node.
-
cuddUpdateInteractionMatrix()
- Updates the interaction matrix.
-
cuddVerifySol()
- Implements the recursive step of Cudd_VerifySol.
-
cuddV()
- Returns the value of a constant node.
-
cuddWindowReorder()
- Reorders by applying the method of the sliding window.
-
cuddZddAlignToBdd()
- Reorders ZDD variables according to the order of the BDD variables.
-
cuddZddChangeAux()
- Performs the recursive step of Cudd_zddChange.
-
cuddZddChange()
- Substitutes a variable with its complement in a ZDD.
-
cuddZddComplement()
- Computes a complement of a ZDD node.
-
cuddZddDiff()
- Performs the recursive step of Cudd_zddDiff.
-
cuddZddDivideF()
- Performs the recursive step of Cudd_zddDivideF.
-
cuddZddDivide()
- Performs the recursive step of Cudd_zddDivide.
-
cuddZddFreeUniv()
- Frees the ZDD universe.
-
cuddZddGetCofactors2()
- Computes the two-way decomposition of f w.r.t. v.
-
cuddZddGetCofactors3()
- Computes the three-way decomposition of f w.r.t. v.
-
cuddZddGetNegVarIndex()
- Returns the index of negative ZDD variable.
-
cuddZddGetNegVarLevel()
- Returns the level of negative ZDD variable.
-
cuddZddGetNodeIVO()
- Wrapper for cuddUniqueInterZdd that is independent of variable ordering.
-
cuddZddGetNode()
- Wrapper for cuddUniqueInterZdd.
-
cuddZddGetPosVarIndex()
- Returns the index of positive ZDD variable.
-
cuddZddGetPosVarLevel()
- Returns the level of positive ZDD variable.
-
cuddZddInitUniv()
- Initializes the ZDD universe.
-
cuddZddIntersect()
- Performs the recursive step of Cudd_zddIntersect.
-
cuddZddIsop()
- Performs the recursive step of Cudd_zddIsop.
-
cuddZddIte()
- Performs the recursive step of Cudd_zddIte.
-
cuddZddLinearSifting()
- Implementation of the linear sifting algorithm for ZDDs.
-
cuddZddNextHigh()
- Finds the next subtable with a larger index.
-
cuddZddNextLow()
- Finds the next subtable with a smaller index.
-
cuddZddProduct()
- Performs the recursive step of Cudd_zddProduct.
-
cuddZddP()
- Prints a ZDD to the standard output. One line per node is printed.
-
cuddZddSifting()
- Implementation of Rudell's sifting algorithm.
-
cuddZddSubset0()
- Computes the negative cofactor of a ZDD w.r.t. a variable.
-
cuddZddSubset1()
- Computes the positive cofactor of a ZDD w.r.t. a variable.
-
cuddZddSwapInPlace()
- Swaps two adjacent variables.
-
cuddZddSwapping()
- Reorders variables by a sequence of (non-adjacent) swaps.
-
cuddZddSymmCheck()
- Checks for symmetry of x and y.
-
cuddZddSymmSiftingConv()
- Symmetric sifting to convergence algorithm for ZDDs.
-
cuddZddSymmSifting()
- Symmetric sifting algorithm for ZDDs.
-
cuddZddTreeSifting()
- Tree sifting algorithm for ZDDs.
-
cuddZddUnateProduct()
- Performs the recursive step of Cudd_zddUnateProduct.
-
cuddZddUnion()
- Performs the recursive step of Cudd_zddUnion.
-
cuddZddUniqueCompare()
- Comparison function used by qsort.
-
cuddZddWeakDivF()
- Performs the recursive step of Cudd_zddWeakDivF.
-
cuddZddWeakDiv()
- Performs the recursive step of Cudd_zddWeakDiv.
-
ddAbs()
- Computes the absolute value of a number.
-
ddCHash2()
- Hash function for the cache for functions with two operands.
-
ddCHash()
- Hash function for the cache.
-
ddEqualVal()
- Returns 1 if the absolute value of the difference of the two arguments x and y is less than e.
-
ddHash()
- Hash function for the unique table.
-
ddLCHash2()
- Computes hash function for keys of two operands.
-
ddLCHash3()
- Computes hash function for keys of three operands.
-
ddMax()
- Computes the maximum of two numbers.
-
ddMin()
- Computes the minimum of two numbers.
-
lqHash()
- Hash function for the table of a level queue.
-
statLine()
- Outputs a line of stats.
Generated automatically by extdoc
on 20050517


This port is close to the western border of Brunei. It is the second largest town in Brunei and is situated at the mouth of the Belait River.
There is a bar off the entrace to the port with a dredged channel through it. This is well buoyed however is not frequently dredged. Cruisers reported the following depths in August 2010: A least depth of 0.7 metres over the bar at low water. A least depth of 2.1 metres over the bar at high water.
Position 04° 36.2’N, 114°10.3’E (port entrance)
Prior to entry, when off the breakwaters at Kuala Belait call Belait Port Control on Ch 15 and request entry. At the same time ask the Port Official about available depth over the bar.
If arriving out of hours you can anchor in the South West corner of the quarantine anchorage. Keep a sharp lookout for Oil Industry Support vessels returning to Port here as dusk approaches and the car ferry. Note that the flare that helps mark the entrance, and is mentioned in the pilot book, may not currently be lit.
Once anchored or moored you can take the dinghy to the Kuala Belait Boat Club and walk into town.
All the necessary offices are in the large multi-storey building on the waterfront (Marine Services Building). Go left on the ground floor for Port Clearance and you will be directed from there.
When checking in ask for your departure paperwork to fill out ahead of time. When checking out with Customs and Immigration you will need to return to the Marine Department and the Port Department to deliver copies of your clearance papers. Also, Customs will want a Cargo Manifest which can just say "nil".
The staff are friendly and helpful.
Last updated June 2012.
Entrance is narrow but straightforward as this is an oil support base, but be very aware of the number of support vessels returning late in the evening - they are unlikely to take any notice of a yacht!
The best anchorage is opposite the main marine services building and the small boat jetty in town, in about 5 M over mud. Anchoring is prohibited in certain areas – usually signed – because of submarine pipelines.
Beware of large floating islands
of vegetaion as well as logs being swept along by the tide.
If unable to enter this port, a possible alternative overnight anchorage could be just inside the private marina at Jerudong (approx. 04°57’.6 N, 114°48’.5 E). It is very sheltered and the holding is good in mud, but you could be asked to move on as it is private.
Last updated June 2012.
Facilities and meals are available at the Yacht Club and a fee may be required for use of the dinghy dock and facilities. Fuel and water can be also arranged here. The club welcomes visitors.


Introduction
Curriculum Vitae is the first image of the job seeker that impresses the employer. This session was initiated for the first time at an “Are You Ready” program on behalf of the undergraduates of the University to offer the proficiency of preparing the most important piece, the Curriculum Vitae before entrance to the corporate world. On the outset of the session a guest speaker will be giving the proper guidance on how to prepare the Curriculum Vitae and its significance. Then the past Rotaractors of the University who are fully engaged professionals in the industry will give individual attention for the undergraduates with their prepared CVs pointing out revisions.
Contents
- Guest speech on how to prepare a proper CV and its significance
- Interactive session that examine the undergraduates’ CVs by the past Rotarians and Rotaractors
Date
8th of October 2013Time
3:15 PMPlace
Civil AuditoriumSpeakers
- Civil Auditorium


We have published over three chapbooks from the small press that exists in our basement apartment, and we look forward to publishing your work. Take a gander at our previous publications:
O's stories are like when your mother would say something rueful and smile with only the corner of her mouth.


Bachman, Richard (aka Stephen King)
- o The Running Man
Bagdikian, Ben H.
- o The Media Monopoly (nonfiction)
Baird, Wilhelmina
- o Clipjoint
- o Crashcourse
Baker, Will
- o Shadow Hunter
Ballard, J. G.
- o Crash
- The violence of car crashes and the eroticism of mechanized death
become the obscene focus of a group of car crash survivors and their
lovers.
- o The Atrocity Exhibition
- Ballard studied medicine in college and it shows here. Through a
series of fragmented `compressed novels', Ballard traces the break-
down of a doctor at a mental hospital.
- o Vermilion Sands
- o The Wind from Nowhere
- o The Drowned World
- o Billenium
- o The Voices of Time and Other Stories
- o Terminal Beach
- o The Drought
- o The Drowned World
- o The Crystal World
- o The Impossible Man
- o The Overloaded Man
- o The Day of Forever
- o The Disaster Area
- o The Four-Dimensional Nightmare
Banks, Iain M.
- o The Player of Games
- a master gameplayer leaves his safe home in the Culture to play for the highest
stakes in the universe.
- o Consider Phlebas
- A reclusive shapeshifter caromes through the borders of the Culture-Idarolan war.
- o Use of Weapons
- Cheradnyn Zakalwe is an agent of Special Circumstances, an expert at subtly
controlling empires from the inside, and a man with a dark and terrible secret.
- o Against A Dark Background
- Lady Sharrow, last in the line of her house must find an ancient and unpredictable
weapon, the last Lazy Gun, or be exterminated by a grunge-bearing religious sect.
- o Feersum Endjinn
- The inhabitants of a world fallen from genius to idiocy struggle to save their world.
- o State of the Art
- (Short story collection)
Barnes, Steven
- o Gorgon Child
- o Streetlethal
- o Dream Park,
Barsoom Project, California Voodoo Game
- with Larry Niven
Bear, Greg
- o Beyond Heaven's River
- o Blood Music (1985)
- A genetic engineer first creates super-intelligent viruses and then
self-injects them when he is fired in an attempt to save his work.
The viruses spread across the world and produce a collision between
observer based information theory and reality.
- o Eon
- Earth, on the edge of nuclear war, becomes host to a modified aster-
oid from an alternate time-line. Among the items found within the
technically advanced micro-world is a history of the impending war.
Will this knowledge be used in time to advert disaster?
- o Eternity
- In order to keep the universe from unraveling, it is necessary to
destroy the gateway that was attached to the Thistledown. Sequel to
Eon.
- o Forge of God
- Earth's eminent destruction at the hands of a cowardly alien race
motivate the ships of The Law to attempt to save a small fraction of
humanity and its works.
- o Psychlone
- o Strength of Stones
- o The Wind from a Burning Woman (Anthology)
- The Wind from a Burning Woman, Scatter Shot, Mandela, Hard Fought.
- o Queen of Angels (1990)
Belsito, Peter
- o Notes from the Pop Underground (nonfiction) (editor)
- interviews with SRL, Robert Anton Wilson, etc.
Benedikt, Michael
- o Cyberspace: First Steps. (nonfiction)
Benford, Gregory
- o Great Sky River
Berlyn, Michael
- o The Integreated Man
Besher, Alexander
- o Rim
Bester, Alfred
- o Computer Connection
- A group of immortals, while creating another of their kind, unwit-
tingly also create a man-machine symbiosis that soon threatens the
existence of humankind.
- o Golem 100
- Eight women in a search for fun and excitement tap the unconscious
id of the megacity, producing a demon of startling power and mis-
chief.
- o The Demolished Man
- Future peaceful earth, where telepaths prevent crimes by learning
about them before they occur, is shocked by one man's desperate
irrationality.
- o The Stars My Destination
- Body modification, corporate intrigue, baroque settings and charac-
ters, and a walk down the gray line that separates criminals from
the straight world. But its the protagonist's purely anarchic
belief in humanity that makes this book remarkable. Originally
Tiger! Tiger!.
Betancourt, John Gregory
- o Johnny Zed
- o Rememory
Bethke, Bruce
- o Cyberpunk
- o Elimination Round
Bey, Hakim
- o Temporary Autonomous Zone
Bova, Ben
- o Exiled from Earth
- o Cyberbooks
- o The Dueling Machine
Brand, Stewart
- o The Media Lab (at MIT) (nonfiction)
Bradbury, Ray
- o Fahreheit 451
- Firemen are employed to burn thought provoking books that run con-
trary to the desires of those addicted to mass-media forms of enter-
tainment.
Brin, David
- o Earth
- Although the world is falling apart, Arks provide homes for endan-
gered species while ecologists fight a losing battle against the
growing population. Meanwhile global computer nets bring
information to everyone and allow the elderly majority to vote for
laws that will help them. The application of string theory allows
new energy sources based upon gravitons to create the hope for a
better tomorrow if the knowledge is used by the right people.
- o Postman
Brunner, John
- o Stand on Zanzibar (1968)
- Over population in 2010 produces new fads, gene based child rearing laws and the new poor: people who are paying for next-next season's clothing this season.
- o Children of Thunder
- o The Jagged Orbit
- Racial tensions are fueled by a personal armaments company inter-
ested in its profit margin in a world where personal contact is
typically avoided.
- o The Sheep Look Up
- The effects of poisons and contaminants upon the environment effects
an increase in the expression of recessive genetic mutations in both
humans and parasites (most other animals are dead) which eventually
causes even more problems in a overpopulated, abused, and now under-
resourced world.
- o The Shockwave Rider (1975)
- Society has reached instability and everything changes rapidly in a
world where everyone is on the move. A national datanet allows the
government to monitor its citizens without their permission, while
research produces methods to measure wisdom in children.
- o The Stone that Never Came Down
- Plagued by unemployment, a right-wing moral movement, inflation, and
world-wide famine, the world is on the brink of war. A new drug
which improves memory and cognition saves the day --- providing
solutions to those who have been administered the drug.
Budrys, Algis
- o Michaelmas
- An electronic genius disguised as a news-reporter controls the run-
ning of the world with the help of his artificially intelligent
computer.
Bull, Emma
- o Bone Dance
Burgess, Anthony
- o A Clockwork Orange
- Gangs of teenagers run rampant performing acts of ultra-violence in
the near future. Palovian reconditioning is used as a solution to
the overcrowding of penitentiaries, producing physical sickness in
those whose thoughts turn to violence.
Burroughs, William S.
- o The Soft Machine
- o Wild Boys
- o Interzone
- o Ticket That Exploded
- o The Third Mind
- o Cites of the Red Night (1981)
- o Naked Lunch
- A blast of maniacal laughter from Hell.
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Sander van Zoest
Send suggestions, comments, etc. to <cyberpunk@replicant.net>


h1. Bootstrap heading With faded secondary text
h2. Bootstrap heading With faded secondary text
h3. Bootstrap heading With faded secondary text
h4. Bootstrap heading With faded secondary text
h5. Bootstrap heading With faded secondary text
h6. Bootstrap heading With faded secondary text
h1. Bootstrap heading With faded secondary text
h2. Bootstrap heading With faded secondary text
h3. Bootstrap heading With faded secondary text
h4. Bootstrap heading With faded secondary text
h5. Bootstrap heading With faded secondary text
h6. Bootstrap heading With faded secondary text
Example heading New
Example heading New
Example heading New
Example heading New
Example heading New
Example heading New
h1. Bootstrap heading
h2. Bootstrap heading
h3. Bootstrap heading
h4. Bootstrap heading
h5. Bootstrap heading
h6. Bootstrap heading
Bacon ipsum dolor amet pork loin t-bone prosciutto ham pork chop
Bacon ipsum dolor amet pork loin t-bone prosciutto ham pork chop. Picanha rump spare ribs prosciutto meatloaf sausage.
Bacon ipsum dolor amet pork loin t-bone prosciutto ham pork chop. Tri-tip sirloin spare ribs rump short ribs chuck tail ground round bresaola t-bone leberkas cow.
- Examples
- Button tags
- Outline buttons
- Sizes
- Button plugin
- Toggle states
- Examples
- Button tags
- Outline buttons
- Examples
- Button tags
- Outline buttons
- Sizes
- Active state
- Disabled state
- Button plugin
- Toggle states
- Checkbox and radio buttons
Brownie pastry biscuit liquorice candy canes apple pie icing chupa chups. Bonbon bear claw sweet marshmallow ice cream powder icing.
Brownie pastry biscuit liquorice candy canes apple pie icing chupa chups. Bonbon bear claw sweet marshmallow ice cream powder icing
Brownie pastry biscuit liquorice candy canes apple pie icing chupa chups. Bonbon bear claw sweet marshmallow ice cream powder icing.
You can use the mark tag to highlight text.
This line of text is meant to be treated as deleted text.
This line of text is meant to be treated as no longer accurate.
This line of text is meant to be treated as an addition to the document.
This line of text will render as underlined
This line of text is meant to be treated as fine print.
This line rendered as bold text.
This line rendered as italicized text.
Brownie pastry biscuit liquorice candy canes apple pie icing chupa chups. Bonbon bear claw sweet,
marshmallow ice cream powder icing.
Or, code blocks. Use <pre>
for multiple lines of code. Once again, be sure to escape any angle brackets in the code for proper rendering. You may optionally add the .pre-scrollable
class, which will set a max-height of 350px and provide a y-axis scrollbar.
.example-element { margin-bottom: 1rem; }


Select Tickets
STEP 1 Please select the day you want to join Microverse One
| Ticket | 1-Day-Ticket | 2-Day-Ticket | MO Affiliate / Partners | |
|---|---|---|---|---|
| Date | 01, Jun | 02, Jun | 01-02, Jun | 01-02, Jun |
| Normal | ||||
| Students |
Select Your Lunch
STEP 2 Please select lunch for registered days.


NBA roundup: Doncic scores 41 in Dallas win over Houston
Luka Doncic scored 41 points, Tim Hardaway Jr. added a season-high 31 and the Dallas Mavericks never trailed in a 137-123 victory over the Houston Rockets on Sunday.
The Mavericks scored 45 points in the first quarter and were up 78-60 at halftime. Hardaway had 19 in the half, Doncic 17 and Kristaps Porzingis 15.
The Mavericks have won five straight, scoring at least 137 in the last three. Houston has lost three straight after winning eight in a row.
KINGS 113, WIZARDS 106: Harrison Barnes matched his season high with 26 points on 7-of-8 shooting and Bojan Bogdanovic had 21 points for Sacramento.
Buddy Hield added 18 points, including a late 3-pointer that put Sacramento's lead at multiple possessions for good, and Richaun Holmes had 16 points and 10 rebounds. The Kings won for the seventh time in 10 games to improve to 7-8.
NUGGETS 116, SUNS 104: Paul Millsap scored 23 points and Jamal Murray and Will Barton each had 22 to help Denver win its fifth straight.
Nikola Jokic had just eight points, but grabbed 13 rebounds. The Nuggets held Phoenix guard Devin Booker to a season-low 12 points on 5-of-13 shooting. Booker came in averaging 26.2 points in November.
Cheick Diallo led Phoenix with a career-high 22 points. Dario Saric had a career-high 17 rebounds to go with 18 points.
NETS 103, KNICKS 101: Spencer Dinwiddie scored 30 points in another strong start in place of the injured Kyrie Irving and Brooklyn beat New York for its season-high third straight victory.
Irving continues to rest an injured right shoulder, and Dinwiddie is making sure they get by without him, scoring 20 or more points in a career-best five straight games after stepping into the starting lineup.
He was 13 of 14 from the foul line, where the Nets had a whopping 27-9 advantage in makes.
Wire reports
Related Photos


We require all smuggled special devices to be registered before resale.
On registration, a unique ID will be presented for your safe keeping.
This tool will use your device model and UDID to verify origin. Non-smuggled special devices cannot be registered.


--- layout: post title: Le curé Meslier date: '2015-09-17T18:30:48+02:00' categories: - Illustration picture_url: https://film-Storyboards.tumblr.com/post/129312666933 ---


# Notes on Debuging If you can’t find the bug, you’re looking in the wrong place. Go back to where it last worked. Contain the bug. Look for the bug in a new place, time, or format. Be responsible for the code. Learn from the bug. ---- ## ?s ### What error message (if any) is there? ### What line number is causing the error? ### What is the actual output vs. the expected? ### What assumption(s) the developer has made? ## Techniques - Trace Backward: If there is a specific line number causing the error - Trace Forward: If you aren't sure which line is causing the error - Divide and Conquer: If there are multiple areas which may have caused the error ---- ### Trace backward, figure out which line of code is producing the error. Then, work backwards one line at a time until you find the source of the bad data. \ Use this technique when... - The error is thrown from a known location - You understand the program well enough to know what it's supposed to be doing ### Trace forward, start at the beginning of your program. Then, work forwards one line at a time and verify that your mental model matches the result, using a debugger or log statements. \ Use this technique when... - The problem line isn’t known - You can't narrow down the problem to one specific area of the code ### To divide and conquer: Identify different code sections that could have caused the error \ Use breakpoints or log statements at the boundaries to test which area is the problem \ Focus your efforts on that area using Trace Forward or Trace Backward \ Use this technique when... - There are multiple areas where the error could have come from ---- ## Example Sketch ```python3 #! Plan OF Attack ''' First, Skim the Functions main and contains_3_consecutive from above, what do you expect to be outputed? - expected output - - output would be: - Next, Run the code in the terminal with pyhron3 exercise-1.py to view the Actual Output - actual Looks Like we got a call to the Traceback, can you spot what the error message is? - Can you find what line(s) may be causing said error? - - - What can you deduce about the cause of the error? - What assumptions did the developer(s) make, State them here - State your Solutions/Assumptions here - To Fix this error Change ''' ```
Lorem ipsum...
ADS
ADS


The search for returned 0 result. Please try again with a name more complete.
The search returned {{ items.length }} results.


TIFF CHANGE INFORMATION
This document describes the changes made to the software between the
previous and current versions (see above).
If you don't find something listed here, then it was not done in this
timeframe, or it was not considered important enough to be mentioned.
The following information is located here:
CHANGES IN THE SOFTWARE CONFIGURATION:
- support was added for building the library as a DSO under OSF/1
CHANGES IN LIBTIFF:
- fixes to the Pixar codec
- portability mods for VMS
CHANGES IN THE TOOLS:
- fixes to gif2tiff and ppm2tiff for building under MS/DOS
- portability mods to fax2ps and ycbcr for VMS
CHANGES IN THE CONTRIBUTED SOFTWARE:
- a new package from Alexander Lehmann
for building the library and tools under MS/DOS with DJGPP v2
- updated VMS support from Karsten Spang
TIFF home page.
Sam Leffler /<EMAIL_ADDRESS>Last updated $Date: 2016-09-25 20:05:45 $.


W4
Menu
Docs
Examples
Blog
Logout
Movies
Movie Title
Movie Genre
Release Date
Run Time
More info...
X
Movie Title
Movie Genre
Release Date
Run Time
More info...
Shows ↕
Show Title
Show Genre
Release Date
Run Time
More info...
Show Title
Show Genre
Release Date
Run Time
More info...


DownloadableTask
extension DownloadableTask
-
Completes the task.
Declaration
Swift
func complete(withFileLocation location: URL?, url: URL?, error: Error?)
Parameters
location
File location.
url
File remote location.
error
Error.
-
Create a Filespec if needed.
Declaration
Swift
func createFilespecIfNeeded(from url: URL?, path: String?, name: String?, filename: String?, fileExtension: String?, size: Int64?)
Parameters
url
Remote file location.
path
Path where file is located.
name
Remove file name.
filename
Filename.
fileExtension
File extension.
size
File size.
-
The method used after successfully saving a file.
This method creates Filespec if needed and notify file data changes.
Declaration
Swift
func fileSaved(at location: URL, from url: URL?, filename: String, name: String?, fileExtension: String?, size: Int64?)
Parameters
location
File saved location.
url
File remote location.
filename
Filename.
name
File remote name.
fileExtension
File extension.
size
File size.
-
Removes previously a downloaded file.
Declaration
Swift
func removePreviouslyDownloaded(url: URL?)
Parameters
url
Remote file location.
-
Saves the data to the given location with filename and file extension.
If a file exists, a given data will be added to the end of the file.
Declaration
Swift
func save(data: Data, toLocation fileLocation: URL, withFilename filename: String, fileExtension: String?)
Parameters
data
Data.
fileLocation
A location where a file will be saved.
filename
Filename.
fileExtension
File extension.
-
This method updates progress and returns true if download complete.
Declaration
Swift
func updateProgress(withBytesWritten bytesWritten: Int64, totalBytesWritten: Int64, totalBytesExpectedToWrite: Int64) -> Bool
Parameters
bytesWritten
Bytes count that written.
totalBytesWritten
Total bytes count that written.
totalBytesExpectedToWrite
Total bytes expected to write.
-
Check status code for success, and return success status as a boolean.
If success was failed, completes with error
DownloadError.cannotLoadFromNetwork
Declaration
Swift
func isStatusSuccess(response: URLResponse?, url: URL?) -> Bool
Parameters
response
Network response.
url
Network url.
-
After finishing downloading, saves the file to a given location.
Declaration
Swift
func didFinishDownloading(from url: URL?, to location: URL, filenameAlias: DMSwiftTypealias.Storage.Filename?)
Parameters
url
A file remote location.
location
A location where a file will be saved.
filenameAlias
Filename, name and file extension.
-
Updates a file size.
Declaration
Swift
func didReceive(fileSize: Int64, at url: URL?, filenameAlias: DMSwiftTypealias.Storage.Filename?)
Parameters
fileSize
A file size.
url
A file remote location.
filenameAlias
Filename, name and file extension.
-
Should be used when new data was received.
This method saves the data, updates progress. If progress returns true, it notifies the successfully saved file and completes the task.
Declaration
Swift
func didReceive(data: Data, at url: URL?, filenameAlias: DMSwiftTypealias.Storage.Filename?)
Parameters
data
A new recevied data.
url
A file remote location.
filenameAlias
Filename, name and file extension.
-
If the task completed with an error, then completes the task with an error.
If
downloadType == .dataTask
, removes unfinished file from device storage.Declaration
Swift
func didCompleteWithError(error: Error?, at url: URL?, filenameAlias: DMSwiftTypealias.Storage.Filename?)
Parameters
error
Error.
url
File location.
filenameAlias
Filename, name and file extension.


Here are some demo web applications that display various web technologies supported by WebKit.
Offline Calendar
Added May 27th, 2009
Picking up where the sticky notes example leaves off, the Offline Calendar demo goes much more in depth into the power of the HTML 5 database API.
By storing the user's calendar events in a local databases and caching the application resources themselves using the HTML 5 application cache the calendar can be used with no network connection!
This demo shows off how straight forward it is to add transforms and implicit animations to a web application by adding a small amount of CSS.
Check out our blog posts about CSS animations and CSS transforms for more details and examples.
The editing toolbar shows off a rich HTML editing toolbar in WebKit. It uses JavaScript and CSS to fade in and out and to implement the buttons that apply text formating and alignment. Click in the text area to see the toolbar appear.
Sticky Notes
Added October 19th, 2007
Referenced in our blog post about adding HTML 5 structured database storage, this is a simple example of how the database API works in the form of persistent yellow sticky notes.
Storing simple data, it is a great way for developers to introduce themselves to how the database API works.


Whether you're new to computer security concepts or you're new to teaching, there's a place for you.
We've written teaching tips for beginners who want to share their digital security knowledge in single day sessions with friends and neighbors.
We encourage new digital security trainers to teach in pairs: plan your workshops with a friend.
“Do I need a VPN?” and “Which VPN should I use?” are questions that often come up during digital security workshops. Learners might hear of Virtual Private Networks, or VPNs, when they’re looking for ways to protect their Internet connection on public WiFi, such as at a coffee shop or in an airport. Others, like journalists, may want to use a VPN as a way of seeming like they are using a different network than the one that they are working from. Learners may also be interested in circumventing Internet censorship in their country. The question of how to know which VPN to use, however, is packed with additional considerations and nuances, and it may be difficult to address these in a clear way. This lesson plan helps learners think through what tools are right for them, and what factors they should consider in their search for a VPN.


Begin the Fugue, Part I
The past few months have been pretty exhausting. On top of all things lockdown and the global pandemic, a little over a month ago I was told that my job was “at risk” of redundancy. After going through the full collective consultation period, today is my last official day working as an employee of Flatiron School. While this has been a bit of a shock, I’ve been thinking about my time at Flatiron these past few weeks and as my first prelude comes to its final PAC and brace for the subsequent fugue1, I always find that writing about what is on my mind really helps me see the bigger picture.
Looking over everything I did mull over, it’s quite long so I’ve broken it up into three parts:
- What Did I Just Do?: A prosaic setting of my resume
- Vocationtional Vicissitudes: My thoughts on why vocationalism versus the liberal arts helps me understand higher education
- My Dream AD (Applicant’s Description): Things I Might Want to do Next with My Job
As always, thanks for caring about me and reading my blog posts.
What Did I Just Do?
For the past nine months I have been a Lead Instructor of Data Science at the London campus of the Flatiron School. During my time there, I’ve led four different cohorts of students through an intensive fifteen week program where students with not much experience in coding or statistics or machine learning immerse themselves in order to learn as much as they possibly can from their instructors, the written curricula, as well as their peers.
The bootcamp approach to learning is extremely different from that of traditional, liberal arts, higher-ed and while it can get a bad reputation for not being as exhaustive as spending four years doing something (duh), there are many things that bootcamps really excel at such as having so many learners concentrated into one space, all at about the same level of understanding, with near constant access to instructors to help guide a herd of overly eager learners.
At Flatiron School, I was mainly responsible for delivering material for the first two modules they took which were “Python for Data Science” and “Probability and Statistics” and was supported by a team of four wonderful people.
Many of us are now also on the job market now and if you are reading this and want to pick up the scraps of a fantastic team, go add these people on LinkedIn. All you have to do is click the links below. They’re all fantastic educators and even better data scientists.
I also lectured a bit on other topics that I personally like a lot such as clustering, principal components analysis, and was always the one to give my obligatory Introduction to R and the Tidyverse workshop. We taught mostly Python, so I wouldn’t have been able to sleep at night without introducing them to R.
As of today, we’ve graduated a sizeable batch of students and have placed many of them in jobs.2 We’re not at 100% yet like our Software Engineering program was able to do, but I get messages from students when they eventually get jobs and it’s always the best part of my day. Our students have gone on to work from companies ranging from start-ups, to educational programs like Flatiron School, to more high visibility brands like Nielsen and the Bank of England.
In addition to all things teaching, I also got my first taste of being part of senior management, so I got to be on the hiring side of things for once. I now understand what people mean when they say people will only look at your resume less than a minute. Being on the other side of the interviewing power-dynamic was surprisingly one of the most valuable experiences I will remember going forward. I’ve also felt how the volatility of a business’ performance directly affects one’s work since our parent company was WeWork. There were definitely ups and downs.
Near the end of my time, I also got to help out with a bit of the curriculum development (I got to write some of the R materials for our graduate’s continuing education) that you can check out on the newly minted Teaching section of my website.
It was a lot of work a lot of the time (especially at the start of the role and then again when we had to jump online) and it was 180 degrees in the direction of what I was doing before (writing my dissertation alone in my flat). And although it wasn’t what I thought I would be doing straight after my PhD, I learned a ton from the work and found many aspects of the job very enjoyable.
The Good
By far, the best part of the job was working with the bootcamp students. This group of students was by far the most engaged collective of learners I have ever worked with. To contextualise this, prior to teaching data science at Flatiron, the students from the two areas subjects in higher education I had experience with were both music theory and aural skills (a subset of music notorious for having undergraduates historically question the content area’s utility) as well as statistics for doctoral level psychologists (where a majority of the class was clinical psychologists who, for good reason, question both the quantification, reficication, and reductionism of quantitative methods).
In contrast to undergraduate music majors and clinical psychologists3, none of the students at Flatiron were in my classes because they were “required to for graduation” and instead most of them had quit their jobs hoping to change the entire trajectory of their career. You fork out a lot of cash to do programs like this and that’s not something they took lightly as students and thus it was not something we took lightly as instructors.
As a result of this large time and financial investment, the students would absolutely rinse myself and the other instructors for questions every day to the point that by 6:00PM I was totally exhausted from so much face-to-face work. This constant engaging with instructors and asking as many questions as possible is actually one of the big appeals of this kind of flavor of bootcamp; there are not many other educational settings where students have so much direct access to instructors and peers who are all on the same page.
While we did our best to set boundaries with students it was hard not to engage with people who were so eager to learn. The real trick that I eventually learned was to try to get the students to essentially bootstrap each other’s learning and move away from the sage-on-the-stage approach and move over towards as much group and active learning as possible. I learned a lot about giving up control in the classroom and what you get when you start to acknowledge the fact that when you have adult learners, they bring with them far more life experience than those fresh out of school.
As a result of all this rapid learning, the last major thing that I loved about this job was getting to see so many students grow so quickly during their time as a bootcamp student. Of course it’s true that you’re never going to learn everything in a bootcamp, but these environments are designed to get someone from near zero to competence so they can get in their own self-directed learning feedback loops where they can start critically thinking rather than adopting a pumping them full of knowledge approach.
Now teaching in a bootcamp setting was not like anything I had taught in before. The goal wasn’t to teach people the history of sciences or competing philosophies of science throughout the 20th century (though I did weave a lot of that in my lectures, not gonna lie); it was straight up about getting people the tools they need to get a job.
For this reason, I’ve now spent a lot of time thinking about the idea of vocationalism versus liberal arts education which I elaborate on in Part II.
In keeping with the metaphor I used when I wrote about joining Flatiron↩
I don’t want to go into the numbers I keep here since that probably counts as sensative information to post publicly, but the students are doing well. We’ll have to wait for our next third part audit for the official numbers.↩
Obviously there were some in each group that were really into each class, I don’t mean to portray this as apathy↩


{% extends "base.html" %} {% block title %}COR. ONE{% endblock %} {% block content %}
Facebook Twitter Instagram Dribbble
Tips and tricks to protect yourself
Learn more
Bored at home? Well here are some tips to keep the boredness at bay
Only for the elderly


By ESO/B. Bailleul - http://www.eso.org/public/images/eso1238a/, CC BY 4.0, Link
By Bbxxayay - Own work, CC BY-SA 4.0, Link
By NASA, ESA, M. Robberto (Space Telescope Science Institute/ESA) and the Hubble Space Telescope Orion Treasury Project Team - http://hubblesite.org/newscenter/newsdesk/archive/releases/2006/01/, Public Domain, Link
By NASA, ESA, C.R. Robert O’Dell (Vanderbilt University), G.J. Ferland (University of Kentucky), W.J. Henney and M. Peimbert (National Autonomous University of Mexico) Credit for Large Binocular Telescope data: David Thompson (University of Arizona) - HubbleSite Release Image: STScI-2013-13 - NASA's Hubble Space Telescope Reveals the Ring Nebula's True Shape, Public Domain, Link
By Ngc1535 - Own work, CC BY-SA 4.0, Link
By ESA/Hubble, CC BY 4.0, Link
By NASA/JPL-Caltech/UCLA - WISE, Public Domain, Link
By ESO/Digitized Sky Survey 2 - http://www.eso.org/public/images/eso1321a/, CC BY 4.0, Link
By NASA/JPL-Caltech/D. Barrado y NavascuÃ©s (LAEFF-INTA) - http://www.spitzer.caltech.edu/images/2131-sig07-006-Young-Stars-Emerge-from-Orion-s-Head, Public Domain, https://commons.wikimedia.org/w/index.php?curid=15513438
By NASA/JPL-Caltech - http://www.nasa.gov/mission_pages/WISE/multimedia/pia15635.html, Public Domain, Link
By NASA/JPL-Caltech/Univ. of Ariz. - NASA - Comets Kick up Dust in Helix Nebula, Public Domain, Link
By Image based on data obtained as part of the INT Photometric H-Alpha Survey of the Northern Galactic Plane, prepared by Nick Wright, University College London, on behalf of the IPHAS Collaboration - http://astro.ic.ac.uk/Research/Halpha/North/gallery.shtml - accessed 5/07,2007, Public Domain, Link
By NASA and the European Space Agency. - http://hubblesite.org/newscenter/archive/releases/2004/07/image/a/warn/, Public Domain, Link


Angular module for WOW.js: a customizable library to reveal animations when you scroll.
Scroll down to see it in action!
such easy
very JS
WOW
no jquery
many anims
aint joke
how small
3 kb only
just scroll
reveal now
so impress
WOW
no jquery?!
that sucks!


Destroyed Device:
You see a pile of broken pieces. As you walk forward for a closer look...
You suddenly hear an ear-splitting siren!
Look around.


Jake Quickenden quits Dancing On Ice Christmas show after breaking bone in neck
The Hollyoaks actor won the ITV show in 2018 and was due to return to the ice for the festive special
by James Rodger, https://www.facebook.com/jamesrodgerjournalistJake Quickenden has been forced to pull out of the Dancing On Ice Christmas show after breaking a bone in his neck.
The Hollyoaks actor won the ITV show in 2018 and was due to return to the ice for the festive special.
He said on Twitter that he was "gutted" to be missing the programme.
Quickenden told his 502,000 followers on the site: "Devastated I've had to pull out of @dancingonice Christmas show, I've broken a bone in my neck and I won't have time to heal and the medical team think it's too dangerous and to much of a rush to try and take part!!!
"Gutted."
A message of Dancing On Ice's Twitter account said: "Unfortunately due to an existing injury, and on medical grounds, @JakeQuickenden will no longer be able to participate in #DancingOnIce at Christmas.
"We wish you a speedy recovery Jake!"
Earlier this month Quickenden revealed that he had spent six hours in hospital after slipping and hitting his head when he jumped into a pool in Bali.
Sharing a picture of a cut on his head, he wrote: "It resulted in 25 stitches, a CT scan and X-rays on my neck, which luckily all came back OK, oh and a really nice bald patch."


Preparation time
30 mins to 1 hour
Cooking time
1 to 2 hours
Serves
Makes 32 biscotti
These flavour-packed biscotti make a classy end to an Italian meal, or any meal for that matter.
For the biscotti, preheat the oven to 180C/160C Fan/Gas 4. Tip the almonds onto a baking tray and roast them for a few minutes until fragrant.
Using a vegetable peeler, peel off 1cm/½in wide strips of zest from the oranges. Cut the strips into 5mm/¼in pieces. Place in a pan of water and bring to boil for a couple of minutes. Drain and repeat this blanching process 3 times.
Fill a pan with 150ml/5fl oz water and 300g/10½oz caster sugar and boil the strips of peel until soft. Drain the peel, reserving the liquid.
Put the orange-flavoured sugary water into a large pan and boil rapidly until caramelised. Carefully pour the mixture onto a non-stick baking tray and cool as quickly as possible, then transfer to the fridge. Once chilled, remove from the baking tray and break it into a blender. Blend until it becomes like fine sugar. Measure out 200g/7oz of this sugar and blend with 100g/3½oz of the flour.
In a large bowl, mix together the sugar/flour mixture, the remaining 250g/9oz of flour, baking powder and the reamining caster sugar. Add the eggs, rosemary, blanched almonds, dried cranberries and orange peel. Use your hands to mix into a fairly solid dough - some extra flour may be required.
Split the dough into 2 pieces. Use your hands to roll each piece to a sausage shape about 5cm/2in thick. Place each piece of dough on a lined baking tray and use the palm of your hand to flatten them slightly. Bake for 30 minutes. Remove from the oven, and allow to cool for a few minutes.
Turn down the oven to 160C/140C Fan/Gas 3. Chop the biscotti on the diagonal into slices about 1cm/½in thick. Separate the slices, place on lined baking trays and bake for another 20 minutes. Transfer to a wire rack to cool.
While the biscotti are in the oven for the second time, prepare the zabaglione dip. Beat the egg yolks, sugar and cinnamon in a heatproof mixing bowl.
Once the mixture is pale, place the bowl on top of a pan of simmering water. Add the Marsala wine and liqueur and whisk for about 5 minutes until smooth and creamy. Whip the cream to soft peaks in a separate bowl then fold into the egg mixture.
Serve the biscotti with the zabaglione dip alongside.


| Created: | 1/27/2021 3:41:45 PM |
| Modified: | 1/27/2021 3:41:45 PM |
| Project: | |
| Advanced: |
| Attribute |
|
Public bigint fund_code_id |
|
Details:
|
|
Public varchar(255) fund_code_code |
|
Details:
|
|
Public varchar(255) fund_code_description |
|
Details:
|
|
Public varchar(255) fund_code_reporting_structure |
|
Details:
|
|
Public bigint fund_code_account_id |
|
Details:
|
|
Public varchar(255) fund_code_chapter_advances |
|
Details:
|
|
Public integer fund_code_enactment_year |
|
Details:
|
|
Public timestamp with time zone(0) created_at |
|
Details:
|
|
Public bigint created_by_user_id |
|
Details:
|
|
Public varchar(255) created_by_user_sub |
|
Details:
|
|
Public varchar(255) created_by_user_first_name |
|
Details:
|
|
Public varchar(255) created_by_user_last_name |
|
Details:
|
|
Public varchar(255) created_by_user_email |
|
Details:
|
|
Public timestamp with time zone(0) updated_at |
|
Details:
|
|
Public bigint updated_by_user_id |
|
Details:
|
|
Public varchar(255) updated_by_user_sub |
|
Details:
|
|
Public varchar(255) updated_by_user_first_name |
|
Details:
|
|
Public varchar(255) updated_by_user_last_name |
|
Details:
|
|
Public varchar(255) updated_by_user_email |
|
Details:
|
|
Public timestamp with time zone(0) start_date |
|
Details:
|
|
Public timestamp with time zone(0) end_date |
|
Details:
|
|
Public bigserial ods_id |
|
Details:
|
|
Public jsonb ods_meta |
|
Details:
|
|
Public varchar(255) ods_created_by |
|
Details:
|
|
Public timestamp with time zone(0) ods_created_at |
|
Details:
|
|
Public varchar(255) created_by_user_oid |
|
Details:
|
|
Public varchar(255) updated_by_user_oid |
|
Details:
|
| Operation | ||
|
Public fund_codes_pkey( ods_id: bigserial, |
||
|
Details:
<<PK>>
|
| Tag | Value |
| Owner | public |
|
Details:
|
| Property | Value |
| isFinalSpecialization: | 0 |