Snow White Spinderula waked up after corona crisis, 7 dwarfs arround her and a lot of things disappeared

There was a girl named "Snow White Spinderula", who awaked from a stunned, cryostatic, petrified, paralyzed state, because she ate the forbidden fruit of knowledge from the apple tree in the garden of paradise and a piece of apple got stuck in her throat. 

Snow White Spinderula spits out the piece of apple, breathes and feels permeated again by the fresh and active spirit of life, recognizing that 7 dwarves standing around her.

Bit by bit she realizes now that many different things in the current world have disappeared or gone for ever and that this had nothing at all to do with the 7 dwarfs keeping an eye on her.

Disintegrated, disappeared, died ot transformed to void

Feminist internet blogs, groups and communities in social media

Microsoft Windows Phone

Small left parties, autonomous groups and comunity based projects

Autonomous left groups, community based left groups and projects and small left parties,

for example the Pirate Party, Europe anders, ...

A lot of internet media  blogs in right, conservative and liberal spectrum were gone

Also a lot of conservative, right wing and liberal blogs moved to virtual graveyard also known as /dev/null or Nirvana.

It's sad to see many blogs from reasonable moderate-citizen first disappeared and in result of that disappearance many rescrictions by law were made against "more radical" groups:

It's so sad to realize, that so many groups from the left or middle-class spectrum of society disappeared, shut down their internet presence and blogs and let themselves be pushed out and no longer dared to express their opinion freely in public space or on main stream channels of the internet.

A lot of things concerning software, system and kernel programming

Some epic threats in newsnet (NNTP) newsgroups
Some very passionate discussions in the linux kernel newsgroup between Linus Torvalds and Alan Cox concerning sync before close, fbarrier as alternative to fsync with funny swipes to Alans work at Intel and drinking same kool-aid as other hardware cpu programmers.

Integration of NIS (Network Information Sytem originally called Yellow Pages) in latest apple OS.

Some projects on freshmeat.net sourceforge.net knowledge to use UDP for large - huge amount of data and the intention to develope a symmetric, asymmetric or certificate based standardized encryption for  all services based on UDP.

Realization that everything (file transfer, authentication, authorization including claims and bearer tokens, web services instead of old style Sun RPC or modern gRPC, VPN, ...) over HTTPS  might not be always the ideal solution and best practice and could be realized more service oriented otherwise.

Development of a more reliable driver and toolkit for mounting btrfs, ext2-4, xfs zfs file systems under Microsoft Windows 10-11.

or maybe not?

Full capacity of steel processing industry at voestalpine

Full capacity of stell processing industry at voestalpine Linz
https://www.voestalpine.com/highperformancemetals/international/en/

A Gothic Madonna replaced by a fake (both the original and the fake)

Photo of faked gothic madonna

Many other things will be reported soonly

Many other things will be reported soonly.

companies & software in scope of DNA genetic engineering

It is up to everyone to evaluate the opportunities and risks after exploring and learning the scope and hardfacts in detail.

• CloneManager [ www.scied.com/pr_cmpro.htm | 
  clone-manager-professional.software.informer.com ] 
• DNADynamo BlueTractorSoftware [ www.bluetractorsoftware.com ]
• DNASTAR [ www.dnastar.com/software/lasergene/ ]
• Eclipsebio [ eclipsebio.com ]
• Genomelink [ genomelink.io ]
• QIAGEN CLC Genomics Workbench Premium 
• SnapGene [ www.snapgene.com ]

[ ... to be continued ... ]

VIC20 Emulatoren

In einem Anfall von Nostalgie lud ich mir 2 VIC20 Emulatoren herunter.

• https://vice-emu.sourceforge.io/
• https://github.com/VICE-Team/svn-mirror/releases
• http://www.homecomputerworld.com/emulatovc20.html

und programmierte in BASIC ein einfaches Zahlenratespiel: 

10 LET U=RND(-625)

20 LET V=RND(0)

30 LET W=V*10

