Print Page - Lists Linking Demo

Title: Lists Linking Demo
Post by: SMcNeill on January 17, 2019, 10:32:01 am

And since STxAxTIC asked about the linkedlist.bas file which was accidently included in the zip file for the Old Dice Roller I'm working on, I thought I'd explain about it here:

Code: QB64: [Select]

''$INCLUDE:'colorall.bi'
$IF KOLOR = UNDEFINED THEN
    $LET KOLOR = 32
$END IF
 
$IF KOLOR = 32 THEN
    CONST AliceBlue = &HFFF0F8FF~& ' _RGB32(240,248,255)
    CONST Almond = &HFFEFDECD~& '_RGB32(239,222,205)
    CONST AntiqueBrass = &HFFCD9575~& '_RGB32(205,149,117)
    CONST AntiqueWhite = &HFFFAEBD7~& ' _RGB32(250,235,215)
    CONST Apricot = &HFFFDD9B5~& '_RGB32(253,217,181)
    CONST Aqua = &HFF00FFFF~& ' _RGB32(0,255,255)
    CONST Aquamarine = &HFF7FFFD4~& ' _RGB32(127,255,212)
    CONST Asparagus = &HFF87A96B~& '_RGB32(135,169,107)
    CONST AtomicTangerine = &HFFFFA474~& '_RGB32(255,164,116)
    CONST Azure = &HFFF0FFFF~& ' _RGB32(240,255,255)
    CONST BananaMania = &HFFFAE7B5~& '_RGB32(250,231,181)
    CONST Beaver = &HFF9F8170~& '_RGB32(159,129,112)
    CONST Beige = &HFFF5F5DC~& ' _RGB32(245,245,220)
    CONST Bisque = &HFFFFE4C4~& ' _RGB32(255,228,196)
    CONST Bittersweet = &HFFFD7C6E~& '_RGB32(253,124,110)
    CONST Black = &HFF000000~& ' _RGB32(0,0,0)
    CONST BlanchedAlmond = &HFFFFEBCD~& ' _RGB32(255,235,205)
    CONST BlizzardBlue = &HFFACE5EE~& '_RGB32(172,229,238)
    CONST Blue = &HFF0000FF~& ' _RGB32(0,0,255)
    CONST BlueBell = &HFFA2A2D0~& '_RGB32(162,162,208)
    CONST BlueGray = &HFF6699CC~& '_RGB32(102,153,204)
    CONST BlueGreen = &HFF0D98BA~& '_RGB32(13,152,186)
    CONST BlueViolet = &HFF8A2BE2~& ' _RGB32(138,43,226)
    CONST Blush = &HFFDE5D83~& '_RGB32(222,93,131)
    CONST BrickRed = &HFFCB4154~& '_RGB32(203,65,84)
    CONST Brown = &HFFA52A2A~& ' _RGB32(165,42,42)
    CONST BurlyWood = &HFFDEB887~& ' _RGB32(222,184,135)
    CONST BurntOrange = &HFFFF7F49~& '_RGB32(255,127,73)
    CONST BurntSienna = &HFFEA7E5D~& '_RGB32(234,126,93)
    CONST CadetBlue = &HFF5F9EA0~& ' _RGB32(95,158,160)
    CONST Canary = &HFFFFFF99~& '_RGB32(255,255,153)
    CONST CaribbeanGreen = &HFF1CD3A2~& '_RGB32(28,211,162)
    CONST CarnationPink = &HFFFFAACC~& '_RGB32(255,170,204)
    CONST Cerise = &HFFDD4492~& '_RGB32(221,68,146)
    CONST Cerulean = &HFF1DACD6~& '_RGB32(29,172,214)
    CONST ChartReuse = &HFF7FFF00~& ' _RGB32(127,255,0)
    CONST Chestnut = &HFFBC5D58~& '_RGB32(188,93,88)
    CONST Chocolate = &HFFD2691E~& ' _RGB32(210,105,30)
    CONST Copper = &HFFDD9475~& '_RGB32(221,148,117)
    CONST Coral = &HFFFF7F50~& ' _RGB32(255,127,80)
    CONST Cornflower = &HFF9ACEEB~& '_RGB32(154,206,235)
    CONST CornflowerBlue = &HFF6495ED~& ' _RGB32(100,149,237)
    CONST Cornsilk = &HFFFFF8DC~& ' _RGB32(255,248,220)
    CONST CottonCandy = &HFFFFBCD9~& '_RGB32(255,188,217)
    CONST CrayolaAquamarine = &HFF78DBE2~& '_RGB32(120,219,226)
    CONST CrayolaBlue = &HFF1F75FE~& '_RGB32(31,117,254)
    CONST CrayolaBlueViolet = &HFF7366BD~& '_RGB32(115,102,189)
    CONST CrayolaBrown = &HFFB4674D~& '_RGB32(180,103,77)
    CONST CrayolaCadetBlue = &HFFB0B7C6~& '_RGB32(176,183,198)
    CONST CrayolaForestGreen = &HFF6DAE81~& '_RGB32(109,174,129)
    CONST CrayolaGold = &HFFE7C697~& '_RGB32(231,198,151)
    CONST CrayolaGoldenrod = &HFFFCD975~& '_RGB32(252,217,117)
    CONST CrayolaGray = &HFF95918C~& '_RGB32(149,145,140)
    CONST CrayolaGreen = &HFF1CAC78~& '_RGB32(28,172,120)
    CONST CrayolaGreenYellow = &HFFF0E891~& '_RGB32(240,232,145)
    CONST CrayolaIndigo = &HFF5D76CB~& '_RGB32(93,118,203)
    CONST CrayolaLavender = &HFFFCB4D5~& '_RGB32(252,180,213)
    CONST CrayolaMagenta = &HFFF664AF~& '_RGB32(246,100,175)
    CONST CrayolaMaroon = &HFFC8385A~& '_RGB32(200,56,90)
    CONST CrayolaMidnightBlue = &HFF1A4876~& '_RGB32(26,72,118)
    CONST CrayolaOrange = &HFFFF7538~& '_RGB32(255,117,56)
    CONST CrayolaOrangeRed = &HFFFF2B2B~& '_RGB32(255,43,43)
    CONST CrayolaOrchid = &HFFE6A8D7~& '_RGB32(230,168,215)
    CONST CrayolaPlum = &HFF8E4585~& '_RGB32(142,69,133)
    CONST CrayolaRed = &HFFEE204D~& '_RGB32(238,32,77)
    CONST CrayolaSalmon = &HFFFF9BAA~& '_RGB32(255,155,170)
    CONST CrayolaSeaGreen = &HFF9FE2BF~& '_RGB32(159,226,191)
    CONST CrayolaSilver = &HFFCDC5C2~& '_RGB32(205,197,194)
    CONST CrayolaSkyBlue = &HFF80DAEB~& '_RGB32(128,218,235)
    CONST CrayolaSpringGreen = &HFFECEABE~& '_RGB32(236,234,190)
    CONST CrayolaTann = &HFFFAA76C~& '_RGB32(250,167,108)
    CONST CrayolaThistle = &HFFEBC7DF~& '_RGB32(235,199,223)
    CONST CrayolaViolet = &HFF926EAE~& '_RGB32(146,110,174)
    CONST CrayolaYellow = &HFFFCE883~& '_RGB32(252,232,131)
    CONST CrayolaYellowGreen = &HFFC5E384~& '_RGB32(197,227,132)
    CONST Crimson = &HFFDC143C~& ' _RGB32(220,20,60)
    CONST Cyan = &HFF00FFFF~& ' _RGB32(0,255,255)
    CONST Dandelion = &HFFFDDB6D~& '_RGB32(253,219,109)
    CONST DarkBlue = &HFF00008B~& ' _RGB32(0,0,139)
    CONST DarkCyan = &HFF008B8B~& ' _RGB32(0,139,139)
    CONST DarkGoldenRod = &HFFB8860B~& ' _RGB32(184,134,11)
    CONST DarkGray = &HFFA9A9A9~& ' _RGB32(169,169,169)
    CONST DarkGreen = &HFF006400~& ' _RGB32(0,100,0)
    CONST DarkKhaki = &HFFBDB76B~& ' _RGB32(189,183,107)
    CONST DarkMagenta = &HFF8B008B~& ' _RGB32(139,0,139)
    CONST DarkOliveGreen = &HFF556B2F~& ' _RGB32(85,107,47)
    CONST DarkOrange = &HFFFF8C00~& ' _RGB32(255,140,0)
    CONST DarkOrchid = &HFF9932CC~& ' _RGB32(153,50,204)
    CONST DarkRed = &HFF8B0000~& ' _RGB32(139,0,0)
    CONST DarkSalmon = &HFFE9967A~& ' _RGB32(233,150,122)
    CONST DarkSeaGreen = &HFF8FBC8F~& ' _RGB32(143,188,143)
    CONST DarkSlateBlue = &HFF483D8B~& ' _RGB32(72,61,139)
    CONST DarkSlateGray = &HFF2F4F4F~& ' _RGB32(47,79,79)
    CONST DarkTurquoise = &HFF00CED1~& ' _RGB32(0,206,209)
    CONST DarkViolet = &HFF9400D3~& ' _RGB32(148,0,211)
    CONST DeepPink = &HFFFF1493~& ' _RGB32(255,20,147)
    CONST DeepSkyBlue = &HFF00BFFF~& ' _RGB32(0,191,255)
    CONST Denim = &HFF2B6CC4~& '_RGB32(43,108,196)
    CONST DesertSand = &HFFEFCDB8~& '_RGB32(239,205,184)
    CONST DimGray = &HFF696969~& ' _RGB32(105,105,105)
    CONST DodgerBlue = &HFF1E90FF~& ' _RGB32(30,144,255)
    CONST Eggplant = &HFF6E5160~& '_RGB32(110,81,96)
    CONST ElectricLime = &HFFCEFF1D~& '_RGB32(206,255,29)
    CONST Fern = &HFF71BC78~& '_RGB32(113,188,120)
    CONST FireBrick = &HFFB22222~& ' _RGB32(178,34,34)
    CONST Floralwhite = &HFFFFFAF0~& ' _RGB32(255,250,240)
    CONST ForestGreen = &HFF228B22~& ' _RGB32(34,139,34)
    CONST Fuchsia = &HFFC364C5~& '_RGB32(195,100,197)
    CONST FuzzyWuzzy = &HFFCC6666~& '_RGB32(204,102,102)
    CONST Gainsboro = &HFFDCDCDC~& ' _RGB32(220,220,220)
    CONST GhostWhite = &HFFF8F8FF~& ' _RGB32(248,248,255)
    CONST Gold = &HFFFFD700~& ' _RGB32(255,215,0)
    CONST GoldenRod = &HFFDAA520~& ' _RGB32(218,165,32)
    CONST GrannySmithApple = &HFFA8E4A0~& '_RGB32(168,228,160)
    CONST Gray = &HFF808080~& ' _RGB32(128,128,128)
    CONST Green = &HFF008000~& ' _RGB32(0,128,0)
    CONST GreenBlue = &HFF1164B4~& '_RGB32(17,100,180)
    CONST GreenYellow = &HFFADFF2F~& ' _RGB32(173,255,47)
    CONST HoneyDew = &HFFF0FFF0~& ' _RGB32(240,255,240)
    CONST HotMagenta = &HFFFF1DCE~& '_RGB32(255,29,206)
    CONST HotPink = &HFFFF69B4~& ' _RGB32(255,105,180)
    CONST Inchworm = &HFFB2EC5D~& '_RGB32(178,236,93)
    CONST IndianRed = &HFFCD5C5C~& ' _RGB32(205,92,92)
    CONST Indigo = &HFF4B0082~& ' _RGB32(75,0,130)
    CONST Ivory = &HFFFFFFF0~& ' _RGB32(255,255,240)
    CONST JazzberryJam = &HFFCA3767~& '_RGB32(202,55,103)
    CONST JungleGreen = &HFF3BB08F~& '_RGB32(59,176,143)
    CONST Khaki = &HFFF0E68C~& ' _RGB32(240,230,140)
    CONST LaserLemon = &HFFFEFE22~& '_RGB32(254,254,34)
    CONST Lavender = &HFFE6E6FA~& ' _RGB32(230,230,250)
    CONST LavenderBlush = &HFFFFF0F5~& ' _RGB32(255,240,245)
    CONST LawnGreen = &HFF7CFC00~& ' _RGB32(124,252,0)
    CONST LemonChiffon = &HFFFFFACD~& ' _RGB32(255,250,205)
    CONST LemonYellow = &HFFFFF44F~& '_RGB32(255,244,79)
    CONST LightBlue = &HFFADD8E6~& ' _RGB32(173,216,230)
    CONST LightCoral = &HFFF08080~& ' _RGB32(240,128,128)
    CONST LightCyan = &HFFE0FFFF~& ' _RGB32(224,255,255)
    CONST LightGoldenRodYellow = &HFFFAFAD2~& ' _RGB32(250,250,210)
    CONST LightGray = &HFFD3D3D3~& ' _RGB32(211,211,211)
    CONST LightGreen = &HFF90EE90~& ' _RGB32(144,238,144)
    CONST LightPink = &HFFFFB6C1~& ' _RGB32(255,182,193)
    CONST LightSalmon = &HFFFFA07A~& ' _RGB32(255,160,122)
    CONST LightSeaGreen = &HFF20B2AA~& ' _RGB32(32,178,170)
    CONST LightSkyBlue = &HFF87CEFA~& ' _RGB32(135,206,250)
    CONST LightSlateGray = &HFF778899~& ' _RGB32(119,136,153)
    CONST LightSteelBlue = &HFFB0C4DE~& ' _RGB32(176,196,222)
    CONST LightYellow = &HFFFFFFE0~& ' _RGB32(255,255,224)
    CONST Lime = &HFF00FF00~& ' _RGB32(0,255,0)
    CONST LimeGreen = &HFF32CD32~& ' _RGB32(50,205,50)
    CONST Linen = &HFFFAF0E6~& ' _RGB32(250,240,230)
    CONST MacaroniAndCheese = &HFFFFBD88~& '_RGB32(255,189,136)
    CONST Magenta = &HFFFF00FF~& ' _RGB32(255,0,255)
    CONST MagicMint = &HFFAAF0D1~& '_RGB32(170,240,209)
    CONST Mahogany = &HFFCD4A4C~& '_RGB32(205,74,76)
    CONST Maize = &HFFEDD19C~& '_RGB32(237,209,156)
    CONST Manatee = &HFF979AAA~& '_RGB32(151,154,170)
    CONST MangoTango = &HFFFF8243~& '_RGB32(255,130,67)
    CONST Maroon = &HFF800000~& ' _RGB32(128,0,0)
    CONST Mauvelous = &HFFEF98AA~& '_RGB32(239,152,170)
    CONST MediumAquamarine = &HFF66CDAA~& ' _RGB32(102,205,170)
    CONST MediumBlue = &HFF0000CD~& ' _RGB32(0,0,205)
    CONST MediumOrchid = &HFFBA55D3~& ' _RGB32(186,85,211)
    CONST MediumPurple = &HFF9370DB~& ' _RGB32(147,112,219)
    CONST MediumSeaGreen = &HFF3CB371~& ' _RGB32(60,179,113)
    CONST MediumSlateBlue = &HFF7B68EE~& ' _RGB32(123,104,238)
    CONST MediumSpringGreen = &HFF00FA9A~& ' _RGB32(0,250,154)
    CONST MediumTurquoise = &HFF48D1CC~& ' _RGB32(72,209,204)
    CONST MediumVioletRed = &HFFC71585~& ' _RGB32(199,21,133)
    CONST Melon = &HFFFDBCB4~& '_RGB32(253,188,180)
    CONST MidnightBlue = &HFF191970~& ' _RGB32(25,25,112)
    CONST MintCream = &HFFF5FFFA~& ' _RGB32(245,255,250)
    CONST MistyRose = &HFFFFE4E1~& ' _RGB32(255,228,225)
    CONST Moccasin = &HFFFFE4B5~& ' _RGB32(255,228,181)
    CONST MountainMeadow = &HFF30BA8F~& '_RGB32(48,186,143)
    CONST Mulberry = &HFFC54B8C~& '_RGB32(197,75,140)
    CONST NavajoWhite = &HFFFFDEAD~& ' _RGB32(255,222,173)
    CONST Navy = &HFF000080~& ' _RGB32(0,0,128)
    CONST NavyBlue = &HFF1974D2~& '_RGB32(25,116,210)
    CONST NeonCarrot = &HFFFFA343~& '_RGB32(255,163,67)
    CONST OldLace = &HFFFDF5E6~& ' _RGB32(253,245,230)
    CONST Olive = &HFF808000~& ' _RGB32(128,128,0)
    CONST OliveDrab = &HFF6B8E23~& ' _RGB32(107,142,35)
    CONST OliveGreen = &HFFBAB86C~& '_RGB32(186,184,108)
    CONST Orange = &HFFFFA500~& ' _RGB32(255,165,0)
    CONST OrangeRed = &HFFFF4500~& ' _RGB32(255,69,0)
    CONST OrangeYellow = &HFFF8D568~& '_RGB32(248,213,104)
    CONST Orchid = &HFFDA70D6~& ' _RGB32(218,112,214)
    CONST OuterSpace = &HFF414A4C~& '_RGB32(65,74,76)
    CONST OutrageousOrange = &HFFFF6E4A~& '_RGB32(255,110,74)
    CONST PacificBlue = &HFF1CA9C9~& '_RGB32(28,169,201)
    CONST PaleGoldenRod = &HFFEEE8AA~& ' _RGB32(238,232,170)
    CONST PaleGreen = &HFF98FB98~& ' _RGB32(152,251,152)
    CONST PaleTurquoise = &HFFAFEEEE~& ' _RGB32(175,238,238)
    CONST PaleVioletRed = &HFFDB7093~& ' _RGB32(219,112,147)
    CONST PapayaWhip = &HFFFFEFD5~& ' _RGB32(255,239,213)
    CONST Peach = &HFFFFCFAB~& '_RGB32(255,207,171)
    CONST PeachPuff = &HFFFFDAB9~& ' _RGB32(255,218,185)
    CONST Periwinkle = &HFFC5D0E6~& '_RGB32(197,208,230)
    CONST Peru = &HFFCD853F~& ' _RGB32(205,133,63)
    CONST PiggyPink = &HFFFDDDE6~& '_RGB32(253,221,230)
    CONST PineGreen = &HFF158078~& '_RGB32(21,128,120)
    CONST Pink = &HFFFFC0CB~& ' _RGB32(255,192,203)
    CONST PinkFlamingo = &HFFFC74FD~& '_RGB32(252,116,253)
    CONST PinkSherbet = &HFFF78FA7~& '_RGB32(247,143,167)
    CONST Plum = &HFFDDA0DD~& ' _RGB32(221,160,221)
    CONST PowderBlue = &HFFB0E0E6~& ' _RGB32(176,224,230)
    CONST Purple = &HFF800080~& ' _RGB32(128,0,128)
    CONST PurpleHeart = &HFF7442C8~& '_RGB32(116,66,200)
    CONST PurpleMountainsMajesty = &HFF9D81BA~& '_RGB32(157,129,186)
    CONST PurplePizzazz = &HFFFE4EDA~& '_RGB32(254,78,218)
    CONST RadicalRed = &HFFFF496C~& '_RGB32(255,73,108)
    CONST RawSienna = &HFFD68A59~& '_RGB32(214,138,89)
    CONST RawUmber = &HFF714B23~& '_RGB32(113,75,35)
    CONST RazzleDazzleRose = &HFFFF48D0~& '_RGB32(255,72,208)
    CONST Razzmatazz = &HFFE3256B~& '_RGB32(227,37,107)
    CONST Red = &HFFFF0000~& ' _RGB32(255,0,0)
    CONST RedOrange = &HFFFF5349~& '_RGB32(255,83,73)
    CONST RedViolet = &HFFC0448F~& '_RGB32(192,68,143)
    CONST RobinsEggBlue = &HFF1FCECB~& '_RGB32(31,206,203)
    CONST RosyBrown = &HFFBC8F8F~& ' _RGB32(188,143,143)
    CONST RoyalBlue = &HFF4169E1~& ' _RGB32(65,105,225)
    CONST RoyalPurple = &HFF7851A9~& '_RGB32(120,81,169)
    CONST SaddleBrown = &HFF8B4513~& ' _RGB32(139,69,19)
    CONST Salmon = &HFFFA8072~& ' _RGB32(250,128,114)
    CONST SandyBrown = &HFFF4A460~& ' _RGB32(244,164,96)
    CONST Scarlet = &HFFFC2847~& '_RGB32(252,40,71)
    CONST ScreaminGreen = &HFF76FF7A~& '_RGB32(118,255,122)
    CONST SeaGreen = &HFF2E8B57~& ' _RGB32(46,139,87)
    CONST SeaShell = &HFFFFF5EE~& ' _RGB32(255,245,238)
    CONST Sepia = &HFFA5694F~& '_RGB32(165,105,79)
    CONST Shadow = &HFF8A795D~& '_RGB32(138,121,93)
    CONST Shamrock = &HFF45CEA2~& '_RGB32(69,206,162)
    CONST ShockingPink = &HFFFB7EFD~& '_RGB32(251,126,253)
    CONST Sienna = &HFFA0522D~& ' _RGB32(160,82,45)
    CONST Silver = &HFFC0C0C0~& ' _RGB32(192,192,192)
    CONST SkyBlue = &HFF87CEEB~& ' _RGB32(135,206,235)
    CONST SlateBlue = &HFF6A5ACD~& ' _RGB32(106,90,205)
    CONST SlateGray = &HFF708090~& ' _RGB32(112,128,144)
    CONST Snow = &HFFFFFAFA~& ' _RGB32(255,250,250)
    CONST SpringGreen = &HFF00FF7F~& ' _RGB32(0,255,127)
    CONST SteelBlue = &HFF4682B4~& ' _RGB32(70,130,180)
    CONST Sunglow = &HFFFFCF48~& '_RGB32(255,207,72)
    CONST SunsetOrange = &HFFFD5E53~& '_RGB32(253,94,83)
    CONST Tann = &HFFD2B48C~& ' _RGB32(210,180,140)
    CONST Teal = &HFF008080~& ' _RGB32(0,128,128)
    CONST TealBlue = &HFF18A7B5~& '_RGB32(24,167,181)
    CONST Thistle = &HFFD8BFD8~& ' _RGB32(216,191,216)
    CONST TickleMePink = &HFFFC89AC~& '_RGB32(252,137,172)
    CONST Timberwolf = &HFFDBD7D2~& '_RGB32(219,215,210)
    CONST Tomato = &HFFFF6347~& ' _RGB32(255,99,71)
    CONST TropicalRainForest = &HFF17806D~& '_RGB32(23,128,109)
    CONST Tumbleweed = &HFFDEAA88~& '_RGB32(222,170,136)
    CONST Turquoise = &HFF40E0D0~& ' _RGB32(64,224,208)
    CONST TurquoiseBlue = &HFF77DDE7~& '_RGB32(119,221,231)
    CONST UnmellowYellow = &HFFFFFF66~& '_RGB32(255,255,102)
    CONST Violet = &HFFEE82EE~& ' _RGB32(238,130,238)
    CONST VioletBlue = &HFF324AB2~& '_RGB32(50,74,178)
    CONST VioletRed = &HFFF75394~& '_RGB32(247,83,148)
    CONST VividTangerine = &HFFFFA089~& '_RGB32(255,160,137)
    CONST VividViolet = &HFF8F509D~& '_RGB32(143,80,157)
    CONST Wheat = &HFFF5DEB3~& ' _RGB32(245,222,179)
    CONST White = &HFFFFFFFF~& ' _RGB32(255,255,255)
    CONST Whitesmoke = &HFFF5F5F5~& ' _RGB32(245,245,245)
    CONST WildBlueYonder = &HFFA2ADD0~& '_RGB32(162,173,208)
    CONST WildStrawberry = &HFFFF43A4~& '_RGB32(255,67,164)
    CONST WildWatermelon = &HFFFC6C85~& '_RGB32(252,108,133)
    CONST Wisteria = &HFFCDA4DE~& '_RGB32(205,164,222)
    CONST Yellow = &HFFFFFF00~& ' _RGB32(255,255,0)
    CONST YellowGreen = &HFF9ACD32~& ' _RGB32(154,205,50)
    CONST YellowOrange = &HFFFFAE42~& '_RGB32(255,174,66)
