mbenford

from dbus_next.aio import MessageBus
from dbus_next.message import Message
from dbus_next.constants import BusType
import asyncio

async def main():
    match = (
        "type='method_call',"
        "interface='org.freedesktop.PowerManagement.Inhibit',"
        "path='/org/freedesktop/PowerManagement/Inhibit'"

mbenford

#!/bin/bash

set -e

conn_id=$(nmcli conn show | grep vpn | awk '{print $2}' | head -n1)
if [ "$conn_id" == "" ]; then
	echo "no VPN connection was found"
	exit 1
fi

mbenford

#!/bin/bash

# Moves all commits between @{u} and HEAD into a new branch
# and deletes them from the current branch.
# 
# Copyright (c) 2019 Michael Benford <michael@michaelbenford.net>
#
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights

mbenford

Keybase proof

I hereby claim:

• I am mbenford on github.
• I am mbenford (https://keybase.io/mbenford) on keybase.
• I have a public key ASBo0WcLt6b2Gjuq4tG-go7Ez0_bPJq3kNUA28QoKK1bPQo

To claim this, I am signing this object:

mbenford

const path = require('path');
const GitHubApi = require('github');
const jsonfile = require('jsonfile');
const moment = require('moment');
const async = require('async');
const config = require('./config.json');

const github = new GitHubApi({ protocol: 'https' });
github.authenticate({ type: 'oauth', token: config.token });

mbenford

public static class MappingExtensions
{
    public static void Unflatten<T>(this IMemberConfigurationExpression<T> config)
    {
        config.ResolveUsing(resolutionResult =>
        {
            var context = resolutionResult.Context;
            var prefix = context.MemberName;
            var destProperties = context.DestinationType.GetProperties();
            var dest = Activator.CreateInstance(context.DestinationType);

mbenford

alias la="ls -a"
alias psa="ps aux"

mbenford

function getPermutations(set) {
    var result = [];
    permutate(set);
    return result;
    
    function permutate(set, subset) {
        if (!subset) subset = [];
        if (set && !set.length) {
            result.push(subset);
            return;

mbenford

public static class Permutations
{
    public static IEnumerable<IEnumerable<T>> Get<T>(IEnumerable<T> set, IEnumerable<T> subset = null)
    {
        if (subset == null) subset = new T[] { };
        if (!set.Any()) yield return subset;

        for (var i = 0; i < set.Count(); i++)
        {
            var newSubset = set.Take(i).Concat(set.Skip(i + 1));

mbenford

function setBitOn(number, bit) {
  return number | 1 << bit;
}

function setBitOff(number, bit) {
  return number & ~(1 << bit);
}

function toggleBit(number, bit) {
  return number ^ 1 << bit;