40 LET X=INT(W)

50 REM X ZAHL VON 1 BIS 10

100 INPUT “ERRATE ZAHL VON 0 BIS 10” ; A$

110 G0 LET B=VAL(A)

120 IF B < X THEN GOTO 160

130 IF B > X THEN GOTO 180

140 IF B = X THEN GOTO 200

160 PRINT “ IHRE ZAHL IST > GROESSER”

170 GOTO 100

180 PRINT “ IHRE ZAHL IST < KLEINER”

190 GOTO 100

200 PRINT “RICHTIG!”

210 END

https://youtu.be/fbzMmV3NL5w

VIC20 BASIC Referenz:

https://www.infinite-loop.at/Power20/Documentation/Power20-LiesMich/AA-VC-20_BASIC.html

Supu (Sudoku Puzzle) by Georg Toth

Hi, I implemented SUPU (SUdoku PUzzle), idea & design by Georg Toth for Windows Desktop.

You can order Supu on Georg Toth Webshop here:
https://www.georg-toth.com/supu

https://youtu.be/gQb83okHHg8

frogA - frogger Adroid

so a little fun project "frogA- frogger Android" is taking some little progress.

So the first beta release of "frogA - frogger Android" is ready:
https://github.com/heinrichelsigan/frogA/releases

Git repository:
https://github.com/heinrichelsigan/frogA

lastest build APK package:
https://github.com/heinrichelsigan/frogA/releases/download/v1.2.24.6-2023-02-02/frogA_v1_2_24_6-2023-02-02-debug.apk

https://youtube.com/shorts/BSor9ShWJzc

https://www.youtube.com/shorts/4FAhYn2c5oU

 

flex - fast lexical analyzer generator sample

Who remember flex: fast lexical analyzer generator?

Here is a short sample, I have written it under gnu linux and ported it to win32 using gnuwin32 flex and getoptwin:

%option noyywrap

%{

#include <stdio.h>

#include <stdlib.h>

#include <math.h>

#include "getopt.h"

#include <string.h> 

#define MAXLEN 1024

int i, j, idx, len, mode = 0;

char tmps[MAXLEN], reverse[MAXLEN];

%}

SEGA  [2][5][0-5]

SEGB  [2][0-4][0-9]

SEGC  [1][0-9]{2}

SEGD  [1-9][0-9]{0,1}

SEG   {SEGA}|{SEGB}|{SEGC}|{SEGD}

IP    {SEG}["."]{SEG}["."]{SEG}["."]{SEG}

HOSTDOMAINSEGMENT [0-9a-zA-Z_"\-"]+["."]

TOPLEVELDOMAIN [a-zA-Z]{2,7}

HOSTNAME {HOSTDOMAINSEGMENT}+{TOPLEVELDOMAIN}

USER [0-9A-Za-z_"\-""."]+

EMAIL1 {USER}"@"{HOSTNAME}

EMAIL2 {USER}"@"{IP}

URIPROTOCOL [a-zA-Z]{2,10}"://"

URISUFFIX [^ \t\n\r"@"","">""<""("")""{""}"]

URL1   {URIPROTOCOL}{HOSTNAME}{URISUFFIX}*

URL2   {URIPROTOCOL}{IP}{URISUFFIX}*

%%

<<EOF>> {

        exit(1);

    }

{EMAIL1} |

{EMAIL2} {

        if (strchr(yytext, '@') != (char *)NULL) 

        {

    switch((mode % 16)) 

    {

case 0: strcpy(tmps, yytext); break;

case 1: strcpy(tmps, strchr(yytext, (int)'@')); break;

case 2: strcpy(tmps, &strchr(yytext, (int)'@')[1]); break;

     case 4: 

strcpy(tmps, &strchr(yytext, (int)'@')[1]);

len = strlen(tmps); 

for (j = 0, idx = 0; ((j < len) && (j < MAXLEN-1)); j++) 

{

                            if (tmps[j] == '.') 

                            {

                                for (i = idx; i <= j; 

                                    reverse[(len-j) + (i-idx)] = tmps[i++]);

                                idx = j + 1;

                            }

}

for (i = idx; i <= j; 

                            reverse[(len-j) + (i-idx)] = (i < len) ? tmps[i] : '.', i++);

reverse[len + 1] = '\0';

strcpy(tmps, reverse);

break;

case 8: strcpy(tmps, &strrchr(yytext, (int)'.')[1]); break;

default: strcpy(tmps, yytext); break;

    }

    (void) printf("%s\n", tmps);

        }

    }