$END IF
 
$IF KOLOR = 0 THEN
    CONST Black = 0~%%
    CONST Blue = 1~%%
    CONST Green = 2~%%
    CONST Cyan = 3~%%
    CONST Red = 4~%%
    CONST Magenta = 5~%%
    CONST Brown = 6~%%
    CONST White = 7~%%
    CONST Gray = 8~%%
    CONST LightBlue = 9~%%
    CONST LightGreen = 10~%%
    CONST LightCyan = 11~%%
    CONST LightRed = 12~%%
    CONST LightMagenta = 13~%%
    CONST Yellow = 14~%%
    CONST BrightWhite = 15~%%
    CONST Blink = 16~%%
$END IF
 
$IF KOLOR = 256 THEN
    CONST Black = 0~%%
    CONST Blue = 1~%%
    CONST Green = 2~%%
    CONST Cyan = 3~%%
    CONST Red = 4~%%
    CONST Magenta = 5~%%
    CONST Brown = 6~%%
    CONST White = 7~%%
    CONST Gray = 8~%%
    CONST LightBlue = 9~%%
    CONST LightGreen = 10~%%
    CONST LightCyan = 11~%%
    CONST LightRed = 12~%%
    CONST LightMagenta = 13~%%
    CONST Yellow = 14~%%
    CONST BrightWhite = 15~%%
    _PALETTECOLOR 16, _RGBA32(240, 248, 255, 255): CONST AliceBlue = 16~%%
    _PALETTECOLOR 17, _RGBA32(239, 222, 205, 255): CONST Almond = 17~%%
    _PALETTECOLOR 18, _RGBA32(205, 149, 117, 255): CONST AntiqueBrass = 18~%%
    _PALETTECOLOR 19, _RGBA32(250, 235, 215, 255): CONST AntiqueWhite = 19~%%
    _PALETTECOLOR 20, _RGBA32(253, 217, 181, 255): CONST Apricot = 20~%%
    _PALETTECOLOR 21, _RGBA32(0, 255, 255, 255): CONST Aqua = 21~%%
    _PALETTECOLOR 22, _RGBA32(127, 255, 212, 255): CONST Aquamarine = 22~%%
    _PALETTECOLOR 23, _RGBA32(135, 169, 107, 255): CONST Asparagus = 23~%%
    _PALETTECOLOR 24, _RGBA32(255, 164, 116, 255): CONST AtomicTangerine = 24~%%
    _PALETTECOLOR 25, _RGBA32(240, 255, 255, 255): CONST Azure = 25~%%
    _PALETTECOLOR 26, _RGBA32(250, 231, 181, 255): CONST BananaMania = 26~%%
    _PALETTECOLOR 27, _RGBA32(159, 129, 112, 255): CONST Beaver = 27~%%
    _PALETTECOLOR 28, _RGBA32(245, 245, 220, 255): CONST Beige = 28~%%
    _PALETTECOLOR 29, _RGBA32(255, 228, 196, 255): CONST Bisque = 29~%%
    _PALETTECOLOR 30, _RGBA32(253, 124, 110, 255): CONST Bittersweet = 30~%%
    _PALETTECOLOR 31, _RGBA32(255, 235, 205, 255): CONST BlanchedAlmond = 31~%%
    _PALETTECOLOR 32, _RGBA32(172, 229, 238, 255): CONST BlizzardBlue = 32~%%
    _PALETTECOLOR 33, _RGBA32(162, 162, 208, 255): CONST BlueBell = 33~%%
    _PALETTECOLOR 34, _RGBA32(102, 153, 204, 255): CONST BlueGray = 34~%%
    _PALETTECOLOR 35, _RGBA32(13, 152, 186, 255): CONST BlueGreen = 35~%%
    _PALETTECOLOR 36, _RGBA32(138, 43, 226, 255): CONST BlueViolet = 36~%%
    _PALETTECOLOR 37, _RGBA32(222, 93, 131, 255): CONST Blush = 37~%%
    _PALETTECOLOR 38, _RGBA32(203, 65, 84, 255): CONST BrickRed = 38~%%
    _PALETTECOLOR 39, _RGBA32(222, 184, 135, 255): CONST BurlyWood = 39~%%
    _PALETTECOLOR 40, _RGBA32(255, 127, 73, 255): CONST BurntOrange = 40~%%
    _PALETTECOLOR 41, _RGBA32(234, 126, 93, 255): CONST BurntSienna = 41~%%
    _PALETTECOLOR 42, _RGBA32(95, 158, 160, 255): CONST CadetBlue = 42~%%
    _PALETTECOLOR 43, _RGBA32(255, 255, 153, 255): CONST Canary = 43~%%
    _PALETTECOLOR 44, _RGBA32(28, 211, 162, 255): CONST CaribbeanGreen = 44~%%
    _PALETTECOLOR 45, _RGBA32(255, 170, 204, 255): CONST CarnationPink = 45~%%
    _PALETTECOLOR 46, _RGBA32(221, 68, 146, 255): CONST Cerise = 46~%%
    _PALETTECOLOR 47, _RGBA32(29, 172, 214, 255): CONST Cerulean = 47~%%
    _PALETTECOLOR 48, _RGBA32(127, 255, 0, 255): CONST ChartReuse = 48~%%
    _PALETTECOLOR 49, _RGBA32(188, 93, 88, 255): CONST Chestnut = 49~%%
    _PALETTECOLOR 50, _RGBA32(210, 105, 30, 255): CONST Chocolate = 50~%%
    _PALETTECOLOR 51, _RGBA32(221, 148, 117, 255): CONST Copper = 51~%%
    _PALETTECOLOR 52, _RGBA32(255, 127, 80, 255): CONST Coral = 52~%%
    _PALETTECOLOR 53, _RGBA32(154, 206, 235, 255): CONST Cornflower = 53~%%
    _PALETTECOLOR 54, _RGBA32(100, 149, 237, 255): CONST CornflowerBlue = 54~%%
    _PALETTECOLOR 55, _RGBA32(255, 248, 220, 255): CONST Cornsilk = 55~%%
    _PALETTECOLOR 56, _RGBA32(255, 188, 217, 255): CONST CottonCandy = 56~%%
    _PALETTECOLOR 57, _RGBA32(220, 20, 60, 255): CONST Crimson = 57~%%
    _PALETTECOLOR 58, _RGBA32(253, 219, 109, 255): CONST Dandelion = 58~%%
    _PALETTECOLOR 59, _RGBA32(0, 0, 139, 255): CONST DarkBlue = 59~%%
    _PALETTECOLOR 60, _RGBA32(0, 139, 139, 255): CONST DarkCyan = 60~%%
    _PALETTECOLOR 61, _RGBA32(184, 134, 11, 255): CONST DarkGoldenRod = 61~%%
    _PALETTECOLOR 62, _RGBA32(169, 169, 169, 255): CONST DarkGray = 62~%%
    _PALETTECOLOR 63, _RGBA32(0, 100, 0, 255): CONST DarkGreen = 63~%%
    _PALETTECOLOR 64, _RGBA32(189, 183, 107, 255): CONST DarkKhaki = 64~%%
    _PALETTECOLOR 65, _RGBA32(139, 0, 139, 255): CONST DarkMagenta = 65~%%
    _PALETTECOLOR 66, _RGBA32(85, 107, 47, 255): CONST DarkOliveGreen = 66~%%
    _PALETTECOLOR 67, _RGBA32(255, 140, 0, 255): CONST DarkOrange = 67~%%
    _PALETTECOLOR 68, _RGBA32(153, 50, 204, 255): CONST DarkOrchid = 68~%%
    _PALETTECOLOR 69, _RGBA32(139, 0, 0, 255): CONST DarkRed = 69~%%
    _PALETTECOLOR 70, _RGBA32(233, 150, 122, 255): CONST DarkSalmon = 70~%%
    _PALETTECOLOR 71, _RGBA32(143, 188, 143, 255): CONST DarkSeaGreen = 71~%%
    _PALETTECOLOR 72, _RGBA32(72, 61, 139, 255): CONST DarkSlateBlue = 72~%%
    _PALETTECOLOR 73, _RGBA32(47, 79, 79, 255): CONST DarkSlateGray = 73~%%
    _PALETTECOLOR 74, _RGBA32(0, 206, 209, 255): CONST DarkTurquoise = 74~%%
    _PALETTECOLOR 75, _RGBA32(148, 0, 211, 255): CONST DarkViolet = 75~%%
    _PALETTECOLOR 76, _RGBA32(255, 20, 147, 255): CONST DeepPink = 76~%%
    _PALETTECOLOR 77, _RGBA32(0, 191, 255, 255): CONST DeepSkyBlue = 77~%%
    _PALETTECOLOR 78, _RGBA32(43, 108, 196, 255): CONST Denim = 78~%%
    _PALETTECOLOR 79, _RGBA32(239, 205, 184, 255): CONST DesertSand = 79~%%
    _PALETTECOLOR 80, _RGBA32(105, 105, 105, 255): CONST DimGray = 80~%%
    _PALETTECOLOR 81, _RGBA32(30, 144, 255, 255): CONST DodgerBlue = 81~%%
    _PALETTECOLOR 82, _RGBA32(110, 81, 96, 255): CONST Eggplant = 82~%%
    _PALETTECOLOR 83, _RGBA32(206, 255, 29, 255): CONST ElectricLime = 83~%%
    _PALETTECOLOR 84, _RGBA32(113, 188, 120, 255): CONST Fern = 84~%%
    _PALETTECOLOR 85, _RGBA32(178, 34, 34, 255): CONST FireBrick = 85~%%
    _PALETTECOLOR 86, _RGBA32(255, 250, 240, 255): CONST Floralwhite = 86~%%
    _PALETTECOLOR 87, _RGBA32(34, 139, 34, 255): CONST ForestGreen = 87~%%
    _PALETTECOLOR 88, _RGBA32(195, 100, 197, 255): CONST Fuchsia = 88~%%
    _PALETTECOLOR 89, _RGBA32(204, 102, 102, 255): CONST FuzzyWuzzy = 89~%%
    _PALETTECOLOR 90, _RGBA32(220, 220, 220, 255): CONST Gainsboro = 90~%%
    _PALETTECOLOR 91, _RGBA32(248, 248, 255, 255): CONST GhostWhite = 91~%%
    _PALETTECOLOR 92, _RGBA32(255, 215, 0, 255): CONST Gold = 92~%%
    _PALETTECOLOR 93, _RGBA32(218, 165, 32, 255): CONST GoldenRod = 93~%%
    _PALETTECOLOR 94, _RGBA32(168, 228, 160, 255): CONST GrannySmithApple = 94~%%
    _PALETTECOLOR 95, _RGBA32(17, 100, 180, 255): CONST GreenBlue = 95~%%
    _PALETTECOLOR 96, _RGBA32(173, 255, 47, 255): CONST GreenYellow = 96~%%
    _PALETTECOLOR 97, _RGBA32(240, 255, 240, 255): CONST HoneyDew = 97~%%
    _PALETTECOLOR 98, _RGBA32(255, 29, 206, 255): CONST HotMagenta = 98~%%
    _PALETTECOLOR 99, _RGBA32(255, 105, 180, 255): CONST HotPink = 99~%%
    _PALETTECOLOR 100, _RGBA32(178, 236, 93, 255): CONST Inchworm = 100~%%
    _PALETTECOLOR 101, _RGBA32(205, 92, 92, 255): CONST IndianRed = 101~%%
    _PALETTECOLOR 102, _RGBA32(75, 0, 130, 255): CONST Indigo = 102~%%
    _PALETTECOLOR 103, _RGBA32(255, 255, 240, 255): CONST Ivory = 103~%%
    _PALETTECOLOR 104, _RGBA32(202, 55, 103, 255): CONST JazzberryJam = 104~%%
    _PALETTECOLOR 105, _RGBA32(59, 176, 143, 255): CONST JungleGreen = 105~%%
    _PALETTECOLOR 106, _RGBA32(240, 230, 140, 255): CONST Khaki = 106~%%
    _PALETTECOLOR 107, _RGBA32(254, 254, 34, 255): CONST LaserLemon = 107~%%
    _PALETTECOLOR 108, _RGBA32(230, 230, 250, 255): CONST Lavender = 108~%%
    _PALETTECOLOR 109, _RGBA32(255, 240, 245, 255): CONST LavenderBlush = 109~%%
    _PALETTECOLOR 110, _RGBA32(124, 252, 0, 255): CONST LawnGreen = 110~%%
    _PALETTECOLOR 111, _RGBA32(255, 250, 205, 255): CONST LemonChiffon = 111~%%
    _PALETTECOLOR 112, _RGBA32(255, 244, 79, 255): CONST LemonYellow = 112~%%
    _PALETTECOLOR 113, _RGBA32(240, 128, 128, 255): CONST LightCoral = 113~%%
    _PALETTECOLOR 114, _RGBA32(250, 250, 210, 255): CONST LightGoldenRodYellow = 114~%%
    _PALETTECOLOR 115, _RGBA32(211, 211, 211, 255): CONST LightGray = 115~%%
    _PALETTECOLOR 116, _RGBA32(144, 238, 144, 255): CONST LightGreen2 = 116~%%
    _PALETTECOLOR 117, _RGBA32(255, 182, 193, 255): CONST LightPink = 117~%%
    _PALETTECOLOR 118, _RGBA32(255, 160, 122, 255): CONST LightSalmon = 118~%%
    _PALETTECOLOR 119, _RGBA32(32, 178, 170, 255): CONST LightSeaGreen = 119~%%
    _PALETTECOLOR 120, _RGBA32(135, 206, 250, 255): CONST LightSkyBlue = 120~%%
    _PALETTECOLOR 121, _RGBA32(119, 136, 153, 255): CONST LightSlateGray = 121~%%
    _PALETTECOLOR 122, _RGBA32(176, 196, 222, 255): CONST LightSteelBlue = 122~%%
    _PALETTECOLOR 123, _RGBA32(255, 255, 224, 255): CONST LightYellow = 123~%%
    _PALETTECOLOR 124, _RGBA32(0, 255, 0, 255): CONST Lime = 124~%%
    _PALETTECOLOR 125, _RGBA32(50, 205, 50, 255): CONST LimeGreen = 125~%%
    _PALETTECOLOR 126, _RGBA32(250, 240, 230, 255): CONST Linen = 126~%%
    _PALETTECOLOR 127, _RGBA32(255, 189, 136, 255): CONST MacaroniAndCheese = 127~%%
    _PALETTECOLOR 128, _RGBA32(170, 240, 209, 255): CONST MagicMint = 128~%%
    _PALETTECOLOR 129, _RGBA32(205, 74, 76, 255): CONST Mahogany = 129~%%
    _PALETTECOLOR 130, _RGBA32(237, 209, 156, 255): CONST Maize = 130~%%
    _PALETTECOLOR 131, _RGBA32(151, 154, 170, 255): CONST Manatee = 131~%%
    _PALETTECOLOR 132, _RGBA32(255, 130, 67, 255): CONST MangoTango = 132~%%
    _PALETTECOLOR 133, _RGBA32(128, 0, 0, 255): CONST Maroon = 133~%%
    _PALETTECOLOR 134, _RGBA32(239, 152, 170, 255): CONST Mauvelous = 134~%%
    _PALETTECOLOR 135, _RGBA32(102, 205, 170, 255): CONST MediumAquamarine = 135~%%
    _PALETTECOLOR 136, _RGBA32(0, 0, 205, 255): CONST MediumBlue = 136~%%
    _PALETTECOLOR 137, _RGBA32(186, 85, 211, 255): CONST MediumOrchid = 137~%%
    _PALETTECOLOR 138, _RGBA32(147, 112, 219, 255): CONST MediumPurple = 138~%%
    _PALETTECOLOR 139, _RGBA32(60, 179, 113, 255): CONST MediumSeaGreen = 139~%%
    _PALETTECOLOR 140, _RGBA32(123, 104, 238, 255): CONST MediumSlateBlue = 140~%%
    _PALETTECOLOR 141, _RGBA32(0, 250, 154, 255): CONST MediumSpringGreen = 141~%%
    _PALETTECOLOR 142, _RGBA32(72, 209, 204, 255): CONST MediumTurquoise = 142~%%
    _PALETTECOLOR 143, _RGBA32(199, 21, 133, 255): CONST MediumVioletRed = 143~%%
    _PALETTECOLOR 144, _RGBA32(253, 188, 180, 255): CONST Melon = 144~%%
    _PALETTECOLOR 145, _RGBA32(25, 25, 112, 255): CONST MidnightBlue = 145~%%
    _PALETTECOLOR 146, _RGBA32(245, 255, 250, 255): CONST MintCream = 146~%%
    _PALETTECOLOR 147, _RGBA32(255, 228, 225, 255): CONST MistyRose = 147~%%
    _PALETTECOLOR 148, _RGBA32(255, 228, 181, 255): CONST Moccasin = 148~%%
    _PALETTECOLOR 149, _RGBA32(48, 186, 143, 255): CONST MountainMeadow = 149~%%
    _PALETTECOLOR 150, _RGBA32(197, 75, 140, 255): CONST Mulberry = 150~%%
    _PALETTECOLOR 151, _RGBA32(255, 222, 173, 255): CONST NavajoWhite = 151~%%
    _PALETTECOLOR 152, _RGBA32(0, 0, 128, 255): CONST Navy = 152~%%
    _PALETTECOLOR 153, _RGBA32(25, 116, 210, 255): CONST NavyBlue = 153~%%
    _PALETTECOLOR 154, _RGBA32(255, 163, 67, 255): CONST NeonCarrot = 154~%%
    _PALETTECOLOR 155, _RGBA32(253, 245, 230, 255): CONST OldLace = 155~%%
    _PALETTECOLOR 156, _RGBA32(128, 128, 0, 255): CONST Olive = 156~%%
    _PALETTECOLOR 157, _RGBA32(107, 142, 35, 255): CONST OliveDrab = 157~%%
    _PALETTECOLOR 158, _RGBA32(186, 184, 108, 255): CONST OliveGreen = 158~%%
    _PALETTECOLOR 159, _RGBA32(255, 165, 0, 255): CONST Orange = 159~%%
    _PALETTECOLOR 160, _RGBA32(255, 69, 0, 255): CONST OrangeRed = 160~%%
    _PALETTECOLOR 161, _RGBA32(248, 213, 104, 255): CONST OrangeYellow = 161~%%
    _PALETTECOLOR 162, _RGBA32(218, 112, 214, 255): CONST Orchid = 162~%%
    _PALETTECOLOR 163, _RGBA32(65, 74, 76, 255): CONST OuterSpace = 163~%%
    _PALETTECOLOR 164, _RGBA32(255, 110, 74, 255): CONST OutrageousOrange = 164~%%
    _PALETTECOLOR 165, _RGBA32(28, 169, 201, 255): CONST PacificBlue = 165~%%
    _PALETTECOLOR 166, _RGBA32(238, 232, 170, 255): CONST PaleGoldenRod = 166~%%
    _PALETTECOLOR 167, _RGBA32(152, 251, 152, 255): CONST PaleGreen = 167~%%
    _PALETTECOLOR 168, _RGBA32(175, 238, 238, 255): CONST PaleTurquoise = 168~%%
    _PALETTECOLOR 169, _RGBA32(219, 112, 147, 255): CONST PaleVioletRed = 169~%%
    _PALETTECOLOR 170, _RGBA32(255, 239, 213, 255): CONST PapayaWhip = 170~%%
    _PALETTECOLOR 171, _RGBA32(255, 207, 171, 255): CONST Peach = 171~%%
    _PALETTECOLOR 172, _RGBA32(255, 218, 185, 255): CONST PeachPuff = 172~%%
    _PALETTECOLOR 173, _RGBA32(197, 208, 230, 255): CONST Periwinkle = 173~%%
    _PALETTECOLOR 174, _RGBA32(205, 133, 63, 255): CONST Peru = 174~%%
    _PALETTECOLOR 175, _RGBA32(253, 221, 230, 255): CONST PiggyPink = 175~%%
    _PALETTECOLOR 176, _RGBA32(21, 128, 120, 255): CONST PineGreen = 176~%%
    _PALETTECOLOR 177, _RGBA32(255, 192, 203, 255): CONST Pink = 177~%%
    _PALETTECOLOR 178, _RGBA32(252, 116, 253, 255): CONST PinkFlamingo = 178~%%
    _PALETTECOLOR 179, _RGBA32(247, 143, 167, 255): CONST PinkSherbet = 179~%%
    _PALETTECOLOR 180, _RGBA32(221, 160, 221, 255): CONST Plum = 180~%%
    _PALETTECOLOR 181, _RGBA32(176, 224, 230, 255): CONST PowderBlue = 181~%%
    _PALETTECOLOR 182, _RGBA32(128, 0, 128, 255): CONST Purple = 182~%%
    _PALETTECOLOR 183, _RGBA32(116, 66, 200, 255): CONST PurpleHeart = 183~%%
    _PALETTECOLOR 184, _RGBA32(157, 129, 186, 255): CONST PurpleMountainsMajesty = 184~%%
    _PALETTECOLOR 185, _RGBA32(254, 78, 218, 255): CONST PurplePizzazz = 185~%%
    _PALETTECOLOR 186, _RGBA32(255, 73, 108, 255): CONST RadicalRed = 186~%%
    _PALETTECOLOR 187, _RGBA32(214, 138, 89, 255): CONST RawSienna = 187~%%
    _PALETTECOLOR 188, _RGBA32(113, 75, 35, 255): CONST RawUmber = 188~%%
    _PALETTECOLOR 189, _RGBA32(255, 72, 208, 255): CONST RazzleDazzleRose = 189~%%
    _PALETTECOLOR 190, _RGBA32(227, 37, 107, 255): CONST Razzmatazz = 190~%%
    _PALETTECOLOR 191, _RGBA32(255, 83, 73, 255): CONST RedOrange = 191~%%
    _PALETTECOLOR 192, _RGBA32(192, 68, 143, 255): CONST RedViolet = 192~%%
    _PALETTECOLOR 193, _RGBA32(31, 206, 203, 255): CONST RobinsEggBlue = 193~%%
    _PALETTECOLOR 194, _RGBA32(188, 143, 143, 255): CONST RosyBrown = 194~%%
    _PALETTECOLOR 195, _RGBA32(65, 105, 225, 255): CONST RoyalBlue = 195~%%
    _PALETTECOLOR 196, _RGBA32(120, 81, 169, 255): CONST RoyalPurple = 196~%%
    _PALETTECOLOR 197, _RGBA32(139, 69, 19, 255): CONST SaddleBrown = 197~%%
    _PALETTECOLOR 198, _RGBA32(250, 128, 114, 255): CONST Salmon = 198~%%
    _PALETTECOLOR 199, _RGBA32(244, 164, 96, 255): CONST SandyBrown = 199~%%
    _PALETTECOLOR 200, _RGBA32(252, 40, 71, 255): CONST Scarlet = 200~%%
    _PALETTECOLOR 201, _RGBA32(118, 255, 122, 255): CONST ScreaminGreen = 201~%%
    _PALETTECOLOR 202, _RGBA32(46, 139, 87, 255): CONST SeaGreen = 202~%%
    _PALETTECOLOR 203, _RGBA32(255, 245, 238, 255): CONST SeaShell = 203~%%
    _PALETTECOLOR 204, _RGBA32(165, 105, 79, 255): CONST Sepia = 204~%%
    _PALETTECOLOR 205, _RGBA32(138, 121, 93, 255): CONST Shadow = 205~%%
    _PALETTECOLOR 206, _RGBA32(69, 206, 162, 255): CONST Shamrock = 206~%%
    _PALETTECOLOR 207, _RGBA32(251, 126, 253, 255): CONST ShockingPink = 207~%%
    _PALETTECOLOR 208, _RGBA32(160, 82, 45, 255): CONST Sienna = 208~%%
    _PALETTECOLOR 209, _RGBA32(192, 192, 192, 255): CONST Silver = 209~%%
    _PALETTECOLOR 210, _RGBA32(135, 206, 235, 255): CONST SkyBlue = 210~%%
    _PALETTECOLOR 211, _RGBA32(106, 90, 205, 255): CONST SlateBlue = 211~%%
    _PALETTECOLOR 212, _RGBA32(112, 128, 144, 255): CONST SlateGray = 212~%%
    _PALETTECOLOR 213, _RGBA32(255, 250, 250, 255): CONST Snow = 213~%%
    _PALETTECOLOR 214, _RGBA32(0, 255, 127, 255): CONST SpringGreen = 214~%%
    _PALETTECOLOR 215, _RGBA32(70, 130, 180, 255): CONST SteelBlue = 215~%%
    _PALETTECOLOR 216, _RGBA32(255, 207, 72, 255): CONST Sunglow = 216~%%
    _PALETTECOLOR 217, _RGBA32(253, 94, 83, 255): CONST SunsetOrange = 217~%%
    _PALETTECOLOR 218, _RGBA32(210, 180, 140, 255): CONST Tann = 218~%%
    _PALETTECOLOR 219, _RGBA32(0, 128, 128, 255): CONST Teal = 219~%%
    _PALETTECOLOR 220, _RGBA32(24, 167, 181, 255): CONST TealBlue = 220~%%
    _PALETTECOLOR 221, _RGBA32(216, 191, 216, 255): CONST Thistle = 221~%%
    _PALETTECOLOR 222, _RGBA32(252, 137, 172, 255): CONST TickleMePink = 222~%%
    _PALETTECOLOR 223, _RGBA32(219, 215, 210, 255): CONST Timberwolf = 223~%%
    _PALETTECOLOR 224, _RGBA32(255, 99, 71, 255): CONST Tomato = 224~%%
    _PALETTECOLOR 225, _RGBA32(23, 128, 109, 255): CONST TropicalRainForest = 225~%%
    _PALETTECOLOR 226, _RGBA32(222, 170, 136, 255): CONST Tumbleweed = 226~%%
    _PALETTECOLOR 227, _RGBA32(64, 224, 208, 255): CONST Turquoise = 227~%%
    _PALETTECOLOR 228, _RGBA32(119, 221, 231, 255): CONST TurquoiseBlue = 228~%%
    _PALETTECOLOR 229, _RGBA32(255, 255, 102, 255): CONST UnmellowYellow = 229~%%
    _PALETTECOLOR 230, _RGBA32(238, 130, 238, 255): CONST Violet = 230~%%
    _PALETTECOLOR 231, _RGBA32(50, 74, 178, 255): CONST VioletBlue = 231~%%
    _PALETTECOLOR 232, _RGBA32(247, 83, 148, 255): CONST VioletRed = 232~%%
    _PALETTECOLOR 233, _RGBA32(255, 160, 137, 255): CONST VividTangerine = 233~%%
    _PALETTECOLOR 234, _RGBA32(143, 80, 157, 255): CONST VividViolet = 234~%%
    _PALETTECOLOR 235, _RGBA32(245, 222, 179, 255): CONST Wheat = 235~%%
    _PALETTECOLOR 236, _RGBA32(245, 245, 245, 255): CONST Whitesmoke = 236~%%
    _PALETTECOLOR 237, _RGBA32(162, 173, 208, 255): CONST WildBlueYonder = 237~%%
    _PALETTECOLOR 238, _RGBA32(255, 67, 164, 255): CONST WildStrawberry = 238~%%
    _PALETTECOLOR 239, _RGBA32(252, 108, 133, 255): CONST WildWatermelon = 239~%%
    _PALETTECOLOR 240, _RGBA32(205, 164, 222, 255): CONST Wisteria = 240~%%
    _PALETTECOLOR 241, _RGBA32(154, 205, 50, 255): CONST YellowGreen = 241~%%
    _PALETTECOLOR 242, _RGBA32(255, 174, 66, 255): CONST YellowOrange = 242~%%
