Welcome to the Lounge

reviewer said:

Good first generation, but I think it needs a couple generations of updates.
May 20, 2018
Size: LargeVerified Purchase
This product is a wonderful idea, but needs significant refinement before it will be seriously useful. First, I spent a while learning the keyboard, which was pretty neat. The design and placement of most of the keys was pretty easy to pick up. But things started getting wonky the moment I tried to type more than a dozen words a minute - not that I didn't know which fingers to tap, but Tap would regularly mis-read my taps as other characters. Particularly when the tap requires two fingers, such as the middle finger and pinky to type "z" would often also register the ring finger as tapped as well (in fact, typing those two fingers by themselves is a challenge all of its own that took time to overcome).

IList<IList<string>> _Explode(IList<IList<string>> left, IList<IList<string>> right)
{
	if (right.IsNullOrEmpty())
		return left;
	else if (left.IsNullOrEmpty())
		return right;
	var result = new List<IList<string>>();
	foreach (var leftList in left)
	{
		foreach (var rightList in right)
		{
			var finalList = new List<string>();
			finalList.AddRange(leftList);
			finalList.AddRange(rightList); ;
			if (!result.Contains(
				finalList, 
				OrderedCollectionEqualityComparer<string>.Default))
				result.Add(finalList);
		}
	}
	return result;
}

IList<IList<string>> _Explode(IList<IList<string>> left, IList<IList<string>> right)
{
	if (null== right||0==right.Count)
		return left;
	else if (null==left||0==left.Count)
		return right;
	var result = new List<IList<string>>();
	for(int ic=left.Count,i=0;i<ic;++i)
	{
		var leftList = left[i];
		for(int jc=right.Count,j=0;j<jc;++j)
		{
			var rightList = right[j];
			var finalList = new List<string>(ic+jc);
			for(int kc=leftList.Count,k=0;k<kc;++k)
				finalList.Add(leftList[k]);
			for (int kc = rightList.Count, k = 0; k < kc; ++k)
				finalList.Add(rightList[k]);
			var oec = OrderedCollectionEqualityComparer<string>.Default;
			var found = false;
			for (int kc = result.Count, k = 0; k < kc; ++k)
			{
				if (oec.Equals(result[k], finalList))
				{
					found = true;
					break;
				}
			}
			if(!found)
				result.Add(finalList);
		}
	}
	return result;
}