salzig

class Matrix[T: Numeric: Manifest](val xDim:Int, val yDim:Int, private val data:Array[T]) {
  require(data.size == xDim*yDim, "provided data dosn't match required dimensions")
  val numeric = implicitly[Numeric[T]]
  val manifest:Manifest[T] = implicitly
//...
  override def toString = "Matrix[%s](%s)" format (manifest, data.grouped(xDim).map( "(%s)" format _.mkString(", ") ).mkString(", "))
}


object Matrix {

salzig

# If not running interactively, don't do anything
[ -z "$PS1" ] && return

# don't put duplicate lines in the history. See bash(1) for more options
export HISTCONTROL=ignoredups
# ... and ignore same sucessive entries.
export HISTCONTROL=ignoreboth

# check the window size after each command and, if necessary,
# update the values of LINES and COLUMNS.

salzig

$ gem install ffi -v '0.6.3'
Building native extensions.  This could take a while...
ERROR:  Error installing ffi:
	ERROR: Failed to build gem native extension.

        /Users/ben/.rvm/rubies/ruby-1.9.3-p125/bin/ruby extconf.rb
extconf.rb:6: Use RbConfig instead of obsolete and deprecated Config.
checking for ffi.h in /usr/local/include... no
checking for rb_thread_blocking_region()... yes
creating extconf.h

salzig

package aufgabe2

object App {
  def sort[T <% Ordered[T]](arg1:T, arg2:T, args:T*) = (arg1 +: arg2 +: args).sortWith(_<_)

  case class PointI(x:Int, y:Int) extends Ordered[PointI] {
    def compare(that:PointI):Int = x compare that.x match { 
      case i if i == 0 => y compare that.y
      case i => i 
    }

salzig

Prozess - das laufende Programm

Programm

Erzeugung

• unix: fork, execve
• windows:CreateProcess

Beenden

• unix: exit / kill
• windows: ExitProcess / TerminateProcess

salzig

import java.util.Arrays;
import java.util.List;
public class Test {
	/**
	 * @author Ben Rexin <[email protected]
	 */
	public static void main(String[] args) {
		List<Integer> array = Arrays.asList(1,2,3,4);
		System.out.println(sum(array));
	}

salzig

import java.util.ArrayList;

public interface Permutation extends Iterable<Integer>{

	// Build a new Permutation by composition of this and other
	public Permutation compose(Permutation other);
	
	// Get element of Permutation at index
	public Integer sigma(Integer index);
	

salzig

package klausur;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;

public class Pruefung {

salzig

package ws10;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Set;

public class Application {