DIRECTORY Rope,KeyNoteDatabase;  KeyNote: CEDAR DEFINITIONS= BEGIN ROPE: TYPE = Rope.ROPE;FileName: TYPE = Rope.ROPE;FileNameList: TYPE = LIST OF Rope.ROPE;FileNamesToMatch: TYPE =  REF FileNamesToMatchObject;FileNamesToMatchObject: TYPE = RECORD [ pattern: ROPE, wDir: ROPE _ NIL ];WordVerifierProc: TYPE = PROCEDURE [clientData: REF ANY, word: ROPE] RETURNS [BOOLEAN];TokenRelevanceThreshhold: TYPE = INT;StopListCutOff: TYPE = INT;Handle: TYPE = KeyNoteDatabase.DatabaseHandle;ResultList: TYPE = LIST OF Result;Result: TYPE = REF ANY;ResultObject: TYPE = RECORD [fileName: ROPE,overAllWeight: REAL,tokenInfoList: TokenInfoList];TokenInfoList: TYPE = LIST OF TokenInfo;TokenInfo: TYPE = REF ANY;TokenInfoObject: TYPE = RECORD [ token: ROPE,weight: REAL,frequency: INTEGER];BuildStopList: PROCEDURE[fileNamesToMatch: FileNamesToMatch, stopListCutOff: StopListCutOff] RETURNS [wordList: ResultList];OpenDatabase: PROCEDURE[databaseName: ROPE, fileNamesToMatch: FileNamesToMatch _ NIL,  wordVerifierProc: WordVerifierProc _ NIL, tokenRelevanceThreshhold: TokenRelevanceThreshhold _ 1, clientDataForVerifierProc: REF ANY _ NIL] RETURNS [ db: Handle];CloseDatabase: PROCEDURE [db: Handle];AddDocumentToIndex: PROCEDURE [db: Handle, fileName: FileName, wordVerifierProc: WordVerifierProc] ;RemoveDocumentFromIndex: PROCEDURE [db: Handle, fileName: FileName, wordVerifierProc: WordVerifierProc];FindDocumentsFromWords: PROCEDURE [db: Handle,  ropeList: ResultList] RETURNS [resultList: ResultList];Error: ERROR [ec: ErrorCode, explanation: ROPE _ NIL];ErrorCode: TYPE = ATOM;END.  т  File: KeyNote.mesaCopyright c 1987 by Xerox Corporation.  All rights reserved.Contents: Last edited by: Jack Kent, January 29, 1988 1:50:15 pm PST for every fileName that matches the pattern, every word in fileName is called with WordVerifierProc to verify whether it is a word or it should be ignored.this identfies the MINIMUM number of times a token must appear within a document in order to be considered a bona-fide keyword...and thus relevant!the top "StopListCutOff" words that appear in the document universe WILL appear in the stopList. This stopList can then be  passed down to the WordVerifierProc as clientData.ResultList is a List.LORA for easy sorting on overAllWeightResult: TYPE = REF ResultObject; Result: TYPE = ROPE; TokenInfoList is a List.LORA for easy sorting on weight contributed by tokens TokenInfo: TYPE = REF TokenInfoObject;used either to open or to build a database: if fileNamesToMatch=NIL THEN just open is presumeddocument entries returned are sorted by weightErrors raised during the execution of an operation indicate uncommon or abnormal conditions.  Clients should be prepared to catch these.$DatabaseProblems -- look at KeyNoteDatabase.ErrorJack Kent, December 21, 1987 2:20:15 pm PSTЭ╩>  Ш Ъ╧nЬЩJЪЬ
╧mЬ1Щ<ЧJЪЬ
Щ
ЪЬЩIcodeЪЬ+Щ+JШ ЧЪ╧k	ЬШ!JШЧJЪЭЬЯЬЯШJШ JЪЬЯЬШJШ JЪЯЬЯЬЯЬШJШ JЪЬ
ЯЬЯЬШJЪ	ЬЯЬЯЬЯЬЯЬШ'JЩ JЪЬЫЩЫJЪЬЯЬЯЬШ5JЪЬЯЬЯЬЯЬЯЬЯЬШJJЪЬЯЬЯ	ЬЯЬЯЬЯЬЯЬЯЬШWJШ JШ JЪЬЯЬyЩУJЪЬЯЬЯЬШ%JШ JЪЬDЯЬfЩоJЪЬЯЬЯЬШJШ JЪЬЯЬ"Ш.JШ JЪЬЯЬ"Щ;JЪЬЯЬЯЬЯЬШ"JЪЬЯЬЯЬЯЬШKЪЬЯЬЯЬЩ!KЪЬЯЬЯЬЩЪЬЯЬЯЬШJЪЬ
ЯЬШJЪЬЯЬШJШJШ ЧJЪЬЯЬ2ЩNJЪЬЯЬЯЬЯЬШ(JЪЬЯЬЯЬЯЬШJЪЬЯЬЯЬЩ&ЪЬЯЬЯЬШ!JЪЬЯЬШJЪЬЯЬШJЪЬЯЬШЧJШ JЪЭЬЯ	ЬEЯЬШ|JЩ JЪЬ@ЯЬЯЬЩ^JЪЭЬЯ	ЬЯЬ'ЯЬ(ЯЬUЯЬЯЬЯЬЯЬШ∙JШ JЪЭЬЯ	ЬШ&JШ JЪЭЬЯ	ЬGШdJШ JЪЭЬЯ	ЬFШhJШ JЩ.JЪЭЬЯ	Ь%ЯЬШgJШ JЩ JЩИKЪЭЬЯЬЯЬЯЬШ6ЪЬЯЬЯЬШKЪЬ2Щ2KЩ KЩ ЧJШ JШ JЪЯЬШKЪЬ╧r╨krЩ+JШ Ч ЕЧ    ^  ~  