DouKaku?

def only_unique(ary)
  freq = ary.inject(Hash.new(0)){|h,x| h[x]+=1; h }
  ary.select{|x| freq[x]==1 }
end
only_unique([3, 1, 4, 1, 5, 9, 2, 6, 5]) # => [3, 4, 9, 2, 6]

(defun only-unique (list)
  (remove-if (lambda (x) (>= (count x list) 2)) list))
(only-unique '(3 1 4 1 5 9 2 6 5))      ; => (3 4 9 2 6)

uniqOnly :: Eq a => [a] -> [a]
uniqOnly = uniq []
  where uniq xs [] = reverse xs
        uniq xs (y:ys) = case break (y ==) xs of
          (_,[])    -> uniq (y:xs) ys
          (ps,_:qs) -> uniq (ps++qs) ys

{-
uniqOnly [3,1,4,1,5,9,2,6,5]
[3,4,9,2,6]
-}

Dim uniq = From x In xs Group By x Into Count() Where Count = 1 Select x

import collections

def only_unique(a):
    h = collections.defaultdict(int)
    for i in a:
        h[i] += 1
    return [i for i in a if h[i] == 1]

def main():
    print only_unique([3, 1, 4, 1, 5, 9, 2, 6, 5])

if __name__ == '__main__':
    main()

function doukaku56(a){
  if(typeof uneval != 'function') var uneval = function(o){
    if(o === undefined) return 'undefined';
    if(o === null)      return 'null';
    var s = o.toString();
    switch(o.constructor){
     case Object:
      if(s.indexOf('[object Object')) return s;
      var m = []; for(var p in o) m[m.length] = p +':'+ arguments.callee(o[p]);
      return '({'+ m.join(', ') +'})';
     case Array:
      var a = []; for(var i = o.length; i--;) a[i] = arguments.callee(o[i]);
      return '['+ a.join(', ') +']';
     case String:
      return '"'+ s.replace(/[\"\\]/g,'\\$&').replace(/\r/g,'\\r').replace(/\n/g,'\\n') +'"';
     case Date: return '(new Date('+ +o +'))';
     default:   return s;
    }
  };
  var r = [], h = {}, k, i, l;
  for(i = 0, l = a.length; i < l; i++) h[k = uneval(a[i])] = k in h ? -1 : i;
  for(k in h) if(h[k] >= 0) r[r.length] = h[k];
  for(i = r.sort(function(x, y){ return x - y }).length; i--;) r[i] = a[r[i]];
  return r;
}

import scala.collection.mutable.HashMap

def uniqOnly[A](a:Seq[A]) = {
  val map = a.foldLeft(new HashMap[A,int]){(r,v)=>r(v)=r.getOrElse(v,0)+1;r}
  a.filter(map(_)==1)
}

println(uniqOnly(Array(3, 1, 4, 1, 5, 9, 2, 6, 5)))

def oneces(xs, duplicated=None):
  if duplicated is None:
    duplicated = []
  if len(xs) < 2:
    return xs
  o = oneces(xs[:-1], duplicated)
  if xs[-1] in duplicated:
    return o
  if xs[-1] in o:
    o.remove(xs[-1])
    duplicated.append(xs[-1])
    return o
  return o+xs[-1:]

<?php
function only_unique($ary) {
	foreach ( $ary as $val ) {
		if ( count(array_keys($ary,$val)) == 1 ) {
			$rtn[] = $val;
		}
	}
	return $rtn;
}

print_r(only_unique(array(3, 1, 4, 1, 5, 9, 2, 6, 5)));
?>

| array bag |
array := #(3 1 4 1 5 9 2 6 5).
bag := array asBag.
^array reject: [:each | (bag occurrencesOf: each) > 1]  "=> #(3 4 9 2 6) "

import java.util.*;

public class UniqOnly {
	public static void main(String[] args) {
		List<Integer> list = Arrays.asList(3, 1, 4, 1, 5, 9, 2, 6, 5);
		
		Set<Integer> counter = new HashSet<Integer>();
		Set<Integer> dup = new HashSet<Integer>();
		
		for (int i = 0, n = list.size(); i < n; i++) {
			if(!counter.add(list.get(i))) {
				dup.add(list.get(i));
			}
		}
		list = new LinkedList<Integer>(list);
		list.removeAll(dup);
		System.out.println(list);
	}
}

def only_uniq(xs):
    return sorted((x for x in set(xs) if xs.count(x) == 1), key=xs.index)