{URL1} |

{URL2} {

if (mode < 16) 

{

            switch((mode % 16)) 

            {

                case 0: strcpy(tmps, yytext); break;

         case 1: strcpy(tmps, strchr(yytext, (int)'/')); break;

         case 2: strcpy(tmps, &strrchr(yytext, (int)'/')[1]); break; 

         case 4: 

                        strcpy(tmps, &strrchr(yytext, (int)'/')[1]);

                        len = strlen(tmps);

                        for (j = 0, idx = 0; ((j < len) && (j < MAXLEN-1)) ; j++)

     {

                            if (tmps[j] == '.') 

                            {

                                for (i = idx; i <= j; 

                                    reverse[(len-j) + (i-idx)] = tmps[i++]);

                                idx = j + 1;

                            }

                        }

                        for (i = idx; i <= j; 

                            reverse[(len-j) + (i-idx)] = (i < len) ? tmps[i] : '.', i++);

                        reverse[len + 1] = '\0';

                        strcpy(tmps, reverse);

                        break;

                case 8: strcpy(tmps, &strrchr(yytext, (int)'.')[1]); break;

                default: strcpy(tmps, yytext); break;

            }

            (void) printf("%s\n", tmps);

        }     

    } 

^[\n;] { ; }

[\r\n]+ { ; }

. { ; }

%%

void yyerror() { exit(1); }

void usage(const char *cmd) 

{

    (void) printf("Usage: %s [-f file] [-a ] [ -r ] [ -u ]\n", cmd);

    (void) printf("\t simple email address and uri lexer reads from stdin \n");

    (void) printf("\t -a, --noat    \t print only hostname of email address (all chars left of \'@\') \n");

    (void) printf("\t -u, --nouser  \t print email without username \n");

    (void) printf("\t -t, --top     \t prints domain toplevel only, when using option -a | -u \n");

    (void) printf("\t -n, --nouris \t print only email address and not uris\n");

    (void) printf("\t -r, --reverse \t reverse the hostdomain / ip address segments\n");

    

    exit(0);

}

int _tmain(int argc, TCHAR** argv)

{

    static int verbose_flag;

    int c;

    while(1)

    {

        static struct option long_options[] =

        {

            {_T("help"), ARG_NONE, 0, _T('h')},

            {_T("noat"), ARG_NONE, 0, _T('a')},

            {_T("nouser"), ARG_NONE, 0, _T('u')},

            {_T("top"), ARG_NONE, 0, _T('t')},

            {_T("nouris"), ARG_NONE, 0, _T('n')},

            {_T("reverse"),     ARG_NONE, 0, _T('r')},

            { ARG_NULL,         ARG_NULL, ARG_NULL, ARG_NULL}

        }; 

        int option_index = 0;

        c = getopt_long(argc, argv, _T("hautnr:"), long_options, &option_index);

        if (c == -1) 

            break;

        switch (c) // Handle options

        {

            case 0: // If this option set a flag, do nothing else now.

                    if (long_options[option_index].flag != 0)

                        break;

                    _tprintf (_T("option %s"), long_options[option_index].name);

                    if (optarg)

                        _tprintf (_T(" with arg %s"), optarg);

                    _tprintf (_T("\n"));

                    break;

            case _T('u'): mode = 1; break; 

            case _T('a'): mode = 2; break; 

            case _T('r'): mode = 4; break;

            case _T('h'): usage(argv[0]); break;

            case _T('t'): mode = 8; break;

            case _T('n'): mode += 16; break;  

            case '?': break; // getopt_long already printed an error message. 

            default: abort();

        }

    }

    (void) fflush(stdout);

    yyin = stdin;

    yylex();

    exit(0);

}