$END IF
 
 
 
''$INCLUDE:'LinkedList.BI
 
CONST True = -1, False = 0
CONST Left = 1, Right = 2, Middle = 3, Center = 3
CONST None = 0, Alpha = 1, Numeric = 2, NoCase = 4, Reverse = 8
CONST LeftClick = 1, RightClick = 2, LeftDown = 4, RightDown = 8, Hover = 16
 
TYPE MenuType
    Valid AS _BYTE
    Visible AS _BYTE
    ScrollBarHidden AS _BYTE
    Top AS INTEGER
    Left AS INTEGER
    Width AS INTEGER
    Height AS INTEGER
    Frame AS _BYTE
    BorderColor AS _UNSIGNED LONG
    BackgroundColor AS _UNSIGNED LONG
    Header AS _BYTE
    Caption AS STRING * 255
    CC AS _UNSIGNED LONG 'caption color
    CBG AS _UNSIGNED LONG 'caption background color
    HighLightColor AS _UNSIGNED LONG
    Exit AS _BYTE
    Entries AS INTEGER
    TopEntry AS INTEGER
    ListColor AS _UNSIGNED LONG
    ListBackground AS _UNSIGNED LONG
    ListJustify AS _BYTE
END TYPE
 
DIM SHARED MenusActive AS LONG
REDIM SHARED Menu(10) AS MenuType
REDIM SHARED MenuList(32767, 10) AS STRING 'Up to 32,767 items max in our list.
REDIM SHARED MenuListDisabled(32767, 10) AS _BYTE
REDIM SHARED MenuDisplayOrder(32767, 10) AS INTEGER
TYPE LinkType
    one AS LONG
    another AS LONG
END TYPE
REDIM SHARED LinkedTo(1000) AS LinkType
DIM SHARED ScrollDelay AS _FLOAT
DIM SHARED MouseScroll AS INTEGER
 
'Before here goes BI file content
'After here goes working program
 
DEFLNG A-Z
SCREEN _NEWIMAGE(800, 600, 32)
_SCREENMOVE _MIDDLE
 
MainMenu = GetMenuHandle
SetMenuSize MainMenu, 200, 150
SetMenuPosition MainMenu, 100, 100
SetMenuFrame MainMenu, True, Red, Yellow
SetMenuVisible MainMenu, True
SetMenuCaption MainMenu, True, "Name", Black, White, True
SetMenuListProperties MainMenu, Black, 0, Center 'Right 'Left
SetMenuHighLightColor MainMenu, Red
FOR i = 1 TO 23
    READ n$
    AddMenuItem MainMenu, n$
NEXT
 
DATA Steve,Pete,Bob,Joe,Fred
DATA Sam,One,Two,Three,Four
DATA Five,Six,Seven,Eight,Nine
DATA These,are,all,my,names
DATA "Aren't",they,grand
 
SecondMenu = GetMenuHandle
SetMenuSize SecondMenu, 100, 150
SetMenuPosition SecondMenu, 300, 100
SetMenuFrame SecondMenu, True, Red, Yellow
SetMenuVisible SecondMenu, True
SetMenuCaption SecondMenu, True, "Age", Black, White, True
SetMenuListProperties SecondMenu, Black, 0, Left
SetMenuHighLightColor SecondMenu, Red
 
FOR i = 1 TO 23
    READ n$
    AddMenuItem SecondMenu, n$
NEXT
 
DATA 12,23,34,45,56
DATA 67,78,89,90,1
DATA 9,98,87,76,65
DATA 54,43,32,21,10
DATA 42,55,12
 
sortmode = 0: linked = -1: menuon = 1
 
HideMenuScrollBar MainMenu
LinkMenus MainMenu, SecondMenu
 
DisableItem MainMenu, 5
ScrollDelay = .25
DO
    CLS
    LOCATE 20, 1: PRINT "Press <H> to hide the menu."
    PRINT "Press <S> to show the menu."
    PRINT "Press <N> for No Sort order."
    PRINT "Press <A> for Alphabetic Sort order."
    PRINT "Press <#> for Numeric Sort order."
    PRINT "Press <C> to toggle case sorting."
    PRINT "Press <R> to toggle reverse sorting."
    PRINT "Press <L> to link the menus."
    PRINT "Press <U> to unlink the menus."
    PRINT "Press <TAB> to swap between menus."
    PRINT "<ESC> to quit"
    PRINT
    PRINT "Currently: ";
    IF sortmode AND 1 THEN
        PRINT "ALPHA SORT";
        IF kase THEN PRINT ", CASE-SENSITIVE";
        IF reversed THEN PRINT ", REVERSE-ORDER" ELSE PRINT
    ELSEIF sortmode AND 2 THEN
        PRINT "NUMERIC SORT";
        IF reversed THEN PRINT ", REVERSE-ORDER" ELSE PRINT
    ELSE
        PRINT "NOT SORTING"
    END IF
    LOCATE 5, 25
    IF linked THEN PRINT "LINKED LISTS" ELSE PRINT "UNLINKED LISTS"
    LOCATE 6, 15: PRINT "MENU ASSOCIATED WITH KEYBOARD: "; menuon
 
    MouseScroll = 0
    WHILE _MOUSEINPUT
        MouseScroll = MouseScroll + _MOUSEWHEEL
    WEND
 
    k = _KEYHIT
    SELECT CASE k
        CASE ASC("L"), ASC("l"): LinkMenus MainMenu, SecondMenu: linked = -1
        CASE ASC("U"), ASC("u"): UnLinkMenus MainMenu, SecondMenu: linked = 0
        CASE ASC("H"), ASC("h"): HideMenu menuon
        CASE ASC("S"), ASC("s"): ShowMenu menuon
        CASE ASC("N"), ASC("n"): sortmode = None: changed = -1: reversed = 0: kase = 0
        CASE ASC("A"), ASC("a"): sortmode = Alpha: changed = -1
        CASE ASC("#"), ASC("3"): sortmode = Numeric: changed = -1
        CASE ASC("C"), ASC("c"): kase = NOT kase: changed = -1
        CASE ASC("R"), ASC("r"): reversed = NOT reversed: changed = -1
        CASE 9: menuon = menuon + 1: IF menuon = 3 THEN menuon = 1
        CASE 27: SYSTEM
    END SELECT
    IF changed THEN
        IF sortmode <> 0 THEN
            IF kase THEN sortmode = sortmode OR NoCase ELSE sortmode = sortmode AND NOT NoCase
            IF reversed THEN sortmode = sortmode OR Reverse ELSE sortmode = sortmode AND NOT Reverse
        END IF
        MenuDisplaySort menuon, sortmode
        changed = 0
    END IF
    DisplayMenus
    CheckMenus MouseStatus, MenuSelected, OptionSelected
    IF MouseStatus <> 0 AND MenuSelected <> 0 THEN
        IF MouseStatus AND LeftClick THEN
            LOCATE 1, 1
            PRINT "You LEFT CLICKED Option #"; OptionSelected; " in Menu #"; MenuSelected
            PRINT "Which was: "; GetListItem(MenuSelected, OptionSelected)
            PRINT
            IF linked THEN
                PRINT "Since our lists are linked, we get the following items:"; GetListItem(1, OptionSelected), GetListItem(2, OptionSelected)
            ELSE
                PRINT "Since our lists are unlinked, we get the following items:"; GetListItem(MenuSelected, OptionSelected)
            END IF
            _DISPLAY
            _DELAY 2 'give it time to pop up
        ELSEIF MouseStatus AND RightClick THEN
            LOCATE 1, 1
            PRINT "You RIGHT CLICKED Option #"; OptionSelected; " in Menu #"; MenuSelected
            PRINT "Which was: "; GetListItem(MenuSelected, OptionSelected)
            PRINT
            IF linked THEN
                PRINT "Since our lists are linked, we get the following items:"; GetListItem(1, OptionSelected), GetListItem(2, OptionSelected)
            ELSE
                PRINT "Since our lists are unlinked, we get the following items:"; GetListItem(MenuSelected, OptionSelected)
            END IF
            _DISPLAY
            _DELAY 2 'give it time to pop up
        END IF
        COLOR Yellow
        IF MouseStatus AND LeftDown THEN LOCATE 35, 1: PRINT "LEFT MOUSE DOWN over Option #"; OptionSelected; " in Menu #"; MenuSelected
        IF MouseStatus AND RightDown THEN LOCATE 35, 1: PRINT "RIGHT MOUSE DOWN over Option #"; OptionSelected; " in Menu #"; MenuSelected
        COLOR Purple
        IF MouseStatus AND Hover THEN LOCATE 36, 1: PRINT "HOVERING over Option #"; OptionSelected; " in Menu #"; MenuSelected;
        COLOR White
 
    END IF
    _LIMIT 30
    _DISPLAY
LOOP
 
 
 
 
 
 
''$INCLUDE:'LinkedList.BM'
 
'And here goes the BM routines
 
 
 
SUB LinkMenus (handle1, handle2)
    IF handle1 = 0 OR handle2 = 0 THEN ERROR 5: EXIT SUB
    IF handle1 = handle2 THEN EXIT SUB 'Why the heck are we linking one list to itself?!
    IF Menu(handle1).Valid AND Menu(handle2).Valid THEN
        LinkMax = LinkedTo(0).one 'I'm using the very first entry into my array to store the number of link entries I have
        'First check to see if the two menus are already linked
        FOR i = 1 TO LinkMax
            found = 0
            IF handle1 = LinkedTo(i).one OR handle1 = LinkedTo(i).another THEN found = found + 1
            IF handle2 = LinkedTo(i).one OR handle2 = LinkedTo(i).another THEN found = found + 1
            IF found = 2 THEN EXIT SUB 'the two lists are already linked
            IF handle1 = 0 AND handle2 = 0 AND openspot = 0 THEN openspot = i 'we found a spot where a link was freed before; let's use it
        NEXT
        MenuDisplaySort handle1, None: MenuDisplaySort handle2, None 'unsort the lists to begin with.
        Menu(handle1).TopEntry = 1: Menu(handle2).TopEntry = 1 'and then reset them to their topmost position
 
        IF openspot THEN
            LinkedTo(openspot).one = handle1
            LinkedTo(openspot).another = handle2
        ELSE
            LinkMax = LinkMax + 1: LinkedTo(0).one = LinkMax
            LinkedTo(LinkMax).one = handle1
            LinkedTo(LinkMax).another = handle2
        END IF
    ELSE
        ERROR 5
    END IF
END SUB
 
SUB UnLinkMenus (handle1, handle2)
    IF handle1 = 0 OR handle2 = 0 THEN ERROR 5: EXIT SUB 'no list should be linked to 0.  0 is nothing...  Can't free a link to nothing.
    IF handle1 = handle2 THEN EXIT SUB 'We can't unlink a list from itself!
    IF Menu(handle1).Valid AND Menu(handle2).Valid THEN
        FOR i = 1 TO LinkedTo(0).one
            IF handle1 = LinkedTo(i).one OR handle1 = LinkedTo(i).another THEN found = found + 1
            IF handle2 = LinkedTo(i).one OR handle2 = LinkedTo(i).another THEN found = found + 1
            IF found = 2 THEN LinkedTo(i).one = 0: LinkedTo(i).another = 0 'unlink them!
        NEXT
    ELSE
        ERROR 5
    END IF
END SUB
 
SUB DisableItem (handle, item)
    IF Menu(handle).Valid THEN MenuListDisabled(item, handle) = -1 ELSE ERROR 5
END SUB
 
SUB EnableItem (handle, item)
    IF Menu(handle).Valid THEN MenuListDisabled(item, handle) = 0 ELSE ERROR 5
END SUB
 
SUB ShowMenu (Handle)
    IF Menu(Handle).Valid THEN Menu(Handle).Visible = -1 ELSE ERROR 5
END SUB
 
SUB HideMenu (Handle)
    IF Menu(Handle).Valid THEN Menu(Handle).Visible = 0 ELSE ERROR 5
END SUB
 
SUB ShowMenuScrollBar (Handle)
    IF Menu(Handle).Valid THEN Menu(Handle).ScrollBarHidden = 0 ELSE ERROR 5
END SUB
 
SUB HideMenuScrollBar (Handle)
    IF Menu(Handle).Valid THEN Menu(Handle).ScrollBarHidden = -1 ELSE ERROR 5
END SUB
 
 
 
FUNCTION GetListItem$ (Handle, Item)
    IF Menu(Handle).Valid THEN
        IF Item < 0 OR Item > Menu(Handle).Entries THEN ERROR 5: EXIT SUB
        GetListItem$ = LTRIM$(RTRIM$(MenuList(Item, Handle)))
    ELSE
        ERROR 5
    END IF
END FUNCTION
 
 
 
SUB AddMenuItem (Handle, Item$)
    IF Menu(Handle).Valid THEN
        Menu(Handle).Entries = Menu(Handle).Entries + 1
        MenuList(Menu(Handle).Entries, Handle) = Item$
        MenuDisplayOrder(Menu(Handle).Entries, Handle) = Menu(Handle).Entries
    ELSE
        ERROR 5
    END IF
END SUB
 
 
SUB SetMenuListProperties (Handle, ListColor AS _UNSIGNED LONG, ListBackground AS _UNSIGNED LONG, ListJustify AS _BYTE)
    IF Menu(Handle).Valid THEN
        Menu(Handle).ListColor = ListColor
        Menu(Handle).ListBackground = ListBackground
        Menu(Handle).ListJustify = ListJustify
    ELSE
        ERROR 5
    END IF
END SUB
 
SUB SetMenuHighLightColor (Handle, HighLightColor AS _UNSIGNED LONG)
    IF Menu(Handle).Valid THEN
        Menu(Handle).HighLightColor = HighLightColor
    ELSE
        ERROR 5
    END IF
END SUB
 
 
SUB SetMenuCaption (Handle, Header, Caption AS STRING * 255, CaptionColor AS _UNSIGNED LONG, CaptionBackground AS _UNSIGNED LONG, Xit)
    IF Menu(Handle).Valid THEN
        Menu(Handle).Header = Header
        Menu(Handle).Caption = Caption
        Menu(Handle).CC = CaptionColor
        Menu(Handle).CBG = CaptionBackground
        Menu(Handle).Exit = Xit
    ELSE
        ERROR 5
    END IF
END SUB
 
 
SUB SetMenuFrame (Handle, HaveFrame, FrameColor AS _UNSIGNED LONG, FrameBackGround AS _UNSIGNED LONG)
    IF Menu(Handle).Valid THEN
        Menu(Handle).Frame = HaveFrame
        Menu(Handle).BorderColor = FrameColor
        Menu(Handle).BackgroundColor = FrameBackGround
    ELSE
        ERROR 5
    END IF
END SUB
 
 
 
SUB SetMenuPosition (Handle, Left, Top)
    IF Menu(Handle).Valid THEN
        'some basic error checking
        IF Top < 0 THEN ERROR 5: EXIT SUB 'Let's try and keep the menu on the screen, why don't we
        IF Left < 0 THEN ERROR 5: EXIT SUB
        IF Left > _WIDTH THEN ERROR 5: EXIT SUB
        IF Top > _HEIGHT THEN ERROR 5: EXIT SUB
        Menu(Handle).Left = Left
        Menu(Handle).Top = Top
    ELSE
        ERROR 5 'toss a generic error if the handle is bad
        'I can add a custom error pop up routine later with appropiate messages
    END IF
END SUB
 
 
SUB SetMenuVisible (Handle, Visible)
    IF Menu(Handle).Valid THEN Menu(Handle).Visible = Visible ELSE ERROR 5
END SUB
 
SUB SetMenuSize (Handle, Width, Height)
    IF Menu(Handle).Valid THEN
        'some basic error checking
        IF Width < _FONTWIDTH THEN ERROR 5: EXIT SUB 'Can't we at least make a menu which will hold a single character?!
        IF Height < _FONTHEIGHT THEN ERROR 5: EXIT SUB
        IF Width > _WIDTH THEN ERROR 5: EXIT SUB 'And let's not make it generally larger than our screen, why don't we?!
        IF Height > _HEIGHT THEN ERROR 5: EXIT SUB
        Menu(Handle).Width = Width
        Menu(Handle).Height = Height
    ELSE
        ERROR 5 'toss a generic error if the handle is bad
        'I can add a custom error pop up routine later with appropiate messages
    END IF
END SUB
 
FUNCTION GetMenuHandle&
    FOR i = 1 TO MenusActive
        IF Menu(i).Valid = 0 THEN found = i: EXIT FOR
    NEXT
    IF NOT found THEN
        MenusActive = MenusActive + 1
        found = MenusActive
        u = UBOUND(menu)
        DO UNTIL MenusActive < u
            REDIM _PRESERVE Menu(u + 10) AS MenuType
            REDIM _PRESERVE MenuList(32767, u + 10) AS STRING
            REDIM _PRESERVE MenuDisplayOrder(32767, u + 10) AS INTEGER
            REDIM _PRESERVE MenuListDisabled(32767, u + 10) AS _BYTE
            u = UBOUND(menu)
        LOOP
    END IF
    GetMenuHandle& = found
    Menu(found).Valid = -1 'and let's make this a valid handle
END FUNCTION
 
 
SUB CheckMenus (MouseStatus AS LONG, MenuSelected AS LONG, OptionSelected AS LONG)
 
    MenuSelected = 0: OptionSelected = 0
    FOR i = 1 TO MenusActive
        IF Menu(i).Visible AND Menu(i).Valid THEN
            IF startnum = 0 THEN startnum = i
            ProcessMenu i, startnum, MouseStatus, MenuSelected, OptionSelected
            IF MenuSelected THEN EXIT SUB
        END IF
    NEXT
