jbrzozoski

## keybase.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                jbrzozoski
                / keybase.md
            
            
              Created
              April 26, 2019 01:31
            
          
    Keybase proof

I hereby claim:

I am jbrzozoski on github.
I am jbrzozoski (https://keybase.io/jbrzozoski) on keybase.
I have a public key ASAUg7anK2MRYxmLqt4szmlPtVw5qefO9ms7euVBIIm2hgo

To claim this, I am signing this object:

  
## letter_blocks.c
#include <stdio.h>
#include <stdint.h>
#include <string.h>

/*

This was some idle programming for fun while on vacation.  I was staying
at a vacation house that had a set of kids letter blocks, the sort that
are six-sided wooden blocks with a different letter on each side.  I was
trying to figure out the most entertaining messages I could write with the

## smarter_c_array.c
#define ERROR_ALPHA 1
#define ERROR_BETA  4
#define ERROR_GAMMA 3
#define ERROR_DELTA 2

static const char *const strerr[] = {
   [ERROR_ALPHA] = "Error Alpha",
   [ERROR_BETA]  = "Error Beta",
   [ERROR_GAMMA] = "Error Gamma",
   [ERROR_DELTA] = "Error Delta",

## ignition_mqtt_subdevices.py
def findDevicesBelow(path, maxdepth):
	browse_results = system.tag.browse(path, {})
	for item in browse_results.getResults():
		if item['name'] == 'Device Info':
			device_reference = str(item['fullPath']).replace('[MQTT Engine]Edge Nodes/','').replace('/Device Info','')
			print(device_reference)
		if (item['hasChildren'] == True) and (maxdepth > 0):
			findDevicesBelow(item['fullPath'], (maxdepth-1))

# Searching everyone:

## gsmtime.c
#include <stdint.h>
#include <stdio.h>
#include <time.h>

#ifndef TM_YEAR_BASE
#define TM_YEAR_BASE 1900
#endif

#ifndef GSM_YEAR_BASE
#define GSM_YEAR_BASE 2000

## linux_gitconfig
[user]
	name = Set Name
	email = set.email@example.com
[branch]
	autosetuprebase = always
[core]
	autocrlf = input
	editor = nano
	excludesfile = ~/.gitignore
[branch]

## gitignore
# Regeneratable SlickEdit Files
*.vtg
*.vpwhist
*.vpwhistu

## bead_maze.py
#!/usr/bin/env python3

from functools import lru_cache

@lru_cache(maxsize=1024)
def combinations(beads, low_points):
	if low_points == 1:
		return 1
	return sum(combinations(n, (low_points - 1)) for n in range(0, (beads + 1)))

## git-lt
#!/bin/bash

# Get all the annotated tag references
refs=$(git for-each-ref --format="%(if:equals=tag)%(objecttype)%(then)%(refname:short)%(end)" refs/tags)

# Review those to find the longest reference name
refs_as_list=(${refs})
let longest_ref=0
for i in "${refs_as_list[@]}"
do

## sparkplug_schema_thoughts.md

      
              1 file
            
          
              0 forks
            
          
              1 comment
            
          
              2 stars
            
          
                jbrzozoski
                / sparkplug_schema_thoughts.md
            
            
              Last active
              April 20, 2022 16:06
            
          
    This is ultra-low-priority junk I had stuck in my head last night, and I figured writing it all down might be the best way to stop thinking about it.
One of the issues with Sparkplug B is support for systems with multiple application nodes.  Specifically, in terms of coordinating BIRTH messages.
These thoughts are not compatible with Sparkplug B, but are still interesting, possibly for a future generation...  I'm trying to think them through before badgering people on the committee with them.
I'm contemplating what happens if you split the variable and non-variable portions of the NBIRTH into two messages, publishing the non-variant portion persistently, and using the LWT to both announce the node has gone offline and clear the persistent publish.
Let's call the new persistent topic NSCHEMA.
	#include <stdio.h>
	#include <stdint.h>
	#include <string.h>

	/*

	This was some idle programming for fun while on vacation. I was staying
	at a vacation house that had a set of kids letter blocks, the sort that
	are six-sided wooden blocks with a different letter on each side. I was
	trying to figure out the most entertaining messages I could write with the
	#define ERROR_ALPHA 1
	#define ERROR_BETA 4
	#define ERROR_GAMMA 3
	#define ERROR_DELTA 2

	static const char *const strerr[] = {
	[ERROR_ALPHA] = "Error Alpha",
	[ERROR_BETA] = "Error Beta",
	[ERROR_GAMMA] = "Error Gamma",
	[ERROR_DELTA] = "Error Delta",
	def findDevicesBelow(path, maxdepth):
	browse_results = system.tag.browse(path, {})
	for item in browse_results.getResults():
	if item['name'] == 'Device Info':
	device_reference = str(item['fullPath']).replace('[MQTT Engine]Edge Nodes/','').replace('/Device Info','')
	print(device_reference)
	if (item['hasChildren'] == True) and (maxdepth > 0):
	findDevicesBelow(item['fullPath'], (maxdepth-1))

	# Searching everyone:
	#include <stdint.h>
	#include <stdio.h>
	#include <time.h>

	#ifndef TM_YEAR_BASE
	#define TM_YEAR_BASE 1900
	#endif

	#ifndef GSM_YEAR_BASE
	#define GSM_YEAR_BASE 2000
	[user]
	name = Set Name
	email = set.email@example.com
	[branch]
	autosetuprebase = always
	[core]
	autocrlf = input
	editor = nano
	excludesfile = ~/.gitignore
	[branch]
	#!/usr/bin/env python3

	from functools import lru_cache

	@lru_cache(maxsize=1024)
	def combinations(beads, low_points):
	if low_points == 1:
	return 1
	return sum(combinations(n, (low_points - 1)) for n in range(0, (beads + 1)))
	#!/bin/bash

	# Get all the annotated tag references
	refs=$(git for-each-ref --format="%(if:equals=tag)%(objecttype)%(then)%(refname:short)%(end)" refs/tags)

	# Review those to find the longest reference name
	refs_as_list=(${refs})
	let longest_ref=0
	for i in "${refs_as_list[@]}"
	do