From mboxrd@z Thu Jan 1 00:00:00 1970 Path: news.gmane.org!not-for-mail From: Emanuel Berg Newsgroups: gmane.emacs.help Subject: Re: Check for redundancy Date: Fri, 26 Jun 2015 17:01:39 +0200 Message-ID: <87si9ev7ho.fsf@nl106-137-147.student.uu.se> References: <558A7875.4050905@easy-emacs.de> <24a1b328-82a8-44ff-8f8d-1425ab89ab67@default> <20150624211049.GA14854@tuxteam.de> <20150625074741.GA32430@tuxteam.de> NNTP-Posting-Host: plane.gmane.org Mime-Version: 1.0 Content-Type: text/plain X-Trace: ger.gmane.org 1435332620 25068 80.91.229.3 (26 Jun 2015 15:30:20 GMT) X-Complaints-To: usenet@ger.gmane.org NNTP-Posting-Date: Fri, 26 Jun 2015 15:30:20 +0000 (UTC) To: help-gnu-emacs@gnu.org Original-X-From: help-gnu-emacs-bounces+geh-help-gnu-emacs=m.gmane.org@gnu.org Fri Jun 26 17:30:12 2015 Return-path: Envelope-to: geh-help-gnu-emacs@m.gmane.org Original-Received: from lists.gnu.org ([208.118.235.17]) by plane.gmane.org with esmtp (Exim 4.69) (envelope-from ) id 1Z8VZz-0007oR-Eb for geh-help-gnu-emacs@m.gmane.org; Fri, 26 Jun 2015 17:30:11 +0200 Original-Received: from localhost ([::1]:60789 helo=lists.gnu.org) by lists.gnu.org with esmtp (Exim 4.71) (envelope-from ) id 1Z8VZy-0005Qq-RR for geh-help-gnu-emacs@m.gmane.org; Fri, 26 Jun 2015 11:30:10 -0400 Original-Received: from eggs.gnu.org ([2001:4830:134:3::10]:33999) by lists.gnu.org with esmtp (Exim 4.71) (envelope-from ) id 1Z8V9i-000125-TR for help-gnu-emacs@gnu.org; Fri, 26 Jun 2015 11:03:08 -0400 Original-Received: from Debian-exim by eggs.gnu.org with spam-scanned (Exim 4.71) (envelope-from ) id 1Z8V9e-0000C0-TS for help-gnu-emacs@gnu.org; Fri, 26 Jun 2015 11:03:02 -0400 Original-Received: from plane.gmane.org ([80.91.229.3]:49997) by eggs.gnu.org with esmtp (Exim 4.71) (envelope-from ) id 1Z8V9e-0000Br-Na for help-gnu-emacs@gnu.org; Fri, 26 Jun 2015 11:02:58 -0400 Original-Received: from list by plane.gmane.org with local (Exim 4.69) (envelope-from ) id 1Z8V9d-0007zX-IM for help-gnu-emacs@gnu.org; Fri, 26 Jun 2015 17:02:57 +0200 Original-Received: from nl106-137-98.student.uu.se ([130.243.137.98]) by main.gmane.org with esmtp (Gmexim 0.1 (Debian)) id 1AlnuQ-0007hv-00 for ; Fri, 26 Jun 2015 17:02:57 +0200 Original-Received: from embe8573 by nl106-137-98.student.uu.se with local (Gmexim 0.1 (Debian)) id 1AlnuQ-0007hv-00 for ; Fri, 26 Jun 2015 17:02:57 +0200 X-Injected-Via-Gmane: http://gmane.org/ Mail-Followup-To: help-gnu-emacs@gnu.org Original-Lines: 35 Original-X-Complaints-To: usenet@ger.gmane.org X-Gmane-NNTP-Posting-Host: nl106-137-98.student.uu.se Mail-Copies-To: never User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/24.4 (gnu/linux) Cancel-Lock: sha1:0Xxcml2FWINCoWJQYMHX/Ezh3C0= X-detected-operating-system: by eggs.gnu.org: Genre and OS details not recognized. X-Received-From: 80.91.229.3 X-BeenThere: help-gnu-emacs@gnu.org X-Mailman-Version: 2.1.14 Precedence: list List-Id: Users list for the GNU Emacs text editor List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Errors-To: help-gnu-emacs-bounces+geh-help-gnu-emacs=m.gmane.org@gnu.org Original-Sender: help-gnu-emacs-bounces+geh-help-gnu-emacs=m.gmane.org@gnu.org Xref: news.gmane.org gmane.emacs.help:105199 Archived-At: tomas@tuxteam.de writes: > *I* for one consider "hungarian notation" highly > redundant -- let the type system cope with that, > others may not). Hungarian notation is a joke. The whole idea with high level code is that you shouldn't think about that. Now HN is only in systems like Visual Basic and M$ Access because they come with WYSIWYG GUI builders which typically produce one million objects with similar names. So to get to the properties of one such object you'd start with the type (e.g., button) to limit the set of object in your "search". Ah! I get angry just by thinking about it. > That said, I have seen this rough measure (gzip > compression ratio) used as a rough "similarity > measure": compress each file separately, slap both > together and compress, and watch the reduction. How about just compressing the entire source and make a quota of the decrease in size? Those algorithms work on recurring patterns being replaced by something much shorter indicating the occurence of the pattern. If there isn't anything recurring it can't be compressed. So if it is totally factored up then it can only be "literally" compressed, and not in terms of the code logic, which should be much less for a big project. Right? I don't know. Next time I'm here I'll test this on some of my favorite software... -- underground experts united http://user.it.uu.se/~embe8573