END SUB
 
 
SUB DisplayMenus
    FC = _DEFAULTCOLOR: BG = _BACKGROUNDCOLOR
    FOR Whichone = 1 TO MenusActive
        IF Menu(Whichone).Visible THEN
            'Get the starting limits of where menu/list text can appear
            x1 = Menu(Whichone).Left: x2 = x1 + Menu(Whichone).Width
            y1 = Menu(Whichone).Top: y2 = Menu(Whichone).Top + Menu(Whichone).Height
            caption$ = LTRIM$(RTRIM$(Menu(Whichone).Caption)) 'strip unneeded spaces from the caption (WhichOnef any)
 
            'clear the background
            LINE (Menu(Whichone).Left, Menu(Whichone).Top)-STEP(Menu(Whichone).Width, Menu(Whichone).Height), Menu(Whichone).BackgroundColor, BF
            'draw the frame; adjust text limits
            IF Menu(Whichone).Frame THEN
                LINE (Menu(Whichone).Left, Menu(Whichone).Top)-STEP(Menu(Whichone).Width, Menu(Whichone).Height), Menu(Whichone).BorderColor, B
                x1 = x1 + 1: y1 = y1 + 1
                x2 = x2 - 1: y2 = y2 - 1
            END IF
            IF Menu(Whichone).Header THEN
                temp = x2 - x1 + 1
                LINE (x1, y1)-(x2, y1 + _FONTHEIGHT), Menu(Whichone).CBG, BF
                IF Menu(Whichone).Exit THEN
                    temp = temp - _FONTWIDTH * 2
                    ex1 = x2 - 1 - _FONTWIDTH: ex2 = ex1 + _FONTWIDTH
                    ey1 = y1 + 1: ey2 = ey1 + _FONTHEIGHT - 3
                    LINE (ex1, ey1)-(ex2, ey2), Red, BF
                    LINE (ex1, ey1)-(ex2, ey2), Black
                    LINE (ex1, ey2)-(ex2, ey1), Black
                END IF
                DO UNTIL _PRINTWIDTH(caption$) <= temp
                    caption$ = LEFT$(caption$, LEN(caption$) - 1)
                LOOP
                COLOR Menu(Whichone).CC, Menu(Whichone).CBG
                _PRINTSTRING (x1 + (temp - _PRINTWIDTH(caption$)) \ 2, y1), caption$
                y1 = y1 + _FONTHEIGHT
                IF Menu(Whichone).Frame THEN
                    LINE (x1, y1)-(x2, y1), Menu(Whichone).BorderColor
                    y1 = y1 + 2
                END IF
            END IF 'end header creation
 
            IF Menu(Whichone).Entries > 0 THEN 'We have items in our list to display!
                IF Menu(Whichone).TopEntry < 1 THEN Menu(Whichone).TopEntry = 1 'check to make certain we're displaying from the first entry on at least
                IF Menu(Whichone).TopEntry > Menu(Whichone).Entries THEN Menu(Whichone).TopEntry = Menu(Whichone).Entries
                printlimit = (x2 - x1 + 1) \ _FONTWIDTH
                limitfound = 1 + (y2 - y1 + 1) \ _FONTHEIGHT - 1
                IF limitfound > Menu(Whichone).Entries THEN
                    limitfound = Menu(Whichone).Entries
                ELSE
                    scrollneeded = -1
                    printlimit = printlimit - 1
                END IF
                COLOR Menu(Whichone).ListColor, Menu(Whichone).ListBackground
                IF Menu(Whichone).ScrollBarHidden = -1 THEN scrollneeded = 0
                DIM r AS _UNSIGNED _BYTE, g AS _UNSIGNED _BYTE, b AS _UNSIGNED _BYTE
                DIM CC AS INTEGER
 
                r = _RED32(Menu(Whichone).BackgroundColor)
                g = _GREEN32(Menu(Whichone).BackgroundColor)
                b = _BLUE32(Menu(Whichone).BackgroundColor)
                Fade& = _RGBA32(r, g, b, 180)
 
                SELECT CASE Menu(Whichone).ListJustify
                    CASE Left
                        FOR j = 1 TO limitfound
                            CC = MenuDisplayOrder(Menu(Whichone).TopEntry + j - 1, Whichone) 'currentchoice
                            graybox = 0
                            t$ = RTRIM$(LTRIM$(MenuList(CC, Whichone)))
                            IF MenuListDisabled(CC, Whichone) THEN graybox = -1
                            FOR ii = 1 TO LinkedTo(0).one
                                IF Whichone = LinkedTo(ii).one AND MenuListDisabled(CC, LinkedTo(ii).another) THEN graybox = -1
                                IF Whichone = LinkedTo(ii).another AND MenuListDisabled(CC, LinkedTo(ii).one) THEN graybox = -1
                            NEXT
                            t$ = LEFT$(t$, printlimit)
                            _PRINTSTRING (x1, y1 + (j - 1) * _FONTHEIGHT), t$
                            IF graybox THEN LINE (x1, y1 + (j - 1) * _FONTHEIGHT)-(x2, y1 + (j) * _FONTHEIGHT), Fade&, BF
                        NEXT
                    CASE Right
                        FOR j = 1 TO limitfound
                            CC = MenuDisplayOrder(Menu(Whichone).TopEntry + j - 1, Whichone) 'currentchoice
                            graybox = 0
                            t$ = RTRIM$(LTRIM$(MenuList(MenuDisplayOrder(Menu(Whichone).TopEntry + j - 1, Whichone), Whichone)))
                            IF MenuListDisabled(CC, Whichone) THEN graybox = -1
                            FOR ii = 1 TO LinkedTo(0).one
                                IF Whichone = LinkedTo(ii).one AND MenuListDisabled(CC, LinkedTo(ii).another) THEN graybox = -1
                                IF Whichone = LinkedTo(ii).another AND MenuListDisabled(CC, LinkedTo(ii).one) THEN graybox = -1
                            NEXT
 
                            t$ = LTRIM$(LEFT$(t$, printlimit))
                            p = _PRINTWIDTH(t$)
                            IF scrollneeded THEN
                                _PRINTSTRING (x2 - p - _FONTWIDTH, y1 + (j - 1) * _FONTHEIGHT), t$
                            ELSE
                                _PRINTSTRING (x2 - p, y1 + (j - 1) * _FONTHEIGHT), t$
                            END IF
                            IF graybox THEN LINE (x1, y1 + (j - 1) * _FONTHEIGHT)-(x2, y1 + (j) * _FONTHEIGHT), Fade&, BF
                        NEXT
                    CASE Center
                        FOR j = 1 TO limitfound
                            CC = MenuDisplayOrder(Menu(Whichone).TopEntry + j - 1, Whichone) 'currentchoice
                            graybox = 0
                            t$ = LTRIM$(MenuList(MenuDisplayOrder(Menu(Whichone).TopEntry + j - 1, Whichone), Whichone))
                            IF MenuListDisabled(CC, Whichone) THEN graybox = -1
                            FOR ii = 1 TO LinkedTo(0).one
                                IF Whichone = LinkedTo(ii).one AND MenuListDisabled(CC, LinkedTo(ii).another) THEN graybox = -1
                                IF Whichone = LinkedTo(ii).another AND MenuListDisabled(CC, LinkedTo(ii).one) THEN graybox = -1
                            NEXT
                            t$ = LTRIM$(RTRIM$(LEFT$(t$, printlimit)))
                            p = _PRINTWIDTH(t$)
                            _PRINTSTRING ((x2 - x1 + 1) - p \ 2, y1 + (j - 1) * _FONTHEIGHT), t$
                            IF graybox THEN LINE (x1, y1 + (j - 1) * _FONTHEIGHT)-(x2, y1 + (j) * _FONTHEIGHT), Fade&, BF
                        NEXT
                    CASE ELSE
                        FOR j = 1 TO limitfound
                            CC = MenuDisplayOrder(Menu(Whichone).TopEntry + j - 1, Whichone) 'currentchoice
                            graybox = 0
                            t$ = RTRIM$(LTRIM$(MenuList(CC, Whichone)))
                            IF MenuListDisabled(CC, Whichone) THEN graybox = -1
                            FOR ii = 1 TO LinkedTo(0).one
                                IF Whichone = LinkedTo(ii).one AND MenuListDisabled(CC, LinkedTo(ii).another) THEN graybox = -1
                                IF Whichone = LinkedTo(ii).another AND MenuListDisabled(CC, LinkedTo(ii).one) THEN graybox = -1
                            NEXT
                            t$ = LEFT$(t$, printlimit)
                            _PRINTSTRING (x1, y1 + (j - 1) * _FONTHEIGHT), t$
                            IF graybox THEN LINE (x1, y1 + (j - 1) * _FONTHEIGHT)-(x2, y1 + (j) * _FONTHEIGHT), Fade&, BF
                        NEXT
                        Menu(Whichone).ListJustify = Left 'If it's not specified for some reason, let's make it left justified as default
                END SELECT
            END IF 'end of displaying items
            IF scrollneeded THEN 'then we need a vertical scroll bar
                barx1 = x2 - _FONTWIDTH - 1
                barx2 = barx1 + _FONTWIDTH
                LINE (barx1, y1)-(barx2, y2), LightGray, BF
                COLOR Black, DarkGray
                _PRINTSTRING (barx1, y1), ""
                _PRINTSTRING (barx1, y2 - _FONTHEIGHT), ""
            END IF
        END IF
    NEXT
    COLOR FC, BG
END SUB
 
 
 
SUB ProcessMenu (WhichOne AS LONG, StartNum AS LONG, MouseStatus AS LONG, MenuSelected AS LONG, OptionSelected AS LONG)
    STATIC OldMouse AS _BYTE, ElapsedTimer AS _FLOAT, Click AS _BYTE
    STATIC ScrollAble AS _BYTE, OldMouse2 AS _BYTE, Click2 AS _BYTE
    MX = _MOUSEX: MY = _MOUSEY: MB = _MOUSEBUTTON(1): MB2 = _MOUSEBUTTON(2)
    IF ScrollDelay < 0 THEN ScrollDelay = 0
 
    'Get the starting limits of where menu/list text can appear
    x1 = Menu(WhichOne).Left: x2 = x1 + Menu(WhichOne).Width
    y1 = Menu(WhichOne).Top: y2 = Menu(WhichOne).Top + Menu(WhichOne).Height
    IF WhichOne = StartNum THEN
        IF OldMouse = 0 AND MB = -1 THEN Click = -1 ELSE Click = 0
        IF OldMouse2 = 0 AND MB2 = -1 THEN Click2 = -1 ELSE Click2 = 0
        OldMouse = MB: OldMouse2 = MB2
        IF ElapsedTimer + ScrollDelay < TIMER(0.01) THEN
            ElapsedTimer = TIMER(0.01)
            ScrollAble = -1
        ELSE
            ScrollAble = 0
        END IF
    END IF
 
 
 
 
    IF Menu(WhichOne).Frame THEN
        LINE (Menu(WhichOne).Left, Menu(WhichOne).Top)-STEP(Menu(WhichOne).Width, Menu(WhichOne).Height), Menu(WhichOne).BorderColor, B
        x1 = x1 + 1: y1 = y1 + 1
        x2 = x2 - 1: y2 = y2 - 1
    END IF
    IF Menu(WhichOne).Header THEN
        temp = x2 - x1 + 1
        IF Menu(WhichOne).Exit THEN
            temp = temp - _FONTWIDTH * 2
            ex1 = x2 - 1 - _FONTWIDTH: ex2 = ex1 + _FONTWIDTH
            ey1 = y1 + 1: ey2 = ey1 + _FONTHEIGHT - 3
        END IF
        y1 = y1 + _FONTHEIGHT
        IF Menu(WhichOne).Frame THEN y1 = y1 + 2
    END IF 'end header creation
 
    IF Menu(WhichOne).Entries > 0 THEN 'We have items in our list to display!
        IF Menu(WhichOne).TopEntry < 1 THEN Menu(WhichOne).TopEntry = 1 'check to make certain we're displaying from the first entry on at least
        IF Menu(WhichOne).TopEntry > Menu(WhichOne).Entries THEN Menu(WhichOne).TopEntry = Menu(WhichOne).Entries
        printlimit = (x2 - x1 + 1) \ _FONTWIDTH
        limitfound = 1 + (y2 - y1 + 1) \ _FONTHEIGHT - 1
        IF limitfound > Menu(WhichOne).Entries THEN
            limitfound = Menu(WhichOne).Entries
        ELSE
            scrollneeded = -1
            printlimit = printlimit - 1
        END IF
    END IF 'end of displaying items
 
    IF Menu(WhichOne).ScrollBarHidden = -1 THEN scrollneeded = 0
 
    IF scrollneeded THEN 'then we need a vertical scroll bar
        barx1 = x2 - _FONTWIDTH - 1
        barx2 = barx1 + _FONTWIDTH
    END IF
 
 
    SELECT CASE MY 'let's determine which line we clicked the mouse on
        CASE IS < ey1 'do nothing as it's too far up the screen to be a click in this box
        CASE IS > y2 'do nothing again as it's too far down the screen to be a click in this box
        CASE ey1 TO ey2 'we've clicked on the line where the EXIT button might exist
        CASE y1 TO y2
    END SELECT
 
 
 
    SELECT CASE MY 'let's determine which line we clicked the mouse on
        CASE IS < ey1 'do nothing as it's too far up the screen to be a click in this box
        CASE IS > y2 'do nothing again as it's too far down the screen to be a click in this box
        CASE ey1 TO ey2 'we've clicked on the line where the EXIT button might exist
            IF Click AND Menu(WhichOne).Exit THEN
                IF MX >= ex1 AND MX <= ex2 THEN Menu(WhichOne).Visible = False 'If the exit button is available, and we click it, it closes the menu/list
            END IF
        CASE y1 TO y2
            done = 0
            IF barx1 > 0 THEN p2 = barx1 - 1 ELSE p2 = x2
            IF MX >= x1 AND MX <= p2 THEN 'highlight the choice the user is over
                yPOS = ((MY - y1 + 1) \ _FONTHEIGHT) * _FONTHEIGHT + y1
                IF yPOS + _FONTHEIGHT <= y2 THEN LINE (x1, yPOS)-(p2, yPOS + _FONTHEIGHT), Menu(WhichOne).HighLightColor, B
            END IF
 
            IF MouseScroll THEN
                IF MX >= x1 AND MX <= x2 THEN
                    Menu(WhichOne).TopEntry = Menu(WhichOne).TopEntry + MouseScroll
                    IF Menu(WhichOne).TopEntry < 1 THEN Menu(WhichOne).TopEntry = 1
                    IF Menu(WhichOne).TopEntry > Menu(WhichOne).Entries - limitfound + 1 THEN Menu(WhichOne).TopEntry = Menu(WhichOne).Entries - limitfound + 1
                    FOR i = 1 TO LinkedTo(0).one
                        IF WhichOne = LinkedTo(i).one THEN Menu(LinkedTo(i).another).TopEntry = Menu(WhichOne).TopEntry
                        IF WhichOne = LinkedTo(i).another THEN Menu(LinkedTo(i).one).TopEntry = Menu(WhichOne).TopEntry
                    NEXT
                END IF
            END IF
 
            IF scrollneeded THEN
                IF MY >= y1 AND MY <= y1 + _FONTHEIGHT AND MX >= barx1 AND MX <= barx2 AND MB <> 0 THEN 'it's the top scroll bar
                    IF ScrollAble THEN Menu(WhichOne).TopEntry = Menu(WhichOne).TopEntry - 1
                    IF Menu(WhichOne).TopEntry < 1 THEN Menu(WhichOne).TopEntry = 1
                    done = -1
                    FOR i = 1 TO LinkedTo(0).one
                        IF WhichOne = LinkedTo(i).one THEN Menu(LinkedTo(i).another).TopEntry = Menu(WhichOne).TopEntry
                        IF WhichOne = LinkedTo(i).another THEN Menu(LinkedTo(i).one).TopEntry = Menu(WhichOne).TopEntry
                    NEXT
                ELSEIF MY >= y2 - _FONTHEIGHT AND MY <= y2 AND MX >= barx1 AND MX <= barx2 AND MB <> 0 THEN 'it's the bottom scroll bar
                    IF ScrollAble THEN Menu(WhichOne).TopEntry = Menu(WhichOne).TopEntry + 1
                    IF Menu(WhichOne).TopEntry > Menu(WhichOne).Entries - limitfound + 1 THEN Menu(WhichOne).TopEntry = Menu(WhichOne).Entries - limitfound + 1
                    done = -1
                    FOR i = 1 TO LinkedTo(0).one
                        IF WhichOne = LinkedTo(i).one THEN Menu(LinkedTo(i).another).TopEntry = Menu(WhichOne).TopEntry
                        IF WhichOne = LinkedTo(i).another THEN Menu(LinkedTo(i).one).TopEntry = Menu(WhichOne).TopEntry
                    NEXT
                ELSEIF MX >= barx1 AND MX <= barx2 AND MB <> 0 THEN
                    MenuLimit = Menu(WhichOne).Entries - limitfound + 2
                    ylimit = y2 - y1 - _FONTHEIGHT * 2 + 1
                    yPOS = MY - y1 - _FONTHEIGHT + 1
                    Menu(WhichOne).TopEntry = (MenuLimit - (ylimit - yPOS) / ylimit * MenuLimit)
                    IF Menu(WhichOne).TopEntry >= MenuLimit THEN Menu(WhichOne).TopEntry = MenuLimit - 1
                    done = -1
                    FOR i = 1 TO LinkedTo(0).one
                        IF WhichOne = LinkedTo(i).one THEN Menu(LinkedTo(i).another).TopEntry = Menu(WhichOne).TopEntry
                        IF WhichOne = LinkedTo(i).another THEN Menu(LinkedTo(i).one).TopEntry = Menu(WhichOne).TopEntry
                    NEXT
                END IF
            END IF
 
            IF NOT done THEN 'if we've processed a scrollbar event, we're finished
                IF MX >= x1 AND MX <= x2 THEN
                    MenuSelected = WhichOne
                    OptionSelected = MenuDisplayOrder((MY - y1 + 1) \ _FONTHEIGHT + Menu(WhichOne).TopEntry, WhichOne)
                    invalidate = 0
                    IF MenuListDisabled(OptionSelected, WhichOne) THEN invalidate = -1
                    FOR ii = 1 TO LinkedTo(0).one
                        IF WhichOne = LinkedTo(ii).one AND MenuListDisabled(OptionSelected, LinkedTo(ii).another) THEN invalidate = -1
                        IF WhichOne = LinkedTo(ii).another AND MenuListDisabled(OptionSelected, LinkedTo(ii).one) THEN invalidate = -1
                    NEXT
                    IF barx1 <> 0 AND MX > barx1 THEN invalidate = -1
                    IF invalidate THEN MenuSelected = 0: OptionSelected = 0
                END IF
            END IF
    END SELECT
 
 
    MouseStatus = 0
    MouseStatus = MouseStatus OR -Click 'leftclick
    MouseStatus = MouseStatus OR Click2 * -2 'rightclick
    MouseStatus = MouseStatus OR _MOUSEBUTTON(1) * -4 'leftdown
    MouseStatus = MouseStatus OR _MOUSEBUTTON(2) * -8 'rightdown
    MouseStatus = MouseStatus OR (MenuSelected <> 0) * 16 'If we're over the menu, we're hovering
 
END SUB
 
 
SUB MenuDisplaySort (handle AS LONG, sortmethod AS _BYTE)
    gap = Menu(handle).Entries
 
    IF sortmethod AND Alpha THEN
        IF sortmethod AND NoCase THEN
            DO
                gap = 10 * gap \ 13
                IF gap < 1 THEN gap = 1
                i = 0
                swapped = 0
                DO
                    t$ = UCASE$(LTRIM$(RTRIM$(MenuList(MenuDisplayOrder(i, handle), handle))))
                    t1$ = UCASE$(LTRIM$(RTRIM$(MenuList(MenuDisplayOrder(i + gap, handle), handle))))
                    IF t$ > t1$ THEN
                        SWAP MenuDisplayOrder(i, handle), MenuDisplayOrder(i + gap, handle)
                        FOR ii = 1 TO LinkedTo(0).one
                            IF handle = LinkedTo(ii).one THEN SWAP MenuDisplayOrder(i, LinkedTo(ii).another), MenuDisplayOrder(i + gap, LinkedTo(ii).another)
                            IF handle = LinkedTo(ii).another THEN SWAP MenuDisplayOrder(i, LinkedTo(ii).one), MenuDisplayOrder(i + gap, LinkedTo(ii).one)
                        NEXT
                        swapped = -1
                    END IF
                    i = i + 1
                LOOP UNTIL i + gap > Menu(handle).Entries
            LOOP UNTIL gap = 1 AND swapped = 0
        ELSE
            DO
                gap = 10 * gap \ 13
                IF gap < 1 THEN gap = 1
                i = 0
                swapped = 0
                DO
                    t$ = LTRIM$(RTRIM$(MenuList(MenuDisplayOrder(i, handle), handle)))
                    t1$ = LTRIM$(RTRIM$(MenuList(MenuDisplayOrder(i + gap, handle), handle)))
                    IF t$ > t1$ THEN
                        SWAP MenuDisplayOrder(i, handle), MenuDisplayOrder(i + gap, handle)
                        FOR ii = 1 TO LinkedTo(0).one
                            IF handle = LinkedTo(ii).one THEN SWAP MenuDisplayOrder(i, LinkedTo(ii).another), MenuDisplayOrder(i + gap, LinkedTo(ii).another)
                            IF handle = LinkedTo(ii).another THEN SWAP MenuDisplayOrder(i, LinkedTo(ii).one), MenuDisplayOrder(i + gap, LinkedTo(ii).one)
                        NEXT
                        swapped = -1
                    END IF
                    i = i + 1
                LOOP UNTIL i + gap > Menu(handle).Entries
            LOOP UNTIL gap = 1 AND swapped = 0
        END IF
        IF sortmethod AND Reverse THEN
            FOR i = 1 TO Menu(handle).Entries \ 2
                SWAP MenuDisplayOrder(i, handle), MenuDisplayOrder(Menu(handle).Entries - i + 1, handle)
                FOR ii = 1 TO LinkedTo(0).one
                    IF handle = LinkedTo(ii).one THEN SWAP MenuDisplayOrder(i, LinkedTo(ii).another), MenuDisplayOrder(Menu(handle).Entries - i + 1, LinkedTo(ii).another)
                    IF handle = LinkedTo(ii).another THEN SWAP MenuDisplayOrder(i, LinkedTo(ii).one), MenuDisplayOrder(Menu(handle).Entries - i + 1, LinkedTo(ii).one)
                NEXT
            NEXT
        END IF
    ELSEIF sortmethod AND Numeric THEN
        DO
            gap = 10 * gap \ 13
            IF gap < 1 THEN gap = 1
            i = 0
            swapped = 0
            DO
                IF VAL(MenuList(MenuDisplayOrder(i, handle), handle)) > VAL(MenuList(MenuDisplayOrder(i + gap, handle), handle)) THEN
                    SWAP MenuDisplayOrder(i, handle), MenuDisplayOrder(i + gap, handle)
                    FOR ii = 1 TO LinkedTo(0).one
                        IF handle = LinkedTo(ii).one THEN SWAP MenuDisplayOrder(i, LinkedTo(ii).another), MenuDisplayOrder(i + gap, LinkedTo(ii).another)
                        IF handle = LinkedTo(ii).another THEN SWAP MenuDisplayOrder(i, LinkedTo(ii).one), MenuDisplayOrder(i + gap, LinkedTo(ii).one)
                    NEXT
                    swapped = -1
                END IF
                i = i + 1
            LOOP UNTIL i + gap > Menu(handle).Entries
        LOOP UNTIL gap = 1 AND swapped = 0
        IF sortmethod AND Reverse THEN
            FOR i = 1 TO Menu(handle).Entries \ 2
                SWAP MenuDisplayOrder(i, handle), MenuDisplayOrder(Menu(handle).Entries - i + 1, handle)
                FOR ii = 1 TO LinkedTo(0).one
                    IF handle = LinkedTo(ii).one THEN SWAP MenuDisplayOrder(i, LinkedTo(ii).another), MenuDisplayOrder(Menu(handle).Entries - i + 1, LinkedTo(ii).another)
                    IF handle = LinkedTo(ii).another THEN SWAP MenuDisplayOrder(i, LinkedTo(ii).one), MenuDisplayOrder(Menu(handle).Entries - i + 1, LinkedTo(ii).one)
                NEXT
            NEXT
        END IF
    ELSE
        FOR i = 1 TO Menu(handle).Entries
            MenuDisplayOrder(i, handle) = i
            FOR ii = 1 TO LinkedTo(0).one
                IF handle = LinkedTo(ii).one THEN MenuDisplayOrder(i, LinkedTo(ii).another) = i
                IF handle = LinkedTo(ii).another THEN MenuDisplayOrder(i, LinkedTo(ii).one) = i
            NEXT
        NEXT
    END IF
 
