remove @swap!, add @inbounds

	modified:   src/PermPlain.jl
	modified:   src/matrixops.jl
	deleted:    src/util.jl

src/PermPlain.jl

@@ -4,7 +4,6 @@ using DataStructures.counter
 import Base: isperm, randperm
 
 include("collect.jl")
-include("util.jl")
 
 export permlist, permcycles, permsparse, permmatrix # whether to export, and what ?
 
@@ -487,7 +486,7 @@ end
 
 # Test if two permutations commute
 function permcommute{T<:Real}(p::AbstractVector{T}, q::AbstractVector{T})
- length(q) < length(p) ? @swap!(p,q) : nothing
+ length(q) < length(p) ? (p,q) = (q,p) : nothing
  for i in length(p)
  q[p[i]] == p[q[i]] || return false
  end

src/matrixops.jl

@@ -4,8 +4,8 @@
 function permkron{T<:Real,S<:Real}(p::AbstractVector{T}, q::AbstractVector{S})
  np = length(p); nq = length(q)
  dc = Array{promote_type(T,S)}(np*nq)
-  for i in 1:np
-  for k in 1:nq
+@inbounds for i in 1:np
+@inbounds for k in 1:nq
  dc[nq*(i-1) + k] = nq*(p[i]-1)+q[k]
  end
  end