Skip to content

Instantly share code, notes, and snippets.

### Keybase proof
I hereby claim:
* I am mteinum on github.
* I am teinum (https://keybase.io/teinum) on keybase.
* I have a public key ASAT-lHllhgKXa_b_x_6T43Sj_49EcTx24dex2f5Y3ykNgo
To claim this, I am signing this object:

Keybase proof

I hereby claim:

  • I am mteinum on github.
  • I am mteinum (https://keybase.io/mteinum) on keybase.
  • I have a public key ASC7TlFUm-8SuPK_nYkXOg5EEqT1ruq6jRr4duLA7zvYtAo

To claim this, I am signing this object:

CREATE PROCEDURE dbo.NSB_Tool_ListAllSubscriptionData AS
DECLARE @Query VARCHAR(MAX)
SELECT
@Query = STRING_AGG(
CONVERT(VARCHAR(MAX), 'SELECT ''' + ta.Name + ''' AS ''Service'', Subscriber, Endpoint, MessageType, PersistenceVersion from ' + ta.Name),
' UNION ')
FROM sys.tables ta WHERE ta.name LIKE '%SubscriptionData'
using System;
using System.Linq;
class ImeisvToImei
{
static string Transform(string imeisv)
{
if (imeisv == null)
throw new ArgumentNullException(nameof(imeisv));
%% module: sup_frequency
%% author: morten.teinum@gmail.com
%% purpose: supervices frequency server process
%% compile: erl
%% c(sup_frequency).
%% run: sup_frequency:start().
%%
-module(sup_frequency).
-export([start/0, init/0]).
%% CONCURRENT PROGRAMMING IN ERLANG THE UNIVERSITY OF KENT, 1.15
%%
%% morten.teinum@gmail.com
%%
%% changelog:
%%
%% 1. added clear as a nonblocking function. This will remove
%% all messages current in the mailbox.
%%
%% 2. Added timeouts to the client code
%% CONCURRENT PROGRAMMING IN ERLANG
%% 1.5
%% author: Morten Teinum (morten.teinum@gmail.com)
%%
%% compile:
%% c(palindrome).
%%
%% test:
%% palindrome:client_test().
%% palindrome:distributor_test().
%% FUNCTIONAL PROGRAMMING IN ERLANG THE UNIVERSITY OF KENT
%% 2.20 Programming challenge: indexing a file
%%
%% morten.teinum@gmail.com
%%
%% Compile:
%% c(fpe220).
%%
%% Run:
%% fpe220:test().
%% Functional Programming In Erlang.
%% morten.teinum@gmail.com
%%
%% Compile:
%% erl fpe124.erl
%%
%% Run:
%% fpe124:test_shapes().
%% fpe124:test_bits().
%%
-module(fp121).
-export([perfect/1]).
divisors(_, 0, Acc) -> Acc;
divisors(N, P, Acc) when N rem P =:= 0 ->
divisors(N, P - 1, Acc + P);
divisors(N, P, Acc) ->
divisors(N, P - 1, Acc).
perfect(N) ->