END SUB
 

(BI and BM files have been merged into the main module for ease of sharing).

The version of this demo included in SODR v0.5.7z (the dice roller zip file) won't run. It was included simply by mistake, and was used only as a means for me to strip out the declarations and routines to create the LinkedList.BI and LinkedList.BM files which are needed for the dice roller to work.

Here is a version of the routine which showcases how the library works and performs for us. We can easily create a list of things. Link one list to another, if we want... Sort them. Select them. Hide them... Invalidate choices... It's a very powerful little library, and one which I plug into a lot of little things for when I need a menu of choices.

The lists scroll. They're sortable. The do all kinds of stuff!

And, once you toss the library into a program, it does all it does in a suprisingly short number of lines and commands -- here's the main routine of demo with the includes stripped out:

Code: QB64: [Select]

'Before here goes BI file content
'After here goes working program
 
DEFLNG A-Z
SCREEN _NEWIMAGE(800, 600, 32)
_SCREENMOVE _MIDDLE
 
MainMenu = GetMenuHandle
SetMenuSize MainMenu, 200, 150
SetMenuPosition MainMenu, 100, 100
SetMenuFrame MainMenu, True, Red, Yellow
SetMenuVisible MainMenu, True
SetMenuCaption MainMenu, True, "Name", Black, White, True
SetMenuListProperties MainMenu, Black, 0, Center 'Right 'Left
SetMenuHighLightColor MainMenu, Red
FOR i = 1 TO 23
    READ n$
    AddMenuItem MainMenu, n$
NEXT
 
DATA Steve,Pete,Bob,Joe,Fred
DATA Sam,One,Two,Three,Four
DATA Five,Six,Seven,Eight,Nine
DATA These,are,all,my,names
DATA "Aren't",they,grand
 
SecondMenu = GetMenuHandle
SetMenuSize SecondMenu, 100, 150
SetMenuPosition SecondMenu, 300, 100
SetMenuFrame SecondMenu, True, Red, Yellow
SetMenuVisible SecondMenu, True
SetMenuCaption SecondMenu, True, "Age", Black, White, True
SetMenuListProperties SecondMenu, Black, 0, Left
SetMenuHighLightColor SecondMenu, Red
 
FOR i = 1 TO 23
    READ n$
    AddMenuItem SecondMenu, n$
NEXT
 
DATA 12,23,34,45,56
DATA 67,78,89,90,1
DATA 9,98,87,76,65
DATA 54,43,32,21,10
DATA 42,55,12
 
sortmode = 0: linked = -1: menuon = 1
 
HideMenuScrollBar MainMenu
LinkMenus MainMenu, SecondMenu
 
DisableItem MainMenu, 5
ScrollDelay = .25
DO
    CLS
    LOCATE 20, 1: PRINT "Press <H> to hide the menu."
    PRINT "Press <S> to show the menu."
    PRINT "Press <N> for No Sort order."
    PRINT "Press <A> for Alphabetic Sort order."
    PRINT "Press <#> for Numeric Sort order."
    PRINT "Press <C> to toggle case sorting."
    PRINT "Press <R> to toggle reverse sorting."
    PRINT "Press <L> to link the menus."
    PRINT "Press <U> to unlink the menus."
    PRINT "Press <TAB> to swap between menus."
    PRINT "<ESC> to quit"
    PRINT
    PRINT "Currently: ";
    IF sortmode AND 1 THEN
        PRINT "ALPHA SORT";
        IF kase THEN PRINT ", CASE-SENSITIVE";
        IF reversed THEN PRINT ", REVERSE-ORDER" ELSE PRINT
    ELSEIF sortmode AND 2 THEN
        PRINT "NUMERIC SORT";
        IF reversed THEN PRINT ", REVERSE-ORDER" ELSE PRINT
    ELSE
        PRINT "NOT SORTING"
    END IF
    LOCATE 5, 25
    IF linked THEN PRINT "LINKED LISTS" ELSE PRINT "UNLINKED LISTS"
    LOCATE 6, 15: PRINT "MENU ASSOCIATED WITH KEYBOARD: "; menuon
 
    MouseScroll = 0
    WHILE _MOUSEINPUT
        MouseScroll = MouseScroll + _MOUSEWHEEL
    WEND
 
    k = _KEYHIT
    SELECT CASE k
        CASE ASC("L"), ASC("l"): LinkMenus MainMenu, SecondMenu: linked = -1
        CASE ASC("U"), ASC("u"): UnLinkMenus MainMenu, SecondMenu: linked = 0
        CASE ASC("H"), ASC("h"): HideMenu menuon
        CASE ASC("S"), ASC("s"): ShowMenu menuon
        CASE ASC("N"), ASC("n"): sortmode = None: changed = -1: reversed = 0: kase = 0
        CASE ASC("A"), ASC("a"): sortmode = Alpha: changed = -1
        CASE ASC("#"), ASC("3"): sortmode = Numeric: changed = -1
        CASE ASC("C"), ASC("c"): kase = NOT kase: changed = -1
        CASE ASC("R"), ASC("r"): reversed = NOT reversed: changed = -1
        CASE 9: menuon = menuon + 1: IF menuon = 3 THEN menuon = 1
        CASE 27: SYSTEM
    END SELECT
    IF changed THEN
        IF sortmode <> 0 THEN
            IF kase THEN sortmode = sortmode OR NoCase ELSE sortmode = sortmode AND NOT NoCase
            IF reversed THEN sortmode = sortmode OR Reverse ELSE sortmode = sortmode AND NOT Reverse
        END IF
        MenuDisplaySort menuon, sortmode
        changed = 0
    END IF
    DisplayMenus
    CheckMenus MouseStatus, MenuSelected, OptionSelected
    IF MouseStatus <> 0 AND MenuSelected <> 0 THEN
        IF MouseStatus AND LeftClick THEN
            LOCATE 1, 1
            PRINT "You LEFT CLICKED Option #"; OptionSelected; " in Menu #"; MenuSelected
            PRINT "Which was: "; GetListItem(MenuSelected, OptionSelected)
            PRINT
            IF linked THEN
                PRINT "Since our lists are linked, we get the following items:"; GetListItem(1, OptionSelected), GetListItem(2, OptionSelected)
            ELSE
                PRINT "Since our lists are unlinked, we get the following items:"; GetListItem(MenuSelected, OptionSelected)
            END IF
            _DISPLAY
            _DELAY 2 'give it time to pop up
        ELSEIF MouseStatus AND RightClick THEN
            LOCATE 1, 1
            PRINT "You RIGHT CLICKED Option #"; OptionSelected; " in Menu #"; MenuSelected
            PRINT "Which was: "; GetListItem(MenuSelected, OptionSelected)
            PRINT
            IF linked THEN
                PRINT "Since our lists are linked, we get the following items:"; GetListItem(1, OptionSelected), GetListItem(2, OptionSelected)
            ELSE
                PRINT "Since our lists are unlinked, we get the following items:"; GetListItem(MenuSelected, OptionSelected)
            END IF
            _DISPLAY
            _DELAY 2 'give it time to pop up
        END IF
        COLOR Yellow
        IF MouseStatus AND LeftDown THEN LOCATE 35, 1: PRINT "LEFT MOUSE DOWN over Option #"; OptionSelected; " in Menu #"; MenuSelected
        IF MouseStatus AND RightDown THEN LOCATE 35, 1: PRINT "RIGHT MOUSE DOWN over Option #"; OptionSelected; " in Menu #"; MenuSelected
        COLOR Purple
        IF MouseStatus AND Hover THEN LOCATE 36, 1: PRINT "HOVERING over Option #"; OptionSelected; " in Menu #"; MenuSelected;
        COLOR White
 
    END IF
    _LIMIT 30
    _DISPLAY
LOOP
 
'And here goes the BM routines

Less than 150 lines for the program to create the lists and interact with them as the demo illustrates, and it highlights a whole bunch of the options which one can make use of with the library. Sorting. Linking lists. Unlinking lists. Selecting things. Hiding lists. Restoring lists. Scrolling via the mouse wheel or in-built sliders. Hiding/showing sliders. Making selections unavailable, and restoring availability...

Lots of stuff going on in the little demo here, and in the end, it's all handled in very few lines once the library is '$INCLUDE with the program. ;)

Title: Re: Linked Lists Demo
Post by: Pete on January 17, 2019, 10:56:05 am

Good work, only one error.

First DATA statement should read:

DATA Pete,Steve,Bob,Joe,Fred

Not

DATA Steve,Pete,Bob,Joe,Fred

Pete ;D

Title: Re: Linked Lists Demo
Post by: STxAxTIC on January 17, 2019, 12:03:27 pm

Looks like a handy utility, whether or not I split hairs on the definition of a linked list.

Title: Re: Linked Lists Demo
Post by: SMcNeill on January 17, 2019, 01:09:17 pm

Quote from: STxAxTIC on January 17, 2019, 12:03:27 pm

Looks like a handy utility, whether or not I split hairs on the definition of a linked list.

In this case, the definition fits perfectly. Make a list. Then make a second one. Then you “link” them together so what you do to one it does to the other.... Name, Age, Phone Number — 3 potentially different lists of things that we generally keep together.

If you sort the data by name, you’d normally want the Age and Phone Number to start in proper order with those names, so they’d sort as well... Scroll down the list for one, it needs to scroll down all the other lists as well. Invalidate one person from being selectable, his age and phone number shouldn’t be selectable either...

Those lists are “linked” so whatever action you take with one occurs with the others as well. If those aren’t “linked lists”, what would you call them? “Quantumly Entangled Lists”? ;D

Title: Re: Linked Lists Demo
Post by: FellippeHeitor on January 17, 2019, 01:39:55 pm

Quote

If those aren’t “linked lists”, what would you call them?

Records in a database.

This is what STx (and general cs) mean by linked list: https://en.wikipedia.org/wiki/Linked_list

Title: Re: Linked Lists Demo
Post by: SMcNeill on January 17, 2019, 02:15:39 pm

Quote from: FellippeHeitor on January 17, 2019, 01:39:55 pm

Quote
If those aren’t “linked lists”, what would you call them?
Records in a database.

This is what STx (and general cs) mean by linked list: https://en.wikipedia.org/wiki/Linked_list

I understand Stx’s Definition of the term, but sometimes a term can be used to represent more than one concept.

“Bass” is a type of fish.
“Bass” is also a low pitch radio output.

“Records in a Database” doesn’t really fit, as these are 3 *different* datasets that we’re “linking” together to work with as one unit.

We see it all the time in business application software... one Dataset might be customer address and phone number. Another dataset is customer payment method and account status. Generally, those records are stored separately, in multiple databases, for security. Close out one account, it should close the other “linked” record as well, but the databases are separate...

At its heart, QB64’s internal idet$ is a “linked list” such as you’re talking about, but what I’m talking about here is “linking two separate lists together to share the same behavioral properties”...

Maybe instead of “linked lists”, I should call this a “List Linking Library”.... But the question remains: What’s the simple term you’d call to explain the relationship between those two separate datasets which we “other word than link” together?

Title: Re: Linked Lists Demo
Post by: bplus on January 17, 2019, 02:23:56 pm

Quote

Maybe instead of “linked lists”, I should call this a “List Linking Library”.... But the question remains: What’s the simple term you’d call to explain the relationship between those two separate datasets which we “other word than link” together?

"Relational Database" but "List Linking Library" is less confusing than "Linked Lists" being used for your purpose.
https://www.google.com/search?client=opera&q=relational+database+model&sourceid=opera&ie=UTF-8&oe=UTF-8

Title: Re: Lists Linking Demo
Post by: SMcNeill on January 17, 2019, 02:34:31 pm

Quote from: bplus on January 17, 2019, 02:23:56 pm

Quote
Maybe instead of “linked lists”, I should call this a “List Linking Library”.... But the question remains: What’s the simple term you’d call to explain the relationship between those two separate datasets which we “other word than link” together?

"Relational Database" but "List Linking Library" is less confusing than "Linked Lists" being used for your purpose.
https://www.google.com/search?client=opera&q=relational+database+model&sourceid=opera&ie=UTF-8&oe=UTF-8

Title changed. Gosh, you guys are hard to please.

It’s understandable why some folks refuse to share code anymore; folks get lost in arguing over the semantics of the terminology too much to actually talk about the code itself anymore. No wonder most companies just refer to things as “Project 1X3RT7” and such...

Title: Re: Lists Linking Demo
Post by: Pete on January 17, 2019, 03:16:30 pm

Weren't you the guy who posted in another thread that you were hard to offend? Well, that wasn't hard.

I would have gone with... Remember guys, it's only all about nomenclature in an all female society.

Pete :D

Title: Re: Lists Linking Demo
Post by: SMcNeill on January 17, 2019, 03:32:48 pm

Quote from: Pete on January 17, 2019, 03:16:30 pm

Weren't you the guy who posted in another thread that you were hard to offend? Well, that wasn't hard.

I would have gone with... Remember guys, it's only all about nomenclature in an all female society.

Pete :D

Didn’t say I was offended; just said I understood why others might choose not to bother with the hassle. You’re getting as bad as the Democrats at reading things into a statement that isn’t there. :P

Title: Re: Lists Linking Demo
Post by: Pete on January 17, 2019, 05:33:34 pm

Lucky for you, I'm not easily offended! Wait, did you compare me to a Democrat? Why you &^$$^%$c 6Z^%67%5^%z^ T^%8 ^5!!!!!

Pete :D

Title: Re: Lists Linking Demo
Post by: _vince on January 18, 2019, 06:25:51 pm

FYI, there's the database concept of linking tables, where two or more different tables are joined together with a separate table in a similar address linking fashion ;-)

Further reading: https://en.wikipedia.org/wiki/Associative_entity (https://en.wikipedia.org/wiki/Associative_entity)

Title: Re: Lists Linking Demo
Post by: SMcNeill on January 18, 2019, 06:53:20 pm

Quote from: v on January 18, 2019, 06:25:51 pm

FYI, there's the database concept of linking tables, where two or more different tables are joined together with a separate table in a similar address linking fashion ;-)

No, no, no.

You can’t use the word linking; it’s not acceptable.

You have to say, “... concept of relationally databasing tables”, or “... in a similar address quantum entanglement fashion”. That word “link” is too basic for BASIC, to be valid.

(And what you describe is exactly what the library does here: it creates an additional table/list behind the scenes to join two or more others together.)

And funnily enough:

“Associative tables are colloquially known under many names, including association table, bridge table, cross-reference table, crosswalk, intermediary table, intersection table, join table, junction table, link table, linking table, many-to-many resolver, map table, mapping table, pairing table, pivot table (as used incorrectly in Laravel - not to be confused with the correct use of pivot table in spreadsheets), or transition table.”

And, of course, “list” is just another word for a “table”, so if we put those words together, it becomes the dreaded, “link list” or “linking list”...

Title: Re: Lists Linking Demo
Post by: STxAxTIC on January 19, 2019, 01:12:04 am

... more flailing casuistry. You just can't let it (me) go, can you? Just admit you're probably still not aware of what a real linked list is, and why some people react when you use those words together haphazardly, that's all. So simple.

Title: Re: Lists Linking Demo
Post by: SMcNeill on January 19, 2019, 02:51:22 am

Quote from: STxAxTIC on January 19, 2019, 01:12:04 am

... more flailing casuistry. You just can't let it (me) go, can you? Just admit you're probably still not aware of what a real linked list is, and why some people react when you use those words together haphazardly, that's all. So simple.

Go take a look in QB64.bas. Idet$ is a basic linked list as you’re speaking of...

Now, go to Microsoft Access. You’ll find a Linked Table Manager in there, which is basically a way of linking multiple tables together into one document.

And, let’s take a moment to look at what the dictionary offers us for “table”:

Quote

a set of facts or figures systematically displayed, especially in columns.
"the population has grown, as shown in table 1"

synonyms
list · chart · diagram · figure · graph · plan · catalog · inventory · digest · enumeration · tabulation · index · directory · register · itemization · record ·

Gee, what’s the very first synonym in that table of words??

But, you’re right: I don’t understand why some folks react like they do when those words are used together. Most people I know understand that the same words can have very different meanings, and they’ll generally accept if they’re used in a manner different than they’re used to.

A set of data in a single column has always been a “list” to me. A grocery list. A to-do list. A list of medications taken.

A set of data in multiple columns is usually referred to as being in a table. Table of contents has both Chapter and Page Number found on the same line.

As this is a routine which “links” the behavior of two singular sets of data — “lists”. I don’t think it’s the least bit wrong to call it a Linking Lists Library. If the name’s unfitting, give me a better one.

Should we call it “Records in a Database Library” as per Fell? “Relational Database Library” as per bplus? “The No Idea Library” as per Stx?

You don’t like what it’s called; give me something better and more descriptive to call it.

Personally, in the Spirit of BASIC, I don’t see what could be a simpler name for it. Take one list, then another list, and PRESTO — “link” them together.

Title: Re: Lists Linking Demo
Post by: FellippeHeitor on January 19, 2019, 05:47:56 am

What I probably didn't make clear when I first interacted with this thread is that I don't care what it's called.

Steve is in a funny (Clippy + [banned user]) mode in this thread and that's funny. That doesn't match you, man. Let it go.

(There comes a wall).

Title: Re: Lists Linking Demo
Post by: Pete on January 19, 2019, 11:33:18 am

Here's may take one the link lists from this thread:

Pete --- Thinks like a Democrat

Steve --- Thinks like Clippy

I'm pretty sure happenings like this were mentioned in some chapter of some well read book somewhere. Oh yeah, Revelations, form The Bible.

Well, it's like they say... It doesn't matter if you call it a mountain lion or cougar, if you argue over that while it's stalking you, all it knows is your names are lunch.

Pete

Title: Re: Lists Linking Demo
Post by: STxAxTIC on January 19, 2019, 01:50:56 pm

I should apologize for my tone (I still might).

So first things first - my version of qb64.bas does not contain Idet$ for some reason. But that's irrelevant because a linked list is not just a string, either, so I can't imagine what point you make by directing me there. And the concept does not involve parallel tables or two arrays that need to point to each other. All of that is fluff, all of that misses the forest for the trees.

Let me try to fix things up here for our readers who didn't know...

An classical array is analogous to a pre-hollowed-out space in memory - a manifold if you like - into which you cram data. Even if you can change properties on the fly, such as the total number of elements, this is still a classical array. (Old news.) One assumption we make about storing data that way is the concept of "neighbors". On a rigid manifold, any given element has definite neighbors. You expect array member 4 to be sandwiched between members 3 and 5, so that when we loop through the elements, we hit 3, 4, 5 in order, all the way up to N or whatever. Again, all old news.

The classical array structure has plenty of problems, especially speed problems when the number of elements is large. To do any legwork in the array, we are often looping through the entire list of elements until landing on the right one - sortof like reading through the entire phonebook from the beginning until you find the entry you need... And god forbid you need to make an edit. For a classical array, we need to constantly bump existing elements to make room for the new elements. This is where naive text editors go wrong - if I want to make random edits near the top of a large file, the whole bulk of the text below needs to be jumping up and down the array at an amazing speed, and generates enough lag to kill the project, or to force wonky hacks. Even if computers *do* get fast enough to not notice the problems here, should we really be asking the machine to do all that extra work?

Proponents of linked lists say "no". To understand them is very simple. Throw away the idea of a classical array - the manifold - and thus the notion of "neighbors" goes out the window. There is no notion of jumbling data between bins anymore. To store one unit data in a linked list, you need (at bare minimum) three things:

1) The data itself, such as the letter "F", the number 7, or the whole encyclopedia (for the sake of argument).

2) An address to hold that data. This is just a unique integer that represents each element. Now check this out: In a classical array, these addresses go in linear order. The new idea is that in the linked list scheme, the linearity is not necessary. The data can occupy any unique address at all.

3) A pointing value holding the "next" element's address.

So one node in the list might be ("F",3,7), which stores the letter "F" at address 3, and then points to the next address at 7. This could mean there is some other node ("U",7,19) that stores the letter "U" at address 7, but then points out to 19, and so on. You can have more than one list in the same address space, you can have lists that intersect and merge like a half-zipped zipper or something... You may also violate linearity and create trees this way. Adding, removing, and rearranging elements becomes completely trivial with zero array shuffling.

So in conclusion, I'll admit, I didn't look closely at your code enough to decide if you're actually doing what I described here. If so, then congratulations, you may revert the thread title to what you had originally set.

Title: Re: Lists Linking Demo
Post by: SMcNeill on January 19, 2019, 02:42:18 pm

Quote from: STxAxTIC on January 19, 2019, 01:50:56 pm

So first things first - my version of qb64.bas does not contain Idet$ for some reason. But that's irrelevant because a linked list is not just a string, either, so I can't imagine what point you make by directing me there. And the concept does not involve parallel tables or two arrays that need to point to each other. All of that is fluff, all of that misses the forest for the trees.

I more or less quit reading after this point, as you obviously have no clue of... pretty much anything.

idet$ is the variable where QB64 stores our code when we type it into the IDE. It's found in numerous places inside the qb64 source, and if you can't locate it, you simply didn't bother to check the $INCLUDE files inside the source.

The way idet$ works is like this (from memory, feel free to check the source for specifics):

It stores a pointer for the length of a line + 8.
It stores the line.
It stores a pointer for the length of a line + 8.

So when reading this "list", the first pointer tells you how far to move to get to the data of the next line...

Now, see if that doesn't fill the definition of a "linked list" as you like to act oh-so-superior about:

Quote

In computer science, a Linked list is a linear collection of data elements, whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collection of nodes which together represent a sequence. In its most basic form, each node contains: data, and a reference (in other words, a link) to the next node in the sequence.

a Linked list is a linear collection of data elements --- Check, it's all in one line of data in the string.

each element points to the next -- Yep. It does that.

It is a data structure consisting of a collection of nodes which together represent a sequence. -- Yep. It's the sequence of lines that you enter into the IDE which makes up your code.

In its most basic form, each node contains: data, and a reference (in other words, a link) to the next node in the sequence. -- Yep, that's what it is.

Quote from: STxAxTIC on January 19, 2019, 01:50:56 pm

