DataMuseum.dk

Presents historical artifacts from the history of:

DKUUG/EUUG Conference tapes

This is an automatic "excavation" of a thematic subset of
artifacts from Datamuseum.dk's BitArchive.

See our Wiki for more about DKUUG/EUUG Conference tapes

Excavated with: AutoArchaeologist - Free & Open Source Software.


top - metrics - download
Index: T g

⟦f874736f8⟧ TextFile

    Length: 1833 (0x729)
    Types: TextFile
    Names: »gen-perf.h«

Derivation

└─⟦a05ed705a⟧ Bits:30007078 DKUUG GNU 2/12/89
    └─⟦cc8755de2⟧ »./libg++-1.36.1.tar.Z« 
        └─⟦23757c458⟧ 
            └─⟦this⟧ »libg++/gperf/src/gen-perf.h« 

TextFile

/* This may look like C code, but it is really -*- C++ -*- */

/* Provides high-level routines to manipulate the keywork list 
   structures the code generation output. 

   Copyright (C) 1989 Free Software Foundation, Inc.
   written by Douglas C. Schmidt (schmidt@ics.uci.edu)

This file is part of GNU GPERF.

GNU GPERF is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 1, or (at your option)
any later version.

GNU GPERF is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with GNU GPERF; see the file COPYING.  If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.  */

#pragma once
#include "std-err.h"
#include "key-list.h"
#include "bool-array.h"

class Gen_Perf : private Key_List, private Bool_Array
{
private:
  int         max_hash_value;    /* Maximum possible hash value. */
  int         fewest_hits;       /* Records fewest # of collisions for asso value. */
  int         best_char_choice;  /* Best (but not optimal) char index found so far. */
  int         best_asso_value;   /* Best (but not optimal) asso value found so far. */
  
  void        change (List_Node *prior, List_Node *curr);
  int         affects_prev (char c, List_Node *curr);
  static int  hash (List_Node *key_node);
  static int  merge_sets (char *set_1, char *set_2, char *set_3);
  static void sort_set (char *union_set, int len);
  
public:
              Gen_Perf (void);
             ~Gen_Perf (void);
  int         operator () (void);
};