1 line
16 KiB
C
1 line
16 KiB
C
|
/* Copyright (c) 2017, Computer History Museum
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted (subject to
the limitations in the disclaimer below) provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided with the distribution.
* Neither the name of Computer History Museum nor the names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE
COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
DAMAGE. */
#include "anal.h"
#define FILE_NUM 135
long AnalCount;
struct TAEDictState TAEDictionary;
Handle TAEDictHandle;
long LastAnalUse;
void AnalScanPeteInner(PETEHandle pte, struct TAESessionState *pSession, long *pScanned,Boolean toSpeak);
OSErr AnalInit(void);
OSErr AnalInitDictionary(struct TAEDictState *pDictionary);
OSErr AnalDispose(void);
OSErr AnalStart(void);
void AnalEnd(void);
void AnalIdle(void);
short AnalScore(struct TAESessionState *pSession);
#define kAnalScanFinished (-1)
#define AnalScanFinished(pte) (!(*PeteExtra(pte))->taeDesired || (*PeteExtra(pte))->taeScanned==kAnalScanFinished)
#define IsAnalHot(collection) ((collection)%2==0)
void SetupTAEDictionary(void);
void TeardownTAEDictionary(void);
char **AnalWhite(void);
/**********************************************************************
* AnalScan - the big analysis scanner, for all Pete records
**********************************************************************/
void AnalScan(void)
{
WindowPtr winWP;
MyWindowPtr win;
PETEHandle pte;
for (winWP=FrontWindow_();winWP;winWP=GetNextWindow(winWP))
{
if (IsKnownWindowMyWindow(winWP))
{
win = GetWindowMyWindowPtr (winWP);
for (pte=win->pteList;pte;pte=PeteNext(pte))
{
PeteExtra extra = **PeteExtra(pte);
while (!AnalScanFinished(pte))
{
if (AnalStart()) return;
UsingWindow(winWP);
AnalScanPete(pte,false,(*PeteExtra(pte))->taeSpeak);
AnalEnd();
if (NEED_YIELD) return;
}
}
}
}
AnalIdle();
}
/**********************************************************************
* AnalScanPete - the analysis scanner, for a single Pete record
**********************************************************************/
void AnalScanPete(PETEHandle pte,Boolean toCompletion,Boolean toSpeak)
{
long scanned = (*PeteExtra(pte))->taeScanned;
long len;
// Are we done?
if (!AnalScanFinished(pte))
{
// Make a copy of the session
struct TAESessionState session = (*PeteExtra(pte))->taeSession;
// do we need to destroy the session?
if (scanned != (*PeteExtra(pte))->taeScannedSession)
{
if (session.pvtext) TAEEndSession(&session);
Zero(session);
}
// do we need a session?
if (!session.pvtext)
{
SetupTAEDictionary();
TAEStartSession(&session,&TAEDictionary);
TeardownTAEDictionary();
}
len = PETEGetTextLen(PETE,pte);
// Scan at least once
if (session.pvtext)
do
{
AnalScanPet
|