Vasco Figueira vlfig

## fixed-strings.0.txt
lo/hi

src/dst
old/new
fst/snd
req/rsp
get/put/del
usr/pwd
new/add/mod/del/(rem)

## genesis_public_key
0478ee04c185b5839cf6f9b659de46b095aafd0aa2fd21f43d48349a7b2ad26493821d9c1e757b299f81ad185f3a11b19a0804104a135eefafb628853b38dd6163;ixalon

## bumpme
Mon Feb 13 11:00:27 UTC 2017

## keybase.md

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                vlfig
                / keybase.md
            
            
              Created
              February 18, 2016 19:42
            
          
    Keybase proof

I hereby claim:

I am vlfig on github.
I am vlfig (https://keybase.io/vlfig) on keybase.
I have a public key ASBLwErSmB-5tIbfuax-sfUVX-9Ml1Nxwz9sDiYQ4nBSRQo

To claim this, I am signing this object:

  
## lookup-artefact.sh
#!/bin/bash

NEXUS_BASE_URL='https://repository.apache.org/'
NRA_SEG='service/local/data_index?sha1='

echo "Using $NEXUS_BASE_URL$NRA_SEG<SHA1 checksum>"
echo

lookup()
{

## TestCaseClassInterning.scala
import scala.collection.mutable.WeakHashMap

/**
  * Utility traits for classes whose companion objects are to
  * intern their instances, never creating repeated objects.
  *
  * Instances are cached based on their immutable
  * arguments, as provided to companion object's {{apply()}}.
  */

## TestPathDependentTypeImplicit.scala
case class MyClass(val value: Int)

/**
  * maintains certain state about MyClass objects' dependencies
  *
  * between below and above are the interesting bits enabling
  * the implicit state awareness leading to a clearer syntax
  */
class TestPathDependentTypeImplicit(val map: Map[MyClass, MyClass]) {

## ListSpanVariations.scala
import scala.collection.mutable.ListBuffer

/**
 * Span-like inclusive methods for slicing list based on element predicates.
 * @author Vasco Figueira
 * @author Peter Empen
 */
class ListSpanVariations[A](l: List[A]) {

  /**

## gist:2931792
public static final boolean isImoValid(String imo) {
	if (imo == null || imo.length() != 7) {
		return false;
	}
	char[] a = imo.toCharArray();
	int sum = 0;
	for(int i = 0; i < 6; i++) {
		sum += (a[i]-48)*(a.length-i);
	}
	return sum % 10 == a[6]-48;

## gist:2429252
/* Educational pivot query
 * rank() is oracle-specific, see http://www.adp-gmbh.ch/ora/sql/analytical/rank.html
 */

with tab_cols as (
	select
		table_name,
		column_name,
		rank() over (partition by table_name order by column_name asc) as ordinal
	from user_tab_columns
	lo/hi

	src/dst
	old/new
	fst/snd
	req/rsp
	get/put/del
	usr/pwd
	new/add/mod/del/(rem)
	#!/bin/bash

	NEXUS_BASE_URL='https://repository.apache.org/'
	NRA_SEG='service/local/data_index?sha1='

	echo "Using $NEXUS_BASE_URL$NRA_SEG<SHA1 checksum>"
	echo

	lookup()
	{
	import scala.collection.mutable.WeakHashMap

	/**
	* Utility traits for classes whose companion objects are to
	* intern their instances, never creating repeated objects.
	*
	* Instances are cached based on their immutable
	* arguments, as provided to companion object's {{apply()}}.
	*/
	case class MyClass(val value: Int)

	/**
	* maintains certain state about MyClass objects' dependencies
	*
	* between below and above are the interesting bits enabling
	* the implicit state awareness leading to a clearer syntax
	*/
	class TestPathDependentTypeImplicit(val map: Map[MyClass, MyClass]) {
	import scala.collection.mutable.ListBuffer

	/**
	* Span-like inclusive methods for slicing list based on element predicates.
	* @author Vasco Figueira
	* @author Peter Empen
	*/
	class ListSpanVariations[A](l: List[A]) {

	/**
	public static final boolean isImoValid(String imo) {
	if (imo == null \|\| imo.length() != 7) {
	return false;
	}
	char[] a = imo.toCharArray();
	int sum = 0;
	for(int i = 0; i < 6; i++) {
	sum += (a[i]-48)*(a.length-i);
	}
	return sum % 10 == a[6]-48;
	/* Educational pivot query
	* rank() is oracle-specific, see http://www.adp-gmbh.ch/ora/sql/analytical/rank.html
	*/

	with tab_cols as (
	select
	table_name,
	column_name,
	rank() over (partition by table_name order by column_name asc) as ordinal
	from user_tab_columns