Johannes Goller jogojapan

I am a computer scientist interested in NLP, string algorithms and app development.

jogojapan / avl.dot

Created June 30, 2013 08:26

AVL tree example

jogojapan / maprange.cpp

Created February 25, 2013 03:48

Example for the use of map::lower_bound and map::upper_bound in a map of pairs

	#include <iostream>
	#include <utility>
	#include <limits>
	#include <map>

	using mymap = std::map<std::pair<int, int>, int>;

	std::ptrdiff_t num_per_node(const mymap &map, const int node_id)
	{
	using std::distance;

jogojapan / test_process_cpu_clock.cpp

Created November 16, 2012 14:25

Testing boost::chrono

	#include <boost/chrono.hpp>
	#include <chrono>
	#include <thread>
	#include <iostream>
	#include "/space/code/sufex/src/util/proctime.hpp"

	int main()
	{
	typedef boost::chrono::process_user_cpu_clock CPUClock;

jogojapan / substringview.cpp

Created November 14, 2012 04:03

Using substring-views to seach a multi-map of strings

	#include <map>
	#include <string>
	#include <algorithm>
	#include <iostream>

	class substrview
	{
	std::string::const_iterator _from;
	std::string::const_iterator _to;
	public:

jogojapan / ukkonen.py

Created June 18, 2012 06:57

Ukkonen algorithm

	import sys

	class Suxtree:
	# The ID of the node most recently inserted. 0 is the ID of the
	# root node; we assume it exists right from the start.
	max_node = 0

	# The edges hash. Each edge has a unique ID (consisting of a node
	# ID and an initial character. The ID is constructed by the
	# edgeid() method below). The hash below maps edge IDs to edge

jogojapan / simple-suffix-trees

Created April 20, 2012 05:58

A couple suffix trees in the Graphviz dot format

	//
	// These are dot graphs used for the little figures in some
	// of my suffix-tree related posts on Stackoverflow, in
	// particular:
	//
	// http://stackoverflow.com/a/9513423/777186
	//
	// To use them, simply apply the "dot" program to this file.
	// For example, to generate a PNG image:
	//