But that's irrelevant because a linked list is not just a string, either, so I can't imagine what point you make by directing me there.

Maybe you need to do a little research to figure out what exactly you're trying to talk about, before you decide to proclaim someone else wrong on the issue.

Edit: Here, a little bit of the code from QB64 for you to consider:

Code: QB64: [Select]

a$ = MKL$(l& + LEN(a$)) + a$ + idet$ + MKL$(l& + LEN(a$)) 'header, data & encapsulation (reverse navigatable list)

Gee, what does that look like?

Title: Re: Lists Linking Demo
Post by: STxAxTIC on January 19, 2019, 02:51:49 pm

Would the nearest hack care to explain this screenshot then?

Is my QB64 version *that* old? The string ain't there bro. If so, then accuse me of being BASIC, haha.

Steve, listen to Fellippe - you need to let this whole thing go right after you concede the point, or go silent like you do on other threads where my argument lands against you. Don't accuse me of whatever hillbilly version of belittlement you detect, either. I'm being nothing but informative here.

Title: Re: Lists Linking Demo
Post by: FellippeHeitor on January 19, 2019, 02:54:40 pm

Idet$ is just a string you can find in ide_methods.bas. Not the exact definition of a linked list despite Steve advocating for it, but a clever hack Galleon came up to keep the whole loaded program in a structure other than an array (why? Beats me. But it works).

It differs from a linked list essentially because the elements are always in order.

Title: Re: Lists Linking Demo
Post by: STxAxTIC on January 19, 2019, 02:58:32 pm

Ah, thanks Fellippe. Sorry to imply you were a hack (but you DID answer first), haha...

But Steve would clearly contest your finding:

Quote

Go take a look in QB64.bas. Idet$ is a basic linked list as you’re speaking of...

Wonder how he'll prove himself right *this* time...

Title: Re: Lists Linking Demo
Post by: SMcNeill on January 19, 2019, 03:12:33 pm

Quote from: FellippeHeitor on January 19, 2019, 02:54:40 pm

Idet$ is just a string you can find in ide_methods.bas. Not the exact definition of a linked list despite Steve advocating for it, but a clever hack Galleon came up to keep the whole loaded program in a structure other than an array (why? Beats me. But it works).

It differs from a linked list essentially because the elements are always in order.

It doesnt have to be, if Galleon would’ve updated the pointers...

Pointer of 100 + 8 ‘to move forward
100 characters of text
Pointer of 100 + 8 ‘to move backward
Pointer of 32 + 8 ‘to move forward
32 characters of text
Pointer of 32 + 8 ‘to move backwards

Now, say I want to add a line between the 100 characters and the 32...

Pointer of 132 + 24 ‘to move forward
100 characters of text
Pointer of 100 + 8 ‘backwards
Pointer of 32 + len(newline) + pointersizes
32 characters of text
Pointer of 8 ‘to move back, skip this pointer
Pointer of -40 ‘to move forward to next line
The new line of data
.....

The original was 1 points to 2...
The new is 1 points to the 3rd line entered, which then points to the second line entered...

Why Galleon chose to always keep idet$ in order is beyond me. With the list structure, he didn’t have to do that. As it is, I don’t see why a simple array wouldn’t have been more efficient...

Title: Re: Lists Linking Demo
Post by: SMcNeill on January 19, 2019, 03:13:56 pm

Quote from: STxAxTIC on January 19, 2019, 02:58:32 pm

Wonder how he'll prove himself right *this* time...

By simply *being* right. :P

Title: Re: Lists Linking Demo
Post by: SMcNeill on January 19, 2019, 03:17:40 pm

Quote from: STxAxTIC on January 19, 2019, 02:51:49 pm

Would the nearest hack care to explain this screenshot then?

Is my QB64 version *that* old? The string ain't there bro. If so, then accuse me of being BASIC, haha.

Bro, can you read??

Quote

idet$ is the variable where QB64 stores our code when we type it into the IDE. It's found in numerous places inside the qb64 source, and if you can't locate it, you simply didn't bother to check the $INCLUDE files inside the source.

Title: Re: Lists Linking Demo
Post by: STxAxTIC on January 19, 2019, 03:18:48 pm

Sigh, so according to you:

qb64.bas = ide_methods.bas

... I'm glad I don't listen to you, man. Let's just drop this.

Title: Re: Lists Linking Demo
Post by: SMcNeill on January 19, 2019, 03:21:37 pm

Quote from: STxAxTIC on January 19, 2019, 03:18:48 pm

Sigh, so according to you:

qb64.bas = ide_methods.bas

... I'm glad I don't listen to you, man. Let's just drop this.

Try to delete ide_methods and see what happens when you compile. QB64.bas. It’s an integral part of the source...

Just because it’s inside an $INCLUDE doesn’t mean it’s not there...

Title: Re: Lists Linking Demo
Post by: STxAxTIC on January 19, 2019, 03:23:49 pm

At this point I'm just playing with who gets the last word on this completely failed thread.

Title: Re: Lists Linking Demo
Post by: SMcNeill on January 19, 2019, 03:28:54 pm

Quote from: STxAxTIC on January 19, 2019, 03:23:49 pm

At this point I'm just playing with who gets the last word on this completely failed thread.

Nice to see an internet troll admitting to their boorishness for a change. Here, some advice for you:

Quote

...you need to let this whole thing go right after you concede the point, or go silent like you do on other threads where my argument lands against you. Don't accuse me of whatever hillbilly version of belittlement you detect, either. I'm being nothing but informative here.

Title: Re: Lists Linking Demo
Post by: STxAxTIC on January 19, 2019, 03:40:44 pm

Okay so let's recap.

You started this thread not knowing how to identify a linked list, and changed your mind on what to call this thread after several of us dropped hints.

Instead of conceding anything, you instead doubled down that you were right in the first place.

Then I throw down how it finally works, something a Wikidive could have told you.

You pretend not to read my explanation, and magically divine "aha, I can refer to an example of this that someone else made! (still not a real example)"

I'm not sure where your work enters this discussion.

Title: Re: Lists Linking Demo
Post by: SMcNeill on January 19, 2019, 04:00:43 pm

Quote from: STxAxTIC on January 19, 2019, 03:40:44 pm

Okay so let's recap.

You started this thread not knowing how to identify a linked list, and changed your mind on what to call this thread after several of us dropped hints.

Instead of conceding anything, you instead doubled down that you were right in the first place.

Then I throw down how it finally works, something a Wikidive could have told you.

You pretend not to read my explanation, and magically divine "aha, I can refer to an example of this that someone else made! (still not a real example)"

I'm not sure where your work enters this discussion.

I was right in the first place.

It’s just a shame that you can’t comprehend the idea that a name can be associated with different things. You want to object to this being called a “linked list”, yet you can offer no insight as to what you think it should be called. It’s a “linking table”, though since it deals primarily with a single column of data, I prefer the term “list” over “table” — and you’ve given no reason why “table/list” shouldn’t be interchangeable.

It’s also a shame that you don’t even know how an $INCLUDE file works, and can’t comprehend that idet$ *is* a linked list — it’s simply an optimized linked list, forced to be kept in order for some odd reason only known by Galleon. Obviously you have no idea of the very “Linked Lists” you rant so heavily over— you can’t recognize one in its simplest form — nor do you have any comprehension of Linking Tables, yet you like to pretend to be all-knowing on the subject...

Do some research and learn a bit about the subjects you’re arguing over. As it is, you just come across as a belligerent idiot to me.

Title: Re: Lists Linking Demo
Post by: Pete on January 19, 2019, 04:11:07 pm

From Bill's post, now a ways back because I took a nap...

Quote

Proponents of linked lists say "no".

But the problem here is that Ancient Alien Theorists say, "yes."

--------------------------

Yeah the word processing was a good example. I had an idea way back to do something like this...

Say we have 3 records...

1 Pete
2 Steve
3 Rick

Now we missed Bill, and want to insert him into space 1. Yes, with arrays, that would mean we'd have to reassign Pete to 2, Steve to 3 and Rick to 4. However, if we had a tracking string that increased each a record was added, we could just leave these arrays as... a$(1) = "Pete" a$(2) = "Steve" a$(3) = "Rick" and a$(4) = "Bill" So how do we get the order with that tracking string? Like so... tracking$ = "4|1|2|3" it's very easy to manipulate a tracking string with INSTR() and MID$(). So when we need to repront the screen, we consult the tracking string, parse it out and it reprints the order as 4,1,2,3. It also identifies the correct record by the line you are on. If you cursor to line 3...

1 Bill
2 Pete
--> 3 Steve
4 Rick

it looks at the third number in the tracking string, which is 2. This is the array "Steve" was assigned to.

Good stuff guys. Let's see if we can keep it up but without biting each other's heads off. You know we really need Clippy for that.

Pete

Title: Re: Lists Linking Demo
Post by: _vince on January 20, 2019, 05:07:24 am

I, too, have a qb64 linked lists example. These are the proper "doubly linked lists" with the classic textbox/editor example along with storing a whole string per node.

@Steve, the term "linked list" is very specific and well known term in the programming/CS community, like the terms "binary tree", "pointer", "data type", "stack space", "variable", and so on, as it is a specific technique for a particular problem with shuffling items in a list as described by stx. It is not interchangeable with "linking table" as I've jokingly pointed out, so it's pretty misleading to use the it for something else, that is all. It would be like calling badminton "basketball" because the ball is basket shaped, logical only if "basketball" wasn't the already established term that it is.

Code: QB64: [Select]

defint a-z
 
type nodeType
        str as _mem
        strLen as integer
 
'you can add more data to store per node here
 
        n as _mem
        p as _mem
end type
 
type listType
        head as _mem
        tail as _mem
end type
 
screen 0
 
dim new as listType
dim cur as _mem
dim temp as _mem
 
newList new
 
'insert garbage
addNodeNext temp, "test1", new.head
addNodeNext temp, "test2", temp
addNodeNext temp, "test3", temp
addNodeNext temp, "test4", temp
addNodePrev temp, "testa", new.tail
addNodePrev temp, "estb", temp
addNodePrev temp, "", temp
addNodePrev temp, "td", temp
 
printList new
 
nextNode cur, new.head
 
cx = 1
cy = 1
 
do
        cls
        locate 1,1
        printList new
 
        locate cy,cx
        color 0,7
        print chr$(screen(cy,cx))
        color 7,0
 
        do 
                k$ = inkey$
        loop until len(k$)>0
 
        select case k$
        case chr$(13) 'enter
                if cy = 1 and cx = 1 then
                        addNodePrev cur, "", cur
                elseif -1 then
                        s$ = readNode$(cur)
                        ss$ = right$(s$, len(s$)-cx+1)
                        s$ = left$(s$, cx-1)
                        writeNode cur, s$
                        addNodeNext cur, ss$, cur
                        cy = cy + 1
                        cx = 1
                end if
 
        case chr$(8) 'backspace
                if cx = 1 then
                        if cy > 1 then
                                s$ = readNode$(cur)
                                temp = cur
                                prevNode cur, cur
                                ss$ = readNode$(cur)
                                cx = len(ss$) + 1
                                writeNode cur, ss$ + s$
                                cy = cy-1
                                rmNode temp
                        end if
                elseif cx > 1 then
                        cx = cx - 1
                        s$ = readNode$(cur)
                        ss$ = left$(s$, cx-1) + right$(s$, len(s$)-cx)
                        writeNode cur, ss$
                end if
 
        case chr$(0)+"K" 'left
                if cx > 1 then cx = cx - 1
 
        case chr$(0)+"M" 'right
                s$ = readNode$(cur)
                if cx <= len(s$) then cx = cx + 1
 
        case chr$(0)+"H" 'up
                s$ = readNode$(cur)
                if cy > 1 then
                        prevNode cur, cur
                        s$ = readNode$(cur)
                        if cx > len(s$) then cx = len(s$) + 1
                        cy = cy - 1
                end if
 
        case chr$(0)+"P" 'down
                nextNode temp, cur
                if temp.offset <> new.tail.offset then
                        cur = temp
                        s$ = readNode$(cur)
                        if cx > len(s$) then cx = len(s$) + 1
                        cy = cy + 1
                end if
 
        case chr$(32) to chr$(128)
                s$ = readNode$(cur)
                s$ = mid$(s$,1,cx-1) + k$ + right$(s$, len(s$)-cx+1)
                writeNode cur, s$
                cx = cx + 1
        end select
 
loop until k$ = chr$(27)
system
 
sub addNodeNext (new as _mem, s$, cur as _mem)
        dim node as nodeType
        dim temp as _mem
        dim n as _mem
 
        temp = _memnew(len(node))
 
        nextNode n, cur
 
        node.strLen = len(s$)
        if node.strLen > 0 then 
                node.str = _memnew(len(s$))
                _memput node.str, node.str.offset, s$
        end if
        node.n = n
        node.p = cur
        _memput temp, temp.offset, node
 
        node = _memget(cur, cur.offset, nodeType)
        node.n = temp
        _memput cur, cur.offset, node
 
        node = _memget(n, n.offset, nodeType)
        node.p = temp
        _memput n, n.offset, node
 
        new = temp
end sub
 
sub addNodePrev (new as _mem, s$, cur as _mem)
        dim node as nodeType
        dim temp as _mem
        dim p as _mem
 
        temp = _memnew(len(node))
 
        prevNode p, cur
 
        node.strLen = len(s$)
        if node.strLen > 0 then 
                node.str = _memnew(len(s$))
                _memput node.str, node.str.offset, s$
        end if
 
        node.n = cur
        node.p = p
        _memput temp, temp.offset, node
 
        node = _memget(cur, cur.offset, nodeType)
        node.p = temp
        _memput cur, cur.offset, node
 
        node = _memget(p, p.offset, nodeType)
        node.n = temp
        _memput p, p.offset, node
 
        new = temp
end sub
 
sub rmNode (cur as _mem)
        dim node as nodeType
        dim n as _mem
        dim p as _mem
 
        'remove the string first
        node = _memget(cur, cur.offset, nodeType)
        if node.strLen > 0 then
                _memfree node.str
        end if
 
        nextNode n, cur
        prevNode p, cur
 
        node = _memget(p, p.offset, nodeType)
        node.n = n
        _memput p, p.offset, node
 
        node = _memget(n, n.offset, nodeType)
        node.p = p
        _memput n, n.offset, node
 
        _memfree cur
end sub
 
sub nextNode (new as _mem, old as _mem)
        dim node as nodeType
 
        node = _memget(old, old.offset, nodeType)
        new = node.n
end sub
 
sub prevNode (new as _mem, old as _mem)
        dim node as nodeType
 
        node = _memget(old, old.offset, nodeType)
        new = node.p
end sub
 
function readNode$ (cur as _mem)
        dim node as nodeType
 
        node = _memget(cur, cur.offset, nodeType)
        if node.strLen = 0 then
                readNode$ = ""
                exit function
        end if
        s$ = string$(node.strLen, 0)
        _memget node.str, node.str.offset, s$
 
        readNode$ = s$
end sub
 
sub writeNode (cur as _mem, s$)
        dim node as nodeType
 
        'remove old string, freeing memory
        node = _memget(cur, cur.offset, nodeType)
        if node.strLen > 0 then _memfree node.str
 
        'add new string
        node.strLen = len(s$)
        if node.strLen > 0 then
                node.str = _memnew(len(s$))
                _memput node.str, node.str.offset, s$
        end if
        _memput cur, cur.offset, node
end sub
 
sub newList (new as listType)
        dim node as nodeType
 
        new.head = _memnew(len(node))
        new.tail = _memnew(len(node))
 
        s$ = "head"
        node.strLen = len(s$)
        node.str = _memnew(len(s$))
        node.n = new.tail
        node.p = new.tail
        _memput node.str, node.str.offset, s$
        _memput new.head, new.head.offset, node
 
        s$ = "tail"
        node.strLen = len(s$)
        node.str = _memnew(len(s$))
        node.n = new.head
        node.p = new.head
        _memput node.str, node.str.offset, s$
        _memput new.tail, new.tail.offset, node
end sub
 
sub printList (cur as listType)
        dim temp as _mem
 
        nextNode temp, cur.head
        do 
                if temp.offset = cur.tail.offset then exit do
 
                print readNode$ (temp)
                nextNode temp, temp
        loop
end sub
 
sub rmList (cur as listType)
        dim temp as _mem
        dim temp2 as _mem
 
        nextNode temp, cur.head
        do 
                if temp.offset = cur.tail.offset then exit do
 
                temp2 = temp
                nextNode temp, temp2
                rmNode temp2
        loop
 
        rmNode cur.head
        rmNode cur.tail
end sub
 
 

Title: Re: Lists Linking Demo
Post by: Pete on January 20, 2019, 11:01:44 am

Thanks for "pointing" out the C connection, V.

I read about that too, but I know next to nothing about the language, so I didn't want to chime in like I was some kind of authority. What I should have posted is from my limited reading, it appeared to me that the C language uses pointers and coined that phrase, "linked list" in association with putting data in nodes, which I assume are user determined memory locations. I would suspect people in that community would be more sensitive to how that term is defined when using other languages, especially ones like BASIC, which are not associated with using pointers. So the phrase, "What's in a name?" Well, maybe it is all up to who feels they have the most ownership of it. Something similar to this happened to me this morning when I was looking through Bing news and clicked on a headline about PGA Awards. I was expecting a golf article, but instead got some crap about "Producers Guild Awards."

Anyway, QB64 has the C _MEM keywords that bridge the gap into linked lists. I've haven't used those QB64 keywords yet, so thanks V, for posting a node example. It will take me awhile to get to it but hopefully not to long to absorb it. I have always had to rely on the technique I described in the last post or the rather elaborate use of arrays, which I believe that article I read stated was the next best way to link data in a non-pointer language.

Pete

Title: Re: Lists Linking Demo
Post by: SMcNeill on January 20, 2019, 11:32:47 am

Quote

It would be like calling badminton "basketball" because the ball is basket shaped, logical only if "basketball" wasn't the already established term that it is.

Maybe it’s just a regional thing; as I know us hillbillies have our own lingo, but the term I’m using is perfectly suitable around here, just as some places seem to call “soccer” as “football”, even though it’s obviously something different. I’ve never said a Linked List wasn’t used as you illustrate; I’ve just said it’s also had a different meaning as I’ve known it. Sometimes “football” is an oval shaped ball you throw in the air, sometimes it’s a circular ball hit with your head — yet, people are generally tolerant enough not to say, “Gee, you’re using that term wrong.”, or at least they’re willing to accept when told, “Well, that’s what we call the game here.”

Like I’ve mentioned, I’m more than willing to call the demo here by another name, if someone can suggest something better to describe what it’s doing. My biggest problem with folks complaining over the name is simply nobody has actually offered a suggestion of what it should be called.

I’m thinking of renaming it the “FIN GUT.BM LIBRARY — Fuck It, Nobody Gets to Use This, But Me LIBRARY.” If somebody ever wants to do something similar, let them do it themselves and call it whatever the hell they want.

Title: Re: Lists Linking Demo
Post by: Pete on January 20, 2019, 12:48:14 pm

I tried your new name but I got a "Duplicate Definition" error when I tried to run it.

Pete :D

Title: Re: Lists Linking Demo
Post by: TempodiBasic on January 20, 2019, 05:39:31 pm

Pete
What name do you search, in specific?
:-)

following your explanation about linked lists

Quote

Say we have 3 records...

1 Pete
2 Steve
3 Rick

now if we add the forth record "Bill"
in the original list we add at the end the new record...
Original List Desired List
1 Pete 1 Bill
2 Steve 2 Pete
3 Rick 3 Steve
4 Bill 4 Rick

stored in new variable tracking$ = "4|1|2|3" --> that is the index of Desired List
now we can order in increasing alphabetical AlphaIncrease$ = "4|1|3|2"
and we can order in decreasing alphabetical AlphaDecrese$ = "2|3|1|4"
and we can extract names including "i" NameI$ = "4|3"
and we can extract names including two "e" NameE$="1|2"
the thing becomes interesting....

Title: Re: Lists Linking Demo
Post by: Pete on January 20, 2019, 09:24:09 pm

Since you showed some interest in this method, I'll post some working code. It's pretty limited, but it will demonstrate how a tracking string would work...

T$ is the tracking string.
r is the record number in sequential order of entry.

Code: QB64: [Select]

separator$ = "|"
LOCATE , , 1, 7, 7
DO
    _LIMIT 30
    b$ = INKEY$
    IF b$ <> "" THEN
        yy% = CSRLIN
        SELECT CASE b$
            CASE CHR$(0) + "H"
                IF CSRLIN > 1 THEN LOCATE CSRLIN - 1
            CASE CHR$(0) + "P"
                IF CSRLIN < 4 THEN LOCATE CSRLIN + 1
            CASE "A" TO "z", "0" TO "9"
                IF a$(yy%) = "" AND r < 4 THEN
                    PRINT b$;
                    GOSUB text
                ELSE
                    BEEP ' For this demo, overwrite is not allowed. Only insert.
                END IF
            CASE CHR$(0) + "R" ' Insert Key
                IF r < 8 THEN ' Allow up to 8 lines with insert, 4 with just enter.
                    ' Move all entries one line down the screen.
                    PRINT SPACE$(80)
                    GOSUB getseed
                    DO
                        x$ = MID$(t$, seed%, INSTR(seed%, t$, separator$) - seed% + 1) ' Include separator to insure names are unique when concatenated.
                        PRINT SPACE$(80);
                        LOCATE , 1
                        PRINT a$(VAL(x$))
                        seed% = seed% + LEN(x$)
                    LOOP UNTIL seed% > LEN(t$)
                    LOCATE yy%, 1
                    b$ = ""
                    GOSUB text
                ELSE
                    BEEP ' Only allow 5 entries for this demo
                END IF
            CASE CHR$(9)
                CLS
                seed% = 1
                FOR i = 1 TO r
                    _DELAY .25
                    x$ = MID$(t$, seed%, INSTR(seed%, t$, separator$) - seed% + 1)
                    PRINT a$(VAL(x$))
                    seed% = seed% + LEN(x$)
                NEXT
                yy% = CSRLIN
                LOCATE 20, 1: PRINT t$
                LOCATE yy%
            CASE CHR$(27)
                SYSTEM
        END SELECT
    END IF
LOOP
 
getseed:
k% = 1: seed% = 1
FOR i% = 1 TO LEN(t$)
    IF k% = yy% THEN EXIT FOR
    IF MID$(t$, i%, 1) = separator$ THEN k% = k% + 1
NEXT
seed% = i%
RETURN
 
text:
LINE INPUT x$
LOCATE yy%, 1
r = r + 1
a$(r) = b$ + x$
GOSUB getseed
insert$ = separator$
t$ = MID$(insert$ + t$, 1, INSTR(seed%, insert$ + t$, separator$)) + LTRIM$(STR$(r)) + separator$ + MID$(insert$ + t$, INSTR(seed%, insert$ + t$, separator$) + 1)
IF insert$ <> "" THEN t$ = MID$(t$, 2): insert$ = ""
LOCATE 20, 1: PRINT "Tracking String = "; t$
LOCATE yy% + 1, 1 ' Move next line down
RETURN

Keys are type something and press ENTER. Works with Line Input function.
Insert something with INSERT key then type as usual. Stuff on screen under insert line will move down.
Use the TAB key to clear the screen and it wil print the order correctly, using the tracking string to decide the proper order.

Pete