Original posted 2011 here: http://www.area23.at/he/security/flex

Could too much function pointers (delegates) inside many huge loops have an effect of unoptimizable code?

We have this simple c modified code from stack overflow called funcptrtest.c:

include <stdio.h>
/*   C code for program funcptrtest.c 
  => https://pastebin.com/rUtXfgSG 
*/
const int b = 23;

// A normal function with an int parameter and void return type
void fun(int a)
{
  if (a < b)
    printf("Value of a (%d) is lesser then value of b (%d)\n", a, b);
  else if (a == b)
    printf("Value of a (%d) is equal value of b (%d)\n", a, b);
  else if (a > b)
    printf("Value of a (%d) is greater than value of b (%d)\n", a, b);
}

// main => NO KNR style int main(argc, argv) int argc; char **argv 
int main(int argc, char **argv)
{
    int i = 0;
    /* fun_ptr is a pointer to function fun()
           void (*fun_ptr)(int) = &fun;
         is equivalent of following two
           void (*fun_ptr)(int);
           fun_ptr = &fun;
    */
    void (*fun_ptr)(int) = &fun;

    // call once with static int
    (*fun_ptr)(b);

    // iterate through for loop
    for (i = 1; i < 101; i+=11)  {
        // Invoking fun() using fun_ptr
        (*fun_ptr)(i);
    }

    return 0;
}

We compile it now with gnu c compiler with gcc option -S and generate an assembler file:

gcc -S funcptrtest.c -o funcptrtest.asm

Result will be something like this:

.file   "funcptrtest.c"
        .text
        .globl  b
        .section        .rodata
        .align 4
        .type   b, @object
        .size   b, 4
b:
        .long   23
        .align 8
.LC0:
        .string "Value of a (%d) is lesser then value of b (%d)\n"
        .align 8
.LC1:
        .string "Value of a (%d) is equal value of b (%d)\n"
        .align 8
.LC2:
        .string "Value of a (%d) is greater than value of b (%d)\n"
        .text
        .globl  fun
        .type   fun, @function
fun:
.LFB0:
        .cfi_startproc
        endbr64
        pushq   %rbp
        .cfi_def_cfa_offset 16
        .cfi_offset 6, -16
        movq    %rsp, %rbp
        .cfi_def_cfa_register 6
        subq    $16, %rsp
        movl    %edi, -4(%rbp)
        movl    $23, %eax
        cmpl    %eax, -4(%rbp)
        jge     .L2.L2:
        movl    $23, %eax
        cmpl    %eax, -4(%rbp)
        jne     .L4
        movl    $23, %edx
        movl    -4(%rbp), %eax
        movl    %eax, %esi
        leaq    .LC1(%rip), %rax
        movq    %rax, %rdi
        movl    $0, %eax
        call    printf@PLT
        jmp     .L5
        .L2:
        movl    $23, %eax
        cmpl    %eax, -4(%rbp)
        jne     .L4
        movl    $23, %edx
        movl    -4(%rbp), %eax
        movl    %eax, %esi
        leaq    .LC1(%rip), %rax
        movq    %rax, %rdi
        movl    $0, %eax
        call    printf@PLT
.L2:
        movl    $23, %eax
        cmpl    %eax, -4(%rbp)
        jne     .L4
        movl    $23, %edx
        movl    -4(%rbp), %eax
        movl    %eax, %esi
        leaq    .LC1(%rip), %rax
        movq    %rax, %rdi
        movl    $0, %eax
        call    printf@PLT
        jmp     .L5
