a54ac523ea
libguess employs discrete-finite automata to deduce the character set of the input buffer. The advantage of this is that all character sets can be checked in parallel, and quickly. Right now, libguess passes a byte to each DFA on the same pass, meaning that the winning character set can be deduced as efficiently as possible. ok jasper@
13 lines
484 B
Plaintext
13 lines
484 B
Plaintext
$OpenBSD: patch-buildsys_mk_in,v 1.1.1.1 2010/12/11 11:03:22 shadchin Exp $
|
|
--- buildsys.mk.in.orig Sat Dec 4 18:10:19 2010
|
|
+++ buildsys.mk.in Sat Dec 4 18:17:32 2010
|
|
@@ -89,7 +89,7 @@ OBJS9 = ${OBJS8:.xpm=.o}
|
|
OBJS10 = ${OBJS9:.S=.o}
|
|
OBJS += ${OBJS10:.po=.gmo}
|
|
|
|
-.SILENT:
|
|
+#.SILENT:
|
|
.SUFFIXES:
|
|
.SUFFIXES: .beam .c .cc .cxx .d .dep .erl .gmo .m .mm .o .po .py .pyc .xpm .S
|
|
.PHONY: all subdirs pre-depend depend install install-extra uninstall uninstall-extra clean distclean
|