Title: Re: Lists Linking Demo
Post by: _vince on January 21, 2019, 09:27:43 am

Quote from: Pete on January 20, 2019, 11:01:44 am

Thanks for "pointing" out the C connection, V.

I read about that too, but I know next to nothing about the language, so I didn't want to chime in like I was some kind of authority. What I should have posted is from my limited reading, it appeared to me that the C language uses pointers and coined that phrase, "linked list" in association with putting data in nodes, which I assume are user determined memory locations. I would suspect people in that community would be more sensitive to how that term is defined when using other languages, especially ones like BASIC, which are not associated with using pointers. So the phrase, "What's in a name?" Well, maybe it is all up to who feels they have the most ownership of it. Something similar to this happened to me this morning when I was looking through Bing news and clicked on a headline about PGA Awards. I was expecting a golf article, but instead got some crap about "Producers Guild Awards."

Anyway, QB64 has the C _MEM keywords that bridge the gap into linked lists. I've haven't used those QB64 keywords yet, so thanks V, for posting a node example. It will take me awhile to get to it but hopefully not to long to absorb it. I have always had to rely on the technique I described in the last post or the rather elaborate use of arrays, which I believe that article I read stated was the next best way to link data in a non-pointer language.

Pete

Nothing to do with C specifically, I have not mentioned C, these are general concepts applicable to all languages. _MEM is not a C keyword but a QB64 keyword.

QBasic/QB45 has pointers as well, they exist within the realm controlled by statements such as PEEK, POKE, VARPTR (variable pointer), VARSEG (variable segment), SADD (string address), VARPTR$, DEF SEG, and so on.

I am going to add a few entries related to _MEM to my QB64/FB dictionary.

Title: Re: Lists Linking Demo
Post by: STxAxTIC on January 22, 2019, 08:08:07 am

Looks like we institutionally forgot that I made a full-blown doubly linked list text editor in QB64 a few months ago - the qXed project. I halted the effort to make it a cheap emacs clone because the quality of my internet connection forbids me to test certain online features... however that's irrelevant for this. Like Vince said, a "real" one would use one entire string per node. This one uses one character per node for... certain reasons I can explain. Literally too much to talk about with this program, so I've stripped a few things down to show the basics here.

So HERE is a working example of a doubly-linked list in action. It's a fully-working text editor, but the learning curve is a little steep, and I haven't explained a damn thing so you will think it's full of bugs unless you discover simple stuff.

Code: QB64: [Select]

'$EXEICON:'qXedlogo.ico'
'$RESIZE:ON
 
'REM $Include: 'sxmath.bi'
'REM $Include: 'sxript.bi'
 
scrHand& = _NEWIMAGE(90, 30, 0)
SCREEN scrHand&
'_FREEIMAGE scrHand&
 
' Define fundamental structures.
TYPE Vector
    X AS INTEGER
    Y AS INTEGER
END TYPE
 
TYPE Cell
    Identity AS LONG
    Pointer AS LONG
    Lagger AS LONG
    Content AS STRING * 1
END TYPE
 
DIM SHARED ChainLimit AS LONG
DIM SHARED BOC AS LONG ' Beginning of chain.
DIM SHARED EOC AS LONG ' End of chain.
ChainLimit = 128000
BOC = -1
EOC = ChainLimit
 
' Define text window properties.
DIM SHARED WindowHeight
DIM SHARED WindowWidth
DIM SHARED VisibleLines
DIM SHARED TopIndent
DIM SHARED LeftIndent
DIM SHARED TextHeight
DIM SHARED TextWidth
DIM SHARED HScroll
DIM SHARED TextWrapping
DIM SHARED TextFormatting
DIM SHARED InsertKey
TopIndent = 1
LeftIndent = 1
WindowWidth = _WIDTH '
WindowHeight = _HEIGHT '- 2
TextHeight = WindowHeight - 2 * TopIndent
TextWidth = WindowWidth - 2 * LeftIndent
HScroll = 1
TextWrapping = 0
TextFormatting = -1
InsertKey = -1
 
' Initiate text inside window.
DIM SHARED StartIndex
DIM SHARED LineAsMapped(TextHeight) AS STRING
DIM SHARED Cursor1 AS Vector
DIM SHARED Cursor2 AS Vector
DIM SHARED ID1
DIM SHARED ID2
 
' Auxiliary 2D text grid.
DIM SHARED GOLSwitch
DIM SHARED AuxGrid(TextWidth, TextHeight, 2) AS STRING
GOLSwitch = -1
 
' Load text file into memory if applicable, use example string if not.
DIM SHARED FileName$
c$ = COMMAND$
IF (c$ <> "") THEN
    q$ = ""
    OPEN c$ FOR INPUT AS #1
    DO WHILE NOT EOF(1)
        LINE INPUT #1, r$
        q$ = q$ + r$ + CHR$(13)
    LOOP
    CLOSE #1
    i = INSTR(c$, ".")
    IF (i <> 0) THEN j = i - 1 ELSE j = LEN(c$)
    FileName$ = LEFT$(c$, j) + "-" + LTRIM$(RTRIM$(STR$(INT(TIMER)))) + ".txt"
    _TITLE FileName$
ELSE
    FileName$ = "Newfile" + "-" + DATE$ + "-" + LTRIM$(RTRIM$(STR$(INT(TIMER)))) + ".txt"
    q$ = "I sank to the floor. I [experienced] this hallucination of tumbling forward into these fractal geometric spaces made of light and then I found myself in the equivalent of the Pope's private chapel and there were insect elf machines proffering strange little tablets with strange writing on them, and I was aghast, completely appalled, because [in] a matter of seconds . . . my entire expectation of the nature of the world was just being shredded in front of me. I've never actually gotten over it. These self-transforming machine elf creatures were speaking in a colored language which condensed into rotating machines that were like Faberge eggs but crafted out of luminescent superconducting ceramics and liquid crystal gels. All this stuff was just so weird and so alien and so un-English-able that it was a complete shock - I mean, the literal turning inside out of [my] intellectual universe!" + CHR$(13) + CHR$(13) + "This went on for two or three minutes, this situation of [discontinuous] orthogonal dimensions to reality just engulfing me. As I came out of it and the room reassembled itself, I said, " + CHR$(34) + "I can't believe it, it's impossible." + CHR$(34) + " To call that a drug is ridiculous; that just means that you just don't have a word for it and so you putter around and you come upon this sloppy concept [that] something goes into your body and there's a change. It's not like that; it's like being struck by noetic lightning. [Note: " + CHR$(34) + "Noetic" + CHR$(34) + " derives from the theologian Pierre Teilhard de Chardin's " + CHR$(34) + "noosphere" + CHR$(34) + " - the collective consciousness of humankind conceived of as a sort of philosophical virtuality.]" + CHR$(13) + CHR$(13) + "[What] astonished me was [that] . . . in the carpets of Central Asia, in the myths of the Maya, in the visions of an Arcimboldi or a Fra Angelico or a Bosch, there is not a hint, not a clue, not an atom of the presence of this thing, This was more [multiplex] than the universe that we share with each other. It was the victory of Neo-Platonic metaphysics; everything [was] made out of a fourth-dimensional mosaic of energy. I was knocked off my feet, and set myself the goal of understanding this. There was really no choice, you see."
    'q$ = " "
END IF
 
_TITLE "qXed"
 
' Create memory space for string.                                      a
DIM SHARED TheChain(ChainLimit) AS Cell
 
' Create character list.
CALL Assimilate(q$)
 
' Prime main loop.
CALL MapText
CALL CalibrateCursor(ID1)
CALL CalibrateCursor(ID2)
CALL PrintEverything
 
DIM SHARED DEBUG$
 
' Main loop.
DO
    IF (StateChange = 1) THEN
        CALL PrintEverything
    END IF
 
    IF (GOLSwitch = 1) THEN
        CALL ConvertToGrid
        CALL GOL
        CALL ConvertFromGrid
        CALL MapText
        CALL PrintEverything
    END IF
 
    'IF _RESIZE = -1 THEN
    '    _DELAY .1
    '    oldimage& = scrHand&
    '    scrHand& = _NEWIMAGE(_RESIZEWIDTH / 8, _RESIZEHEIGHT / 16, 0)
    '    SCREEN scrHand&
    '    _FREEIMAGE oldimage&
    '    WindowWidth = INT(_RESIZEWIDTH / 8)
    '    WindowHeight = INT(_RESIZEHEIGHT / 16)
    '    TextHeight = WindowHeight - 2 * TopIndent
    '    TextWidth = WindowWidth - 2 * LeftIndent
    '    REDIM LineAsMapped(TextHeight)
    '    REDIM AuxGrid(TextWidth, TextHeight, 2)
    '    CALL MapText
    '    CALL CalibrateCursor(ID1)
    '    CALL CalibrateCursor(ID2)
    '    CALL PrintEverything
    'END IF
 
    _DISPLAY
    _LIMIT 120
LOOP
SYSTEM
 
SUB PrintEverything
    CLS
 
    c$ = "qXed" + " " + DEBUG$
    CALL DisplayText(1, 1, 11, 0, c$)
 
    ' Main text
    FOR i = 1 TO VisibleLines
        c$ = LineAsMapped(i)
        IF ((TextFormatting = 1) AND (TextWrapping <> 2)) THEN
            FOR j = 1 TO TextWidth - LEN(c$)
                c$ = c$ + "_"
            NEXT
        END IF
        d$ = MID$(c$, HScroll, TextWidth)
        CALL DisplayText(LeftIndent + 1, TopIndent + i, 7, 1, d$)
    NEXT
 
    ' Cursor2
    IF ((Cursor2.X > 0 AND Cursor2.X < WindowWidth) AND ((Cursor2.Y > 0) AND (Cursor2.Y < WindowHeight))) THEN
        p1 = LinearCount(StartIndex, ID1)
        p2 = LinearCount(StartIndex, ID2)
        pe = LinearCount(StartIndex, EOC)
        IF ((p2 > p1) AND (p2 < pe)) THEN
            c$ = TheChain(ID2).Content
            IF (c$ = " ") THEN c$ = "_"
            IF (c$ = CHR$(13)) THEN c$ = "~"
            CALL DisplayText(Cursor2.X, Cursor2.Y, 0, 6, c$)
        END IF
    END IF
 
    ' Cursor1
    IF ((Cursor1.X > 0 AND Cursor1.X < WindowWidth) AND ((Cursor1.Y > 0) AND (Cursor1.Y < WindowHeight))) THEN
        c$ = TheChain(ID1).Content
        IF (c$ = " ") THEN c$ = "_"
        IF (c$ = CHR$(13)) THEN c$ = "~"
        IF ((Cursor1.X = Cursor2.X) AND (Cursor1.Y = Cursor2.Y)) THEN
            a = 16: b = 5
        ELSE
            a = 16: b = 3
        END IF
        CALL DisplayText(Cursor1.X, Cursor1.Y, a, b, c$)
    END IF
 
    ' Cursor status
    d$ = TheChain(ID1).Content
    e$ = TheChain(ID2).Content
    IF ((ASC(d$) = 10) OR (ASC(d$) = 13)) THEN d$ = "~"
    IF ((ASC(e$) = 10) OR (ASC(e$) = 13)) THEN e$ = "~"
    IF (ASC(d$) = 32) THEN d$ = "_"
    IF (ASC(e$) = 32) THEN e$ = "_"
    c$ = "(" + LTRIM$(RTRIM$(STR$(Cursor1.X - LeftIndent))) + "," + LTRIM$(RTRIM$(STR$(Cursor1.Y - TopIndent))) + ":" + " " + LTRIM$(RTRIM$(d$)) + " " + LTRIM$(RTRIM$(STR$(ID1))) + ")"
    a = 0: b = 3
    IF ((Cursor1.X = Cursor2.X) AND (Cursor1.Y = Cursor2.Y)) THEN
        a = 15: b = 5
    END IF
    CALL DisplayText(2, WindowHeight, a, b, c$)
    g$ = "(" + LTRIM$(RTRIM$(STR$(Cursor2.X - LeftIndent))) + "," + LTRIM$(RTRIM$(STR$(Cursor2.Y - TopIndent))) + ":" + " " + LTRIM$(RTRIM$(e$)) + " " + LTRIM$(RTRIM$(STR$(ID2))) + ")"
    a = 6: b = 0
    IF (LinearCount(StartIndex, ID2) > LinearCount(StartIndex, ID1)) THEN
        a = 0: b = 6
    END IF
    CALL DisplayText(3 + LEN(c$), WindowHeight, a, b, g$)
    ' Horizontal scrollbar
    p = LinearCount(NthP(StartIndex, FindID(LeftIndent + 1, Cursor1.Y)), ID1)
    q = LEN(LineAsMapped(Cursor1.Y - TopIndent))
    r = p / q
    IF r > 1 THEN r = 1
    IF r < 0 THEN r = 0
    i = 2 + INT(r * (WindowWidth - 2))
    IF i < 1 THEN i = 1
    IF i > WindowWidth THEN i = WindowWidth
    CALL DisplayText(i, WindowHeight - 1, 8, 7, "^")
 
    ' Vertical scrollbar
    p = LinearCount(ID1, NthP(ID1, ChainLimit + 1))
    q = LinearCount(NthL(ID1, ChainLimit + 1), NthP(ID1, ChainLimit + 1))
    IF (q = 0) THEN r = 1 ELSE r = 1 - p / q
    CALL DisplayText(WindowWidth, 1 + INT(r * (WindowHeight - 1)), 8, 7, "<")
 
    ' Help
    SELECT CASE TextWrapping
        CASE 0: d$ = "Square"
        CASE 1: d$ = "Fluid"
        CASE 2: d$ = "None"
    END SELECT
    c$ = "[F6=Save] [F11=Format] [F12=Wrap: " + d$ + "]"
    IF (TextWrapping = 2) THEN c$ = "[F1/2=HScroll] " + c$
    c$ = c$ + STR$(INT(100 * r)) + "%"
    IF (LEN(c$) >= TextWidth) THEN c$ = LEFT$(c$, TextWidth)
    CALL DisplayText(WindowWidth - LEN(c$), 1, 15, 0, c$)
    c$ = "[Esc=Sync] [Mouse2=Copy] [Mouse3=Paste]"
    IF (InsertKey = 1) THEN c$ = "[Ins] " + c$
    IF (LEN(c$) >= TextWidth) THEN c$ = LEFT$(c$, TextWidth)
    CALL DisplayText(WindowWidth - LEN(c$), WindowHeight, 15, 0, c$)
 
    ' Pointer
    IF ((_MOUSEX >= 1) AND (_MOUSEX <= WindowWidth) AND (_MOUSEY >= 1) AND (_MOUSEY <= WindowHeight)) THEN
        a$ = CHR$(SCREEN(_MOUSEY, _MOUSEX))
        CALL DisplayText(_MOUSEX, _MOUSEY, 0, 15, a$)
    END IF
 
    COLOR 15, 0
 
END SUB
 
SUB Assimilate (a AS STRING)
    ' Load a string to initialize chain.
    FOR k = 1 TO ChainLimit
        TheChain(k).Identity = 0
    NEXT
    StartIndex = 1
    PreviousIdentity = BOC
    NextIdentity = NextOpenIdentity(StartIndex)
    FOR k = 1 TO LEN(a)
        j = NextIdentity
        TheChain(j).Identity = j
        TheChain(j).Content = ReFormat$(MID$(a, k, 1))
        TheChain(j).Lagger = PreviousIdentity
        PreviousIdentity = j
        IF (k < LEN(a)) THEN
            NextIdentity = NextOpenIdentity(j)
            TheChain(j).Pointer = NextIdentity
        ELSE
            TheChain(j).Pointer = EOC
        END IF
        PRINT TheChain(j).Content
    NEXT
    ID1 = StartIndex
    ID2 = NthP(ID1, ChainLimit + 1)
END SUB
 
FUNCTION ReFormat$ (a AS STRING)
    c$ = a
    IF c$ = CHR$(10) THEN c$ = CHR$(13)
    IF c$ = CHR$(9) THEN c$ = "    "
    ReFormat = c$
END FUNCTION
 
FUNCTION NthP (a AS LONG, b AS LONG)
    ' Returns the address that is b jumps ahead of address a.
    i = a
    IF (i <> EOC) THEN
        k = 0
        j = 0
        DO WHILE (k < b)
            k = k + 1
            j = TheChain(i).Identity
            i = TheChain(j).Pointer
            IF (i = EOC) THEN EXIT DO
        LOOP
    END IF
    NthP = j
END FUNCTION
 
FUNCTION NthPC (a AS LONG, b AS STRING)
    ' Returns the address holding b first enLinearCountered from a.
    i = a
    DO
        j = TheChain(i).Identity
        i = TheChain(j).Pointer
        IF (TheChain(j).Content = b) THEN EXIT DO
        IF (i = EOC) THEN
            j = BOC
            EXIT DO
        END IF
    LOOP
    NthPC = j
END FUNCTION
 
FUNCTION NthL (a AS LONG, b AS LONG)
    ' Returns the address that is b jumps behind address a.
    i = a
    k = 0
    DO WHILE k < b
        k = k + 1
        j = TheChain(i).Identity
        i = TheChain(j).Lagger
        IF (i = BOC) THEN EXIT DO
    LOOP
    NthL = j
END FUNCTION
 
FUNCTION NextOpenIdentity (a AS LONG)
    ' Returns first nonzero identity.
    FOR j = a TO ChainLimit
        IF (TheChain(j).Identity = 0) THEN EXIT FOR
    NEXT
    IF (j > ChainLimit) THEN
        PRINT "Out of memory: "; ChainLimit
        SLEEP
        SYSTEM
    END IF
    NextOpenIdentity = j
END FUNCTION
 
FUNCTION BackBreak (a AS LONG)
    ' Function for scrolling up.
    j = a
    lastbreak = 0
    c$ = ""
    DO
        IF (j = BOC) THEN EXIT DO
        k = TheChain(j).Lagger
        IF (k = BOC) THEN
            lastbreak = j
            EXIT DO
        END IF
        j = k
        d$ = TheChain(j).Content
        IF ((TextWrapping = 1) AND (d$ = " ")) THEN lastbreak = j
        c$ = d$ + c$
        IF (TextWrapping <> 2) AND (LEN(c$) = TextWidth) THEN EXIT DO
        IF (d$ = CHR$(13)) THEN EXIT DO
    LOOP
    IF (lastbreak <> 0) THEN j = TheChain(lastbreak).Identity
    BackBreak = j
END FUNCTION
 
SUB InsertBefore (a AS LONG, b AS STRING)
    ' Inserts a single cell before address a in the chain.
    j = NextOpenIdentity(a)
    al = TheChain(a).Lagger
    TheChain(j).Identity = j
    TheChain(j).Pointer = a
    TheChain(j).Lagger = al
    TheChain(j).Content = ReFormat$(b)
    TheChain(a).Lagger = j
    IF (al = BOC) THEN StartIndex = j ELSE TheChain(al).Pointer = j
END SUB
 
SUB InsertAfter (a AS LONG, b AS STRING)
    ' Inserts a single cell after address a in the chain.
    j = NextOpenIdentity(a)
    ap = TheChain(a).Pointer
    TheChain(j).Identity = j
    TheChain(j).Pointer = ap
    TheChain(j).Lagger = a
    TheChain(j).Content = ReFormat$(b)
    TheChain(a).Pointer = j
    IF (ap <> EOC) THEN TheChain(ap).Lagger = j
END SUB
 
SUB InsertRange (a AS LONG, b AS STRING)
    ' Inserts a sub-chain anywhere.
    FOR k = 1 TO LEN(b)
        c$ = MID$(b, k, 1)
        CALL InsertBefore(a, c$)
    NEXT
END SUB
 
SUB UnlinkCell (a AS LONG)
    ' Remove single cell from chain and clear identity.
    ap = TheChain(a).Pointer
    al = TheChain(a).Lagger
    IF ((ap = EOC) AND (al = BOC)) THEN
        TheChain(a).Content = " "
        'ID1 = a
        'ID2 = ID1
    ELSE
        TheChain(a).Identity = 0
        IF ((ap <> EOC) AND (al <> BOC)) THEN
            TheChain(al).Pointer = ap
            TheChain(ap).Lagger = al
        END IF
        IF (ap = EOC) THEN TheChain(al).Pointer = EOC
        IF (al = BOC) THEN
            StartIndex = ap
            TheChain(ap).Lagger = BOC
        END IF
    END IF
END SUB
 
SUB UnlinkRange (a AS LONG, b AS LONG)
    ' Remove sub-chain and clear identity of each cell.
    bp = TheChain(b).Pointer
    al = TheChain(a).Lagger
    IF ((al = BOC) AND (bp = EOC)) THEN
        CALL UnlinkRange(NthP(a, 2), b)
        TheChain(a).Content = " "
        TheChain(a).Pointer = bp
    ELSE
        k = a
        DO WHILE ((k <> b) AND (k <> EOC))
            TheChain(k).Identity = 0
            k = TheChain(k).Pointer
        LOOP
        TheChain(b).Identity = 0
        TheChain(bp).Lagger = al
        IF (al = BOC) THEN StartIndex = bp ELSE TheChain(al).Pointer = bp
    END IF
END SUB
 
FUNCTION LinearCount (a AS LONG, b AS LONG)
    ' Returns number of links between two addresses.
    i = a
    k = 0
    DO WHILE (i <> b)
        k = k + 1
        j = TheChain(i).Identity
        i = TheChain(j).Pointer
        IF (i = EOC) THEN EXIT DO
    LOOP
    LinearCount = k
END FUNCTION
 
FUNCTION LinearCount2 (a AS LONG, b AS LONG, c AS LONG)
    ' Returns number of links between two addresses, with exit condition.
    i = a
    k = 0
    DO WHILE (i <> b)
        k = k + 1
        j = TheChain(i).Identity
        i = TheChain(j).Pointer
        IF (i = EOC) THEN EXIT DO
        IF (k = c) THEN EXIT DO
    LOOP
    LinearCount2 = k
END FUNCTION
 
FUNCTION Projection$ (a AS LONG, b AS LONG)
    ' Returns the linear content for all address between a and b, inclusive.
    DIM TheReturn AS STRING
    TheReturn = ""
    IF (a = b) THEN
        TheReturn = TheChain(a).Content
    ELSE
        j = a
        DO
            c$ = TheChain(j).Content
            TheReturn = TheReturn + c$
            k = TheChain(j).Pointer
            IF (j = b) THEN EXIT DO
            IF (k = EOC) THEN EXIT DO
            j = k
        LOOP
    END IF
    Projection$ = TheReturn
END SUB
 
SUB MapText
    IF (TextFormatting = 1) THEN br$ = "~" ELSE br$ = " "
    j = StartIndex
    i = 1
    q$ = ""
    d$ = ""
    DO ' Begin with any left-over text from previous iteration.
        q$ = d$
        d$ = ""
        r = TextWidth - LEN(q$)
        IF (TextWrapping <> 2) THEN k1 = NthP(j, r) ELSE k1 = EOC
        k2 = NthPC(j, CHR$(13))
        IF (TextWrapping <> 2) THEN c1 = LinearCount(j, k1) ELSE c1 = LinearCount2(j, k1, TextWidth * TextHeight)
        c2 = LinearCount(j, k2)
        IF (c2 = 0) THEN ' Line is blank-returned.
            k = k2
            q$ = q$ + br$
            j = NthP(k, 2)
        ELSE
            IF (c1 = c2) THEN ' Possible end of chain.
                k = TheChain(k1).Lagger
                q$ = q$ + Projection$(j, k)
                j = NthP(k, 2)
            END IF
            IF (c1 < c2) THEN ' Width limit case (not always maximum).
                k = k1
                q$ = q$ + Projection$(j, k)
                j = NthP(k, 2)
            END IF
            IF (c1 > c2) THEN ' Break return somewhere in line (not first).
                k = k2
                q$ = q$ + Projection$(j, TheChain(k).Lagger) + br$
                n = TheChain(k).Pointer
                IF (n <> EOC) THEN j = n
            END IF
        END IF
        IF (TextWrapping = 1) THEN ' Wrap text at first space from right, send remainder to next line.
            IF (LEN(q$) >= TextWidth) THEN
                FOR m = LEN(q$) TO 1 STEP -1
                    c$ = MID$(q$, m, 1)
                    IF (c$ = " ") OR (c$ = "-") THEN
                        q$ = LEFT$(q$, m)
                        EXIT FOR
                    END IF
                    d$ = c$ + d$
                    IF (m = 1) THEN ' Line is too long for allowed space and contains no wrapping characters.
                        q$ = LEFT$(q$, TextWidth)
                        d$ = ""
                        EXIT FOR
                    END IF
                NEXT
            END IF
        END IF
        LineAsMapped(i) = q$
        i = i + 1
        IF (i >= TextHeight) THEN EXIT DO
        IF (j = k) THEN EXIT DO
    LOOP
    VisibleLines = i - 1
END SUB
 
FUNCTION StateChange
    DIM TheReturn
    MH = 0
    MW = 0
    MT = 0
    DO WHILE _MOUSEINPUT
        MH1 = _MOUSEBUTTON(1)
        MH2 = _MOUSEBUTTON(2)
        MH3 = _MOUSEBUTTON(3)
        MW = _MOUSEWHEEL
        IF (MW <> 0) THEN MT = MW
    LOOP
    MW = MT
 
    IF (MH1 = -1) THEN
        ' Move Cursor1 among text.
        MH = 1
        IF ((_MOUSEX > LeftIndent) AND (_MOUSEX < TextWidth + LeftIndent + 1) AND (_MOUSEY > TopIndent) AND (_MOUSEY < TopIndent + TextHeight)) THEN
            Cursor1.X = _MOUSEX
            q = LeftIndent + LEN(LineAsMapped(_MOUSEY - TopIndent))
            IF (Cursor1.X > q) THEN Cursor1.X = q
            Cursor1.Y = _MOUSEY
            CALL ReassignID1
        END IF
        ' Move by vertical scrollbar.
        IF (_MOUSEX = WindowWidth) THEN
            i = NthL(ID1, ChainLimit + 1)
            j = NthP(ID1, ChainLimit + 1)
            IF (_MOUSEY = WindowHeight) THEN i = j
            IF (_MOUSEY > 1) AND (_MOUSEY < WindowHeight) THEN
                t = LinearCount(i, j)
                f = _MOUSEY / WindowHeight
                FOR k = 1 TO t
                    IF (k / t >= f) THEN EXIT FOR
                    i = TheChain(i).Pointer
                NEXT
            END IF
            StartIndex = i
            ID1 = i
        END IF
        ' Move by horizontal scrollbar.
        IF (_MOUSEY = WindowHeight - 1) THEN
            j = ID1
            i = NthP(StartIndex, FindID(LeftIndent + 1, Cursor1.Y))
            'IF (_MOUSEX = windowwidth - 1) THEN i = NthP(StartIndex, FindID(LeftIndent + LEN(LineAsMapped(Cursor1.Y - TopIndent)), Cursor1.Y) + (HScroll - 1))
            IF (_MOUSEX > 1) AND (_MOUSEX < WindowWidth) THEN
                t = LEN(LineAsMapped(Cursor1.Y - TopIndent))
                f = _MOUSEX / WindowWidth
                FOR k = 1 TO t
                    IF (k / t >= f) THEN EXIT FOR
                    i = TheChain(i).Pointer
                NEXT
            END IF
            ID1 = i
            d = LinearCount(StartIndex, i) - LinearCount(StartIndex, j)
            IF (TextWrapping = 2) THEN HScroll = HScroll + d
            IF HScroll < 1 THEN HScroll = 1
        END IF
    END IF
    IF (MH2 = -1) THEN
        ' Move Cursor2 and copy anything between Cursor1 and Cursor2 to clipboard.
        MH = 1
        IF (_MOUSEX > LeftIndent) AND (_MOUSEX < TextWidth + LeftIndent + 1) AND (_MOUSEY > TopIndent) AND (_MOUSEY < TopIndent + TextHeight + 1) THEN
            Cursor2.X = _MOUSEX
            q = LeftIndent + LEN(LineAsMapped(_MOUSEY - TopIndent))
            IF (Cursor2.X > q) THEN Cursor2.X = q
            Cursor2.Y = _MOUSEY
            CALL ReassignID2
            IF (LinearCount(StartIndex, ID2) > LinearCount(StartIndex, ID1)) THEN _CLIPBOARD$ = Projection$(ID1, ID2)
        END IF
    END IF
    IF (MH3 = -1) THEN
        ' Paste at Cursor1 position.
        MH = 1
        'IF (LinearCount(StartIndex, ID2) >= LinearCount(StartIndex, ID1)) THEN
        CALL InsertRange(ID1, _CLIPBOARD$)
    END IF
    IF (MW = -1) THEN
        ' Wheel up
        MH = 1
        StartIndex = BackBreak(StartIndex)
        CALL ReassignID1
    END IF
    IF (MW = 1) THEN
        ' Wheel down
        MH = 1
        IF (VisibleLines > 1) THEN
            StartIndex = NthP(StartIndex, LEN(LineAsMapped(1)) + 1)
            CALL MapText
        END IF
        CALL ReassignID1
    END IF
 
    KH = 0
    '''k$ = ""
    '''k$ = INKEY$
    '''IF k$ <> "" THEN KH = ASC(k$)
    KH = _KEYHIT
 
    ' Bksp
    IF (KH = 8) THEN
        r = TheChain(ID1).Pointer
        q = TheChain(ID1).Lagger
        CALL UnlinkCell(ID1)
        IF ((r = EOC) AND (q = BOC)) THEN
        ELSE
            IF (q <> BOC) THEN ID1 = q ELSE ID1 = r
            IF (r = EOC) THEN ID2 = ID1
        END IF
    END IF
    ' Tab
    IF (KH = 9) THEN CALL InsertRange(ID1, "    ")
    ' Esc
    IF (KH = 27) THEN
        IF (ID2 <> ID1) THEN ID2 = ID1 ELSE ID2 = StartIndex 'NthL(ID2, 2)
    END IF
    ' Enter, Alphanumerics
    IF (KH = 13) OR ((KH >= 32) AND (KH <= 126)) THEN
        IF (InsertKey = -1) THEN
            IF (ID1 = ID2) THEN
                CALL InsertBefore(ID1, LTRIM$(RTRIM$(CHR$(KH))))
            ELSE
                CALL InsertAfter(ID1, LTRIM$(RTRIM$(CHR$(KH))))
                ID1 = NthP(ID1, 2)
            END IF
        ELSE
            TheChain(ID1).Content = LTRIM$(RTRIM$(CHR$(KH)))
            IF (ID1 = ID2) THEN
                ID1 = NthP(ID1, 2)
                ID2 = ID1
            ELSE
                ID1 = NthP(ID1, 2)
            END IF
        END IF
        IF ((TextWrapping = 2) AND (Cursor1.X - LeftIndent = TextWidth)) THEN HScroll = HScroll + 1
    END IF
    ' F1
    IF (KH = 15104) THEN
        IF (TextWrapping = 2) THEN
            HScroll = HScroll - 1
            IF (HScroll < 1) THEN HScroll = 1
            CALL ReassignID1
            CALL ReassignID2
        END IF
    END IF
    ' F2
    IF (KH = 15360) THEN
        IF (TextWrapping = 2) THEN
            HScroll = HScroll + 1
            CALL ReassignID1
            CALL ReassignID2
        END IF
    END IF
    ' F5
    IF (KH = 16128) THEN
        q$ = Projection$(NthL(ID1, ChainLimit + 1), NthP(ID1, ChainLimit + 1))
        Assimilate q$
    END IF
    ' F4
    'IF (KH = 15872) THEN
    'CALL InsertRange(NthP(ID2, 2), CHR$(10) + "=" + CoreProcess$(Projection(ID1, ID2)))
    'CALL InsertRange(NthP(ID2, 2), CHR$(10) + "=" + SxriptEval$(Projection(ID1, ID2)))
    'ID2 = StartIndex
    'END IF
    ' F6
    IF (KH = 16384) THEN
        OPEN FileName$ FOR OUTPUT AS #1
        q$ = Projection$(NthL(ID1, ChainLimit + 1), NthP(ID1, ChainLimit + 1))
        PRINT #1, q$
        CLOSE #1
    END IF
    ' F7
    IF (KH = 16640) THEN
        GOLSwitch = -GOLSwitch
    END IF
    ' F8 IF (KH = 16896) THEN
    ' Home
    IF (KH = 18176) THEN
        IF (TextWrapping = 2) THEN HScroll = 1
        Cursor1.X = LeftIndent + 1
        CALL ReassignID1
    END IF
    ' UpArrow
    IF (KH = 18432) THEN
        IF (Cursor1.Y > TopIndent + 1) THEN
            Cursor1.Y = Cursor1.Y - 1
        ELSE
            StartIndex = BackBreak(StartIndex)
        END IF
        q = LEN(LineAsMapped(Cursor1.Y - TopIndent)) + 1
        IF (Cursor1.X > q) THEN Cursor1.X = q
        CALL ReassignID1
    END IF
    ' PgUp
    IF (KH = 18688) THEN
        FOR k = 1 TO INT(TextHeight / 2)
            StartIndex = BackBreak(StartIndex)
        NEXT
        CALL ReassignID1
    END IF
    ' LeftArrow
    IF (KH = 19200) THEN
        ID1 = NthL(ID1, 2)
        IF (TextWrapping = 2) THEN
            IF (Cursor1.X = LeftIndent + 1) THEN
                IF (HScroll > 1) THEN
                    HScroll = HScroll - 1
                ELSE
                    j = Cursor1.Y - TopIndent - 1
                    IF (j >= 1) THEN
                        k = LEN(LineAsMapped(j)) - TextWidth + 1
                        IF (k >= 1) THEN
                            HScroll = k
                        END IF
                    END IF
                END IF
            END IF
        ELSE
            IF ((Cursor1.X - LeftIndent = 1) AND Cursor1.Y - TopIndent = 1) THEN
                StartIndex = BackBreak(StartIndex)
            END IF
        END IF
    END IF
    ' RightArrow
    IF (KH = 19712) THEN
        ID1 = NthP(ID1, 2)
        m = Cursor1.X - LeftIndent
        n = LEN(LineAsMapped(Cursor1.Y - TopIndent)) - HScroll + 1
        IF (TextWrapping = 2) THEN
            IF (m >= TextWidth) THEN
                HScroll = HScroll + 1
                CALL ReassignID1
            END IF
            IF (m >= n) THEN
                j = Cursor1.Y - TopIndent + 1
                IF ((j <= TextHeight) AND (VisibleLines > 1)) THEN HScroll = 1
            END IF
        ELSE
            IF ((m >= n) AND (Cursor1.Y - TopIndent = VisibleLines)) THEN
                IF (VisibleLines > 1) THEN StartIndex = NthP(StartIndex, LEN(LineAsMapped(1)) + 1)
            END IF
        END IF
    END IF
    ' End
    IF (KH = 20224) THEN
        Cursor1.X = LeftIndent + LEN(LineAsMapped(Cursor1.Y - TopIndent))
        CALL ReassignID1
        IF (TextWrapping = 2) THEN
            q = LEN(LineAsMapped(Cursor1.Y - TopIndent)) - TextWidth + 1
            IF (q >= 1) THEN HScroll = q
        END IF
    END IF
    ' DownArrow
    IF (KH = 20480) THEN
        IF (Cursor1.Y = TopIndent + VisibleLines) THEN
            IF (VisibleLines > 1) THEN
                StartIndex = NthP(StartIndex, LEN(LineAsMapped(1)) + 1)
                CALL MapText
            END IF
        ELSE
            Cursor1.Y = Cursor1.Y + 1
        END IF
        q = LEN(LineAsMapped(Cursor1.Y - TopIndent)) + 1
        IF (Cursor1.X > q) THEN
            Cursor1.X = q
        END IF
        CALL ReassignID1
    END IF
    ' PgDn
    IF (KH = 20736) THEN
        FOR k = 1 TO INT(TextHeight / 2)
            IF (VisibleLines > 1) THEN
                StartIndex = NthP(StartIndex, LEN(LineAsMapped(1)) + 1)
                CALL MapText
            END IF
        NEXT
        CALL ReassignID1
    END IF
    ' Insert
    IF (KH = 20992) THEN
        InsertKey = -InsertKey
    END IF
    ' Del
    IF (KH = 21248) THEN
        IF (LinearCount(StartIndex, ID2) > LinearCount(StartIndex, ID1)) THEN
            r = TheChain(ID2).Pointer
            q = TheChain(ID1).Lagger
            p = ID1
            CALL UnlinkRange(ID1, ID2)
            IF ((r = EOC) AND (q = BOC)) THEN
                ID1 = p
                ID2 = ID1
                StartIndex = p
            ELSE
                IF (q <> BOC) THEN ID1 = q ELSE ID1 = r
                ID2 = NthP(ID1, 2)
            END IF
        END IF
    END IF
    ' F11
    IF (KH = 34048) THEN TextFormatting = -TextFormatting
    ' F12
    IF (KH = 34304) THEN
        TextWrapping = TextWrapping + 1
        IF (TextWrapping > 2) THEN TextWrapping = 0
        ID1 = StartIndex
        ID2 = ID1
        HScroll = 1
    END IF
    ' Exit sequence
    TheReturn = 0
    IF ((MH <> 0) OR (KH > 0)) THEN
        TheReturn = 1
        CALL MapText
        CALL CalibrateCursor(ID1)
        CALL CalibrateCursor(ID2)
        ' Cursor sync and autoscrolling.
        IF (Cursor1.Y > TopIndent + TextHeight - 1) THEN StartIndex = NthP(StartIndex, LEN(LineAsMapped(1)) + 1)
    END IF
    _KEYCLEAR
    StateChange = TheReturn
END FUNCTION
 
SUB CalibrateCursor (a AS LONG)
    ' Place Cursor under ID on rendered line.
    s = StartIndex
    IF ((TextWrapping = 2) AND (HScroll > 1)) THEN s = NthP(s, HScroll)
    c = LinearCount(s, a)
    k = 0
    i = -1
    FOR j = 1 TO VisibleLines
        n = LEN(LineAsMapped(j))
        IF (k + n < c) THEN
            k = k + n
        ELSE
            i = c - k + 1
            EXIT FOR
        END IF
    NEXT
    IF (i >= LeftIndent + LEN(LineAsMapped(j))) THEN
        IF (j <= VisibleLines) THEN
            i = 1
            j = j + 1
        END IF
    END IF
    IF (a = ID1) THEN
        Cursor1.X = LeftIndent + i
        Cursor1.Y = TopIndent + j
    END IF
    IF (a = ID2) THEN
        Cursor2.X = LeftIndent + i
        Cursor2.Y = TopIndent + j
    END IF
END SUB
 
FUNCTION FindID (a AS INTEGER, b AS LONG)
    ' Find identity under a map location.
    RelX = a - LeftIndent
    RelY = b - TopIndent
    FOR k = 1 TO RelY - 1
        t = t + LEN(LineAsMapped(k))
    NEXT
    t = t + RelX
    FindID = t
END FUNCTION
 
SUB ReassignID1
    ' Reassign identity under Cursor1.
    ID1 = NthP(StartIndex, FindID(Cursor1.X, Cursor1.Y) + (HScroll - 1))
END SUB
 
SUB ReassignID2
    ' Reassign identity under Cursor2.
    ID2 = NthP(StartIndex, FindID(Cursor2.X, Cursor2.Y) + (HScroll - 1))
END SUB
 
SUB ConvertToGrid
    FOR j = 1 TO VisibleLines
        c$ = LineAsMapped(j)
        FOR i = 1 TO LEN(c$) - 1 ' BR offset to exclude break return at line end.
            AuxGrid(i, j, 1) = MID$(c$, i, 1)
        NEXT
    NEXT
END SUB
 
SUB ConvertFromGrid
    q$ = ""
    FOR j = 1 TO VisibleLines
        FOR i = 1 TO LEN(LineAsMapped(j)) - 1
            q$ = q$ + AuxGrid(i, j, 1)
        NEXT
        q$ = q$ + CHR$(13) ' Undoes BR offset.
    NEXT
    Assimilate q$
END SUB
 
SUB GOL
    FOR j = 1 TO VisibleLines
        FOR i = 1 TO LEN(LineAsMapped(j)) - 1
            c$ = AuxGrid(i, j, 1)
            IF (c$ = " ") THEN c$ = "0" ELSE c$ = "1"
            AuxGrid(i, j, 1) = c$
            AuxGrid(i, j, 2) = c$
        NEXT
    NEXT
    FOR j = 2 TO VisibleLines - 2 ' BR offset.
        FOR i = 2 TO LEN(LineAsMapped(j)) - 2 ' BR offset.
            c$ = AuxGrid(i, j, 1)
            a1 = VAL(AuxGrid(i - 1, j + 1, 1))
            a2 = VAL(AuxGrid(i, j + 1, 1))
            a3 = VAL(AuxGrid(i + 1, j + 1, 1))
            a4 = VAL(AuxGrid(i - 1, j, 1))
            a6 = VAL(AuxGrid(i + 1, j, 1))
            a7 = VAL(AuxGrid(i - 1, j - 1, 1))
            a8 = VAL(AuxGrid(i, j - 1, 1))
            a9 = VAL(AuxGrid(i + 1, j - 1, 1))
            t = a1 + a2 + a3 + a4 + a6 + a7 + a8 + a9
            IF (c$ = "1") THEN
                SELECT CASE t
                    CASE IS < 2
                        AuxGrid(i, j, 2) = "0"
                    CASE 2
                        AuxGrid(i, j, 2) = "1"
                    CASE 3
                        AuxGrid(i, j, 2) = "1"
                    CASE IS > 3
                        AuxGrid(i, j, 2) = "0"
                END SELECT
            ELSE
                IF (t = 3) THEN AuxGrid(i, j, 2) = "1"
            END IF
        NEXT
    NEXT
    FOR j = 1 TO VisibleLines
        FOR i = 1 TO LEN(LineAsMapped(j)) - 1
            c$ = AuxGrid(i, j, 2)
            IF (c$ = "0") THEN c$ = " " ELSE c$ = CHR$(219)
            AuxGrid(i, j, 1) = c$
            AuxGrid(i, j, 2) = c$
        NEXT
    NEXT
END SUB
 
SUB ThrowOutput
    'i = NthP(ID1, ChainLimit + 1)
    'FOR k = 1 TO LogTextCount
    '    CALL InsertRange(i, LogText(k) + CHR$(13))
    'NEXT
    LogTextCount = 0
    CALL MapText
    ID1 = NthP(ID1, ChainLimit + 1)
    CALL CalibrateCursor(ID1)
    CALL CalibrateCursor(ID2)
    DO WHILE (Cursor1.Y > TopIndent + TextHeight - 1)
        StartIndex = NthP(StartIndex, LEN(LineAsMapped(1)) + 1)
        CALL MapText
        CALL CalibrateCursor(ID1)
        CALL CalibrateCursor(ID2)
    LOOP
    ID1 = NthP(ID1, ChainLimit + 1)
    CALL PrintEverything
END SUB
 
SUB DisplayText (Col AS INTEGER, Row AS INTEGER, Shade1 AS INTEGER, Shade2 AS INTEGER, Text AS STRING)
    COLOR Shade1, Shade2
    _PRINTSTRING (Col, Row), Text
    'LOCATE Row, Col: PRINT Text
END SUB
 
'REM $Include: 'sxmath.bm'
'REM $Include: 'sxript.bm'

Title: Re: Lists Linking Demo
Post by: _vince on January 22, 2019, 09:37:10 am

Interesting idea, STxExTIC. I've tried yours before, feels like a novel text editor concept, the next vim, stevesque one could even say. It would be interesting to see a clone of vi (way simpler than vim) in QB64 and your routines have all the functionality for it. Maybe Steve 's got something up his sleeve for the field of text editing, let us know by this eve.

FYI, my own LL routines could be repurposed to hold a single character per node like so:

Code: QB64: [Select]

type nodeType
  'remove this:
        'str as _mem
        'strLen as integer
  'for:
        c as string * 1
 
        n as _mem
        p as _mem
end type
 

then you would no longer need readNode$ and writeNode and so on. Handling a string per node takes up a large portion of the code as they're a separate data structure on their own to be allocated, reallocated, and deallocated.

Next thing I will investigate is LLs in freebasic which has the C-style pointer syntax which is very expressive for these kinds of data structures. Most of the LL functions are one liners. LLs can also be repurposed to act as stacks, queues, trees, and other list-like structures. Beyond LLs we have the countless variants of trees, networks, meshes and so on.

Title: Re: Lists Linking Demo
Post by: bplus on January 22, 2019, 10:50:51 am

I recognize "a linked list" as a special data structure that has some advantages over arrays specially as STxAxTIC and v have described and demonstrated with editors.

But getting back to what Steve was trying to show was a different kind of linking of lists. He didn't seem to take to ideas of databasing and the advanced database term "relational database", so I have another simpler term to try: Concatenate

Isn't Steve simply concatenating lists, adding one to another and showing manipulations of lists both individually and as a whole concatenated list. The tricky part I imagine, is dealing with mixing of different type lists.

Title: Re: Lists Linking Demo
Post by: SMcNeill on January 22, 2019, 12:55:06 pm

Quote from: bplus on January 22, 2019, 10:50:51 am

Isn't Steve simply concatenating lists, adding one to another and showing manipulations of lists both individually and as a whole concatenated list. The tricky part I imagine, is dealing with mixing of different type lists.

It isn’t really concatenation, as the lists “link” element by element. “Links things together in a chain or series...”

So a list of “1, 2, 3, 4” concatetaned with “5, 6, 7, 8” produces “1,2,3,4,5,6,7,8”... Think “dog” + “food” = “dog-food”.

This takes those 2 lists and “links” them so “1 - 5”, “2 - 6”, “3 - 7”, “4 - 8” all share the same properties and work and behave alike.

What we’re doing here is Linking Relational Database Tables — https://www.relationaldbdesign.com/relational-database-design/module2/linking-relational-database-tables.php.

Quote

The power of relational databases stems from the fact that tables can be linked, enabling users to gain access to data across tables.

Two tables are linked when they have a matching field, that is, a field in each table containing similar data.

And that’s what the demo here does for us. It just doesn’t seem to me that “Linking Relational Database Table Management Library” comes across as a BASIC sounding name, so “Linked Table Library” (or “Linked List Library” as I like to call it since a “LIST” *is* just a table with a single column of information) seems much simpler and more appropriate to me.

Text Only | Text with Attachments

QB64.org Forum

Active Forums => Programs => Topic started by: SMcNeill on January 17, 2019, 10:32:01 am