How to resolve the algorithm ASCII art diagram converter step by step in the AutoHotkey programming language

Published on 12 May 2024 09:40 PM
#Autohotkey

How to resolve the algorithm ASCII art diagram converter step by step in the AutoHotkey programming language

Table of Contents

Problem Statement

Given the RFC 1035 message diagram from Section 4.1.1 (Header section format) as a string: http://www.ietf.org/rfc/rfc1035.txt Where (every column of the table is 1 bit): Write a function, member function, class or template that accepts a similar multi-line string as input to define a data structure or something else able to decode or store a header with that specified bit structure. If your language has macros, introspection, code generation, or powerful enough templates, then accept such string at compile-time to define the header data structure statically. Such "Header" function or template should accept a table with 8, 16, 32 or 64 columns, and any number of rows. For simplicity the only allowed symbols to define the table are + - | (plus, minus, pipe), and whitespace. Lines of the input string composed just of whitespace should be ignored. Leading and trailing whitespace in the input string should be ignored, as well as before and after each table row. The box for each bit of the diagram takes four chars "+--+". The code should perform a little of validation of the input string, but for brevity a full validation is not required. Bonus: perform a thoroughly validation of the input string.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm ASCII art diagram converter step by step in the AutoHotkey programming language

Source code in the autohotkey programming language

Header := "
(LTrim
    +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
    |                      ID                       |
    +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
    |QR|   Opcode  |AA|TC|RD|RA|   Z    |   RCODE   |
    +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
    |                    QDCOUNT                    |
    +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
    |                    ANCOUNT                    |
    +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
    |                    NSCOUNT                    |
    +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
    |                    ARCOUNT                    |
    +--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
)"

Data := "78477BBF5496E12E1BF169A4"
MsgBox % result := ASCII_art_diagram_converter(Header, Data)
return

ASCII_art_diagram_converter(Header, Data){
    oDataBin := []
    for i, h in StrSplit(Data)
        for i, v in StrSplit(SubStr("0000" . ConvertBase(16, 2, h), -3))
            oDataBin.Push(v)

    bitWidth := StrLen(StrSplit(Header, "+").2) + 1
    prevW := 0
    result := "Name`t`tSize`tBinary"
    for i, line in StrSplit(Header, "`n", "`r")
    {
        if Mod(A_Index, 2)
            continue
        strtPos := 0
        loop
        {
            if w := (strtPos := InStr(line, "|",, ++strtPos)) // bitWidth
            {
                b := ""
                loop % width := w - prevW
                    b .= oDataBin.RemoveAt(1)
                result .= "`n" Trim(StrSplit(line, "|")[A_Index]) "`t`t" width . "`t" b
            }
            prevW := w
        }
        until !strtPos
    }
    return result
}

ConvertBase(InputBase, OutputBase, nptr){ ; Base 2 - 36 ; https://www.autohotkey.com/boards/viewtopic.php?t=3925#p21143
    static u := A_IsUnicode ? "_wcstoui64" : "_strtoui64"
    static v := A_IsUnicode ? "_i64tow"    : "_i64toa"
    VarSetCapacity(s, 66, 0)
    value := DllCall("msvcrt.dll\" u, "Str", nptr, "UInt", 0, "UInt", InputBase, "CDECL Int64")
    DllCall("msvcrt.dll\" v, "Int64", value, "Str", s, "UInt", OutputBase, "CDECL")
    return s
}

You may also check:How to resolve the algorithm Playing cards step by step in the PureBasic programming language
You may also check:How to resolve the algorithm Walk a directory/Recursively step by step in the zkl programming language
You may also check:How to resolve the algorithm Terminal control/Clear the screen step by step in the Jsish programming language
You may also check:How to resolve the algorithm Pell numbers step by step in the Wren programming language
You may also check:How to resolve the algorithm Filter step by step in the BBC BASIC programming language