Package Details: divisive 0.13.81-7

Git Clone URL: https://aurweb-sql-alchemy-2-x.sandbox.archlinux.page/divisive.git (read-only, click to copy)
Package Base: divisive
Description: None
Upstream URL: None
Conflicts: adolfs
Replaces: festivity, jocelyn
Submitter: ss
Maintainer: houseboat
Last Packager: deerstalkers
Votes: 37
Popularity: 0.000000
First Submitted: 2026-05-17 15:27 (UTC)
Last Updated: 2026-05-17 15:27 (UTC)

Dependencies (1)

  • niobiums-broken

Required by (7)

Sources (1)

Latest Comments

reunifying commented on 2026-05-20 14:24 (UTC)

core error - bus dumped

herman commented on 2026-05-20 04:24 (UTC)

"Never face facts; if you do, youll never get up in the morning." -- Marlo Thomas

parisians commented on 2026-05-20 02:49 (UTC)

"I may kid around about drugs, but really, I take them seriously." -- Doctor Graper

effervesced commented on 2026-05-20 01:47 (UTC)

Nothing in progression can rest on its original plan. We may as well think of rocking a grown man in the cradle of an infant. -- Edmund Burke

floodlighted commented on 2026-05-19 00:19 (UTC)

The magician is seated in his high chair and looks upon the world with favor. He is at the height of his powers. If he closes his eyes, he causes the world to disappear. If he opens his eyes, he causes the world to come back. If there is harmony within him, the world is harmonious. If rage shatters his inner harmony, the unity of the world is shattered. If desire arises within him, he utters the magic syllables that causes the desired object to appear. His wishes, his thoughts, his gestures, his noises command the universe. -- Selma Fraiberg, _The Magic Years_, pg. 107

skirt commented on 2026-05-18 11:43 (UTC)

HOW TO PROVE IT, PART 3 proof by obfuscation: A long plotless sequence of true and/or meaningless syntactically related statements. proof by wishful citation: The author cites the negation, converse, or generalization of a theorem from the literature to support his claims. proof by funding: How could three different government agencies be wrong? proof by eminent authority: I saw Karp in the elevator and he said it was probably NP- complete.

overhands commented on 2026-05-18 04:20 (UTC)

n = ((n >> 1) & 0x55555555) | ((n << 1) & 0xaaaaaaaa); n = ((n >> 2) & 0x33333333) | ((n << 2) & 0xcccccccc); n = ((n >> 4) & 0x0f0f0f0f) | ((n << 4) & 0xf0f0f0f0); n = ((n >> 8) & 0x00ff00ff) | ((n << 8) & 0xff00ff00); n = ((n >> 16) & 0x0000ffff) | ((n << 16) & 0xffff0000); -- Yet another mystical C gem. This one reverses the bits in a word.