|
DataMuseum.dkPresents historical artifacts from the history of: DKUUG/EUUG Conference tapes |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about DKUUG/EUUG Conference tapes Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - metrics - downloadIndex: T d
Length: 3423 (0xd5f) Types: TextFile Names: »ds_search.h«
└─⟦3d0c2be1b⟧ Bits:30001254 ISODE-5.0 Tape └─⟦eba4602b1⟧ »./isode-5.0.tar.Z« └─⟦d3ac74d73⟧ └─⟦this⟧ »isode-5.0/h/quipu/ds_search.h«
/* ds_search.h - structures for searching */ /* * $Header: /f/osi/h/quipu/RCS/ds_search.h,v 6.0 89/03/18 23:32:52 mrose Rel $ * * * $Log: ds_search.h,v $ * Revision 6.0 89/03/18 23:32:52 mrose * Release 5.0 * */ /* * NOTICE * * Acquisition, use, and distribution of this module and related * materials are subject to the restrictions of a license agreement. * Consult the Preface in the User's Manual for the full terms of * this agreement. * */ #ifndef QUIPUSRCH #define QUIPUSRCH #include "quipu/commonarg.h" #include "quipu/ds_error.h" #include "quipu/dap.h" typedef struct { AttributeType fi_sub_type; AV_Sequence fi_sub_initial; AV_Sequence fi_sub_any; AV_Sequence fi_sub_final; /* initial and final should be zero or */ /* one components only */ } Filter_Substrings; struct filter_item { int fi_type; #define FILTERITEM_EQUALITY 0 #define FILTERITEM_SUBSTRINGS 1 #define FILTERITEM_GREATEROREQUAL 2 #define FILTERITEM_LESSOREQUAL 3 #define FILTERITEM_PRESENT 4 #define FILTERITEM_APPROX 5 union { AttributeType fi_un_type; AVA fi_un_ava; Filter_Substrings fi_un_substrings; } fi_un; Soundex fi_soundex [MAXSOUNDEXKEYS][SOUNDEXKEYSIZE]; /* for dua approx matching only */ }; #define NULLFITEM (struct filter_item *) NULL #define UNSUB fi_un.fi_un_substrings #define UNAVA fi_un.fi_un_ava #define UNTYPE fi_un.fi_un_type #define filter_item_alloc() (struct filter_item *) smalloc (sizeof (struct filter_item)); typedef struct filter { char flt_type; #define FILTER_ITEM 0 #define FILTER_AND 1 #define FILTER_OR 2 #define FILTER_NOT 3 struct filter *flt_next; union { struct filter_item flt_un_item; /* a basic item */ struct filter *flt_un_filter; /* or a pointer to a chain of */ /* filters */ } flt_un; }filter, *Filter; #define NULLFILTER (Filter)NULL #define FUITEM flt_un.flt_un_item #define FUFILT flt_un.flt_un_filter #define filter_alloc() (Filter) smalloc (sizeof (filter)); struct ds_search_arg { CommonArgs sra_common; DN sra_baseobject; int sra_subset; #define SRA_BASEOBJECT 0 #define SRA_ONELEVEL 1 #define SRA_WHOLESUBTREE 2 Filter sra_filter; EntryInfoSelection sra_eis; }; struct ds_search_unit { CommonResults srr_common; DN srr_object; EntryInfo *srr_entries; int srr_limitproblem; /* See LIST for definition of values */ ContinuationRef srr_cr; }; struct ds_search_result { char srr_correlated; union { struct ds_search_unit * srr_unit; struct ds_search_result * srr_parts; } srr_un; #define CSR_common srr_un.srr_unit->srr_common #define CSR_object srr_un.srr_unit->srr_object #define CSR_entries srr_un.srr_unit->srr_entries #define CSR_limitproblem srr_un.srr_unit->srr_limitproblem #define CSR_cr srr_un.srr_unit->srr_cr struct ds_search_result * srr_next; }; #define NULLSRR ((struct ds_search_result *) 0) /* following used by search for scheduling */ struct ds_search_task { DN st_baseobject; DN st_alias; int st_subset; int st_size; time_t st_time; ContinuationRef st_cr; struct ds_search_task * st_next; }; #define NULL_ST ((struct ds_search_task *) NULL) #define st_alloc() (struct ds_search_task *) smalloc (sizeof(struct ds_search_task)); #endif