-;;;; $Id: ecl-endian-byte-order.lisp,v 1.1 2013/11/14 11:58:56 mmondor Exp $
+;;;; $Id: ecl-endian-byte-order.lisp,v 1.2 2015/09/09 23:18:57 mmondor Exp $
;;;; Copyright (c) 2013, Matthew Mondor
#|
+
+;;; LDB/BYTE are elegant, but they unfortunately suffer from poor
+;;; optimizations
+
(declaim (inline byteorder-bswap16))
(defun byteorder-bswap16 (word)
(declare (optimize (speed 3) (safety 0) (debug 0))
-;;; $Id: string-dict-perf-test.lisp,v 1.3 2014/07/13 17:12:17 mmondor Exp $
+;;; $Id: string-dict-perf-test.lisp,v 1.4 2015/09/09 23:18:57 mmondor Exp $
;;; Verify the performance of various sized hash tables, alists, plists
;;; and vectors for key-value storage. Also test versus DO-SXHASH-CASE.
(return-from vector-remove vector))
;; Match, swap last entry with matched index and decrease fill-pointer
(unless (= last i)
- (psetf (aref vector last) (aref vector i)
- (aref vector i) (aref vector last)))
+ (rotatef (aref vector last) (aref vector i)))
(setf (fill-pointer vector) last)
vector)))
Repositories / mmondor.git / commitdiff