.L4:
        movl    $23, %eax
        cmpl    %eax, -4(%rbp)
        jle     .L5
        movl    $23, %edx
        movl    -4(%rbp), %eax
        movl    %eax, %esi
        leaq    .LC2(%rip), %rax
        movq    %rax, %rdi
        movl    $0, %eax
        call    printf@PLT
.L5:
        nop
        leave
        .cfi_def_cfa 7, 8
        ret
        .cfi_endproc     
.LFE0:
        .size   fun, .-fun
        .globl  main
        .type   main, @function
main:
.LFB1:
        .cfi_startproc
        endbr64
        pushq   %rbp
        .cfi_def_cfa_offset 16
        .cfi_offset 6, -16
        movq    %rsp, %rbp
        .cfi_def_cfa_register 6
        subq    $32, %rsp
        movl    %edi, -20(%rbp)
        movq    %rsi, -32(%rbp)
        movl    $0, -12(%rbp)
        leaq    fun(%rip), %rax
        movq    %rax, -8(%rbp)
        movl    $23, %edx
        movq    -8(%rbp), %rax
        movl    %edx, %edi
        call    *%rax
        movl    $1, -12(%rbp)
        jmp     .L7
.L8:
        movl    -12(%rbp), %eax
        movq    -8(%rbp), %rdx
        movl    %eax, %edi
        call    *%rdx
        addl    $11, -12(%rbp)
.L7:
        cmpl    $100, -12(%rbp)
        jle     .L8
        movl    $0, %eax
        leave
        .cfi_def_cfa 7, 8
        ret
        .cfi_endproc
.LFE1:
        .size   main, .-main
        .ident  "GCC: (Ubuntu 11.3.0-1ubuntu1~22.04) 11.3.0"
        .section        .note.GNU-stack,"",@progbits
        .section        .note.gnu.property,"a"
        .align 8
        .long   1f - 0f
        .long   4f - 1f
        .long   5
0:
        .string "GNU"
1:
        .align 8
        .long   0xc0000002
        .long   3f - 2f
2:
        .long   0x3
3:
        .align 8
4:

Lets look, if a simple loop is faster than a function pointer delegate call:

/* program looptest.c */
include <stdio.h>

const int b = 23;

// main
int main(int argc, char **argv)
{
    int i = 0;
    int a = 23;

    /*
    if (a < b)
        printf("Value of a (%d) is lesser then value of b (%d)\n", a, b);
    else if (a == b)
       printf("Value of a (%d) is equal value of b (%d)\n", a, b);
    else if (a > b)
       printf("Value of a (%d) is greater than value of b (%d)\n", a, b);
    */

    // iterate through for loop
    for (i = 1; i < 4194304; i+=11)  {
        a = i;
        if (a < b)
           printf("Value of a (%d) is lesser then value of b (%d)\n", a, b);
        else if (a == b)
           printf("Value of a (%d) is equal value of b (%d)\n", a, b);
        else if (a > b)
           printf("Value of a (%d) is greater than value of b (%d)\n", a, b);
    }

    return 0;
}

---

/* program funcptrtest.c */
include <stdio.h>

const int b = 23;

// A normal function with an int parameter and void return type
void fun(int a)
{
  if (a < b)
    printf("Value of a (%d) is lesser then value of b (%d)\n", a, b);
  else if (a == b)
    printf("Value of a (%d) is equal value of b (%d)\n", a, b);
  else if (a > b)
    printf("Value of a (%d) is greater than value of b (%d)\n", a, b);
}

// main
int main(int argc, char **argv)
{
    int i = 0;
    /* fun_ptr is a pointer to function fun()

       void (*fun_ptr)(int) = &fun;
       is equivalent of following two
       void (*fun_ptr)(int);
       fun_ptr = &fun;
    */
    void (*fun_ptr)(int) = &fun;

    // call once with static int
    // (*fun_ptr)(b);

    // iterate through for loop
    for (i = 1; i < 4194304; i+=11)  {
        // Invoking fun() using fun_ptr
        (*fun_ptr)(i);
    }

    return 0;
}

---

Well, that's not so deterministic, of course our simple looptest.asm has a shorter assembler.

But execution time is not so huge difference, we have to simulate, that in many scenarios.

[To be continued ...]

It's about creating distributed service oriented communications

Attention:
This article isn't about daily standard electronic communications via network protocols (e.g. email services or shared network folders),  neither about user authentication / authorization nor groupware. 

It's about: 
Implementing or consuming customizable reliable distributed services;
by choosing & implementing a programmable extensible scalable, easily portable, standardized inter-compatible fail-safe resilient communication middleware, that's financially essential for most critical business processes.

For what kind of companies is that useful, important or relevant?
It's relevant for all companies, that consume many crtical data from external partners / service providers; 
then process received & own data inside different departments (maybe in different locations) with different areas of responsibility (e.g. fraud detection, critical real-time scaling of dynamic hardware (memory, harddisks and available CPUs, permanent risk adjustment and last but not least anonymized [General Data Protection Regulation] precise reporting for legal reasons);
finally  and ultimately share processed data to maybe different  external organisations with very deviating requirements, like government fraud reporting agency on one side and partners inside a foundation or joint umbrella organization however.

Overview most common distributed service oriented communication technologies in history

What technologies do you use in your company / organisation or as private person for distributed service oriented communication?

1. antique: [ 1980s ]
• Sun RPC [ remote procedure call ]
2. old: [ around the millennium ]
• DCOM [ Distributed Component Object Model ] 
  see also: ActiveX, DDE, .NET Remoting 
• Java Corba
• message oriented middleware [ mostly XML based ]
• SOAP  / XML based Webservices [ SOAP message ] 
• .NET Webservices + Web Services Enchancements (.asmx .ashx ) 
3. Previous generation: [ since 2010 ]
• WCF [ Windows Communication Foundation ]  by Microsoft .NET
• Swagger [ swagger.io swagger-api ]
• Rest API [ Representational State Transfer ]
• RestFul web api
• Apache CFX [ cxf.apache.org ]
• gRPC [ gRPC Remote Procedure Calls ]
  gRPC [ grpc.io | github.com/grpc ] was initially created by Google

What local software suites / solutions / products and enterprise cloud services are included in your distributed service oriented communication(s workflows)?

1. Microsoft BizTalk Server
2. RabbitMQ [ github.com/rabbitmq ]
• RabbitMQ (Message queue service)
• Messaging with RabbitMQ
3. Amazon Web Services [ aws ]
• S3 REST API
• Rest API getting started 
• deploying a REST API in Amazon API Gateway
4. Azure RestAPI Reference 
• Azure REST API reference
• Design APIs for microservices [ REST vs RPC ]
• REST APIs vs Microservices: The Differences and How They Work Together

[ to be continued ... ]

-

Bridge Mini-VM for reading XFS, JFS, ext[234], minix, btrfs, reiserfs ot any other non MS filesystem

Howto access  XFS, JFS, ext[234], minix, btrfs, reiserfs ot any other non MS filesystem from Windows 7 - 11 without installing a maybe bogus kernel filesystem driver?

1. Make a Mini-Vm with a totally slack and stripped linux kernel, that is bridged on a VM network adapter. Include all filesystem drivers and needed network adapter & drivers in that kernel and strip / kick out everything other, what's not needed. 
   Make the kernel similiar to a cisco router or PIX firewall kernel.
2. Give the VM direct access to your harddisk, usb-devices, firewire & bluetooth devices.
   
3. Enable the Mini linux VM to reEXport mounted filesystem over smb or nfs.
4. Calculate the memory size, which is needed, that all filesystem mounts and all fs operatons work fast enough with paging and caching. 
5. Choose the best scheduler for that mini-VM.
6. Optimize all ioctl, (f)lush, (f)read, (f)write, (f)seek, (f)open, (f)close and all other filesystem operations.
7. If you are hungry => oprimize the /proc /sys /dev filesystem.

A crazy example of a Lazy singleton as strangest singelton pattern ever

A crazy example of a Lazy<T> singelton with privat constructor inherited form an protected DoubleLockInstance singelton with private empty and protected parameter constructor inherited form an abstract singelton template with protected constructor.

Application settings example:

BaseSets for basic settings as abstract singelton base

using System;using System.Reflection;
namespace work.darkstar.blog{    /// <summary>    /// abstract class BaseSets     /// </summary>    [Serializable]    public abstract class BaseSets    {        public string AssemblyName { get => Assembly.GetExecutingAssembly().GetName().ToString(); }        public string Copyright { get => "GNU LIGHT GENERAL PUBLIC LICENSE 2.0 LGPL"; }        public virtual string AssemblyCom { get => "darkstar.work"; }
        public virtual int AppId { get; protected set; }        public virtual string AppName { get; protected set; }        /// <summary>        /// protected empty constructor for inheritable singelton        /// </summary>        protected BaseSets() { }         /// <summary>        /// protected parameterized constructor for inheritable singelton        /// </summary>        protected BaseSets(int appId, string appName)        {            AppId = appId;  AppName = appName;        }    }}

AppSets for application settings as instancable singelton default app sets (settings):

using Microsoft.Win32;
using System;
using System.Reflection;
using System.Windows.Forms;

namespace work.darkstar.blog
{    public interface IAppSetsDomain : IAppDomainSetup    {        System.AppDomain AppCurrentDomain { get; }    }    /// <summary>
    /// application settings singelton    /// </summary>
    [Serializable]    public class AppSets : BaseSets, IAppDomainSetup
    {
        private static AppSets _appSets;        private static object  _initLock, _sndLock;
        protected static AppSets DoubleLockInstance {            get {                _sndLock = new System.Object();                lock (_sndLock)  {                    if (_initLock != null) _initLock = null;
                    if (_initLock == null) _initLock = new System.Object();                    lock (_initLock) {                       if (_appSets == null)                            _appSets = new AppSets();                    }                    return _appSets;                }            }        }        public string CodeBase { get => Assembly.GetExecutingAssembly().CodeBase; }
        public string BaseDirectory { get => AppDomain.CurrentDomain.BaseDirectory; }        public string AppDataPath { get => Application.CommonAppDataPath; }        public RegistryKey AppDataRegistry { get => Application.CommonAppDataRegistry; }

        #region implementing interface IAppSetsDomain, IAppDomainSetup        
        public AppDomain AppCurrentDomain { get => AppDomain.CurrentDomain; }
        public string ApplicationBase { get ; set; }
        public string ApplicationName{ get ; set; }
        public string CachePath{ get ; set; }
        public string ConfigurationFile{ get ; set; }
        public string DynamicBase { get ; set; }
        public string LicenseFile { get ; set; }
        public string PrivateBinPath { get ; set; }
        public string PrivateBinPathProbe { get ; set; }
        public string ShadowCopyDirectories { get ; set; }
        public string [] ShadowCopyDirectoryArray { 
                get => ShadowCopyDirectories.Split(';'); }
        public bool FilesShadowCopy { get ; set; }
        public string ShadowCopyFiles { 
            get => FilesShadowCopy.ToString().ToLower();
            set { FilesShadowCopy = Boolean.Parse(value); }
        }
        public bool FilesShadowCopy{ get ; set; }
        public string ShadowCopyFiles{ get => FilesShadowCopy.ToString() ; set; }
        #endregion implementing interface IAppSetsDomain, IAppDomainSetup        

        /// <summary>        /// static constructor         /// </summary>        static AppSets() {
            _initLock = new System.Object();
            lock (_initLock) { _appSets = new AppSets(); }
        }
        /// <summary>        /// private empty constructor         /// </summary>        private AppSets() {            AppId = AppDomain.CurrentDomain.Id;            AppName = Assembly.GetExecutingAssembly().FullName;                      }
        /// <summary>        /// protected parameter constructor         /// </summary>        protected AppSets(int appId, string appName) : base(appId, appName) { }
    }}

Sealed MyAppSets for application specialized appSets as Lazy<T> singelton:

using System;
using System.IO;
using System.Security;/* ... */using Microsoft.Win32;/* ... */using Windows.Forms;
namespace work.darkstar.blog
{
    /// <summary>
    /// my application settings singelton
    /// </summary>
    [Serializable]
    public sealed class MyAppSets : AppSets
    {
        /// <summary>
        /// private static readonly Lazy<T> self containing private real singelton unique instance
        /// </summary>
        private static readonly Lazy<MyAppSets> _instance = 
            new Lazy<MyAppSets>(() => new MyAppSets(AppDomain.CurrentDomain.Id, "LazyApp"));

        /// <summary>
        /// static instance getter for Singeltion
        /// </summary>
        public static MyAppSets Instance { get => _instance.Value; }

        public string UserAppDataPath { get => Application.UserAppDataPath; }
        public RegistryKey UserAppDataRegistry { get => Application.UserAppDataRegistry; }


        /// <summary>
        /// private constructor with partameters for sealed unique singelton
        /// </summary>
        private MyAppSets(int appId, string appName) : base(appId, appName) { }        

        /// <summary>
        /// Gets name value pair for application registry key saved in registry scope for current user
        /// </summary>
        /// <param name="regName">registry name identifier</param>
        /// <param name="subKey">subKey in scope of current user</param>
        /// <returns>object value</returns>
        /// <exception cref="ApplicationException">application exception with detailed inner exception</exception>
        public object GetUserRegValuey(string regName, string subKey = null) {
            object o = null;
            RegistryKey key = null;
            Exception ex = null;
            try {
                key = (subKey == null) ? UserAppDataRegistry 
                    : UserAppDataRegistry.OpenSubKey(subKey, false);
                o = key.GetValue(regName);
            }
            catch (SecurityException sex) { ex = sex; }
            catch (ObjectDisposedException odEx) { ex = odEx; }
            catch (UnauthorizedAccessException uaEx) { ex = uaEx; }
            catch (IOException ioeEx) { ex = ioeEx; }
            finally {
                if (key != null && subKey != null)
                    key.Close();
                if (ex != null) throw (new ApplicationException("Error accessing registy key: " + 
                    $"{UserAppDataRegistry}\t name: {regName}\t subkey: {subKey}", ex));            }
            return o;
        }

        /// <summary>
        /// Set Value for UserAppDataRegistry
        /// </summary>
        /// <param name="regName">registry name </param>
        /// <param name="value"value to set></param>
        /// <param name="subKey">subKey</param>
        /// <returns>void means nothing</returns>
        /// <exception cref="ApplicationException">application exception with detailed inner exception</exception>
        public void SetUserReg(string regName, object value, string subKey = null) {
            RegistryKey key = null;
            Exception ex = null;
            try {
                key = (subKey == null) ? UserAppDataRegistry 
                    : UserAppDataRegistry.OpenSubKey(subKey, true);
                key.SetValue(regName, value);
            } catch (Exception anyEx) {
                ex = new ApplicationException($"Error setting value=" +
                  $"{value} for name={regName} inside registry key: {key.Name}", 
                  anyEx);
            } finally {
                if (key != null && subKey != null)
                    key.Close();
                if (ex != null) throw ex;
            }
        }
    }
}

Accessing MyAppSets singelton inside any entity, framework,  helper, [...] class

using System; /*  ... */
using work.darkstar.blog;



public class MyEntity : IAppSetsDomain { 

  /* [ ... ]  */ 
  /* [Inject] */ 
  /* [ ... ]  */

  public AppDomain AppCurrentDomain {
    get => MyAppSets.Instance.AppCurrentDomain;
    set => MyAppSets.Instance.AppCurrentDomain = value;
  }
  /* ... */
}