1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211
|
/* accutils.c
* ===========================================================================
*
* PUBLIC DOMAIN NOTICE
* National Center for Biotechnology Information
*
* This software/database is a "United States Government Work" under the
* terms of the United States Copyright Act. It was written as part of
* the author's official duties as a United States Government employee and
* thus cannot be copyrighted. This software/database is freely available
* to the public for use. The National Library of Medicine and the U.S.
* Government have not placed any restriction on its use or reproduction.
*
* Although all reasonable efforts have been taken to ensure the accuracy
* and reliability of the software and data, the NLM and the U.S.
* Government do not and cannot warrant the performance or results that
* may be obtained by using this software or data. The NLM and the U.S.
* Government disclaim all warranties, express or implied, including
* warranties of performance, merchantability or fitness for any particular
* purpose.
*
* Please cite the author in any work or product based on this material.
*
* ===========================================================================
*
* RCS $Id: accutils.c,v 6.15 1999/04/01 13:56:34 sicotte Exp $
*
* Author: J. Epstein
*
* Version Creation Date: 10/18/93
*
* File Description:
* Utilities which make use of the Entrez "data access library"
*
* Modifications:
* --------------------------------------------------------------------------
* $Log: accutils.c,v $
* Revision 6.15 1999/04/01 13:56:34 sicotte
* Moved WHICH_db_accession,IS_ntdb_accession,IS_protdb_accession to
* sequtil.ch
* Removed old static functions of Colombe (that are public in salutil.c)
* The only code left in accutils.c is the Entrez Access code.
*
* Revision 6.14 1999/03/31 21:13:47 sicotte
* Add info on N-accessions
*
* Revision 6.13 1999/03/31 13:34:18 sicotte
* in WHICH_ntdb_accession, swapped (C** and B** prot accession for embl/ddbj)
*
* Revision 6.12 1999/03/18 20:24:05 sicotte
* changed the define name for NC_ accession
*
* Revision 6.11 1999/03/18 20:18:18 sicotte
* added REFSEQ accession numbers and macro ACCN_IS_GENBANK()
*
* Revision 6.10 1999/03/18 15:34:04 sicotte
* Updated Accession List and added protein Accessions
* for functions IS_ntdb_accession and IS_protdb_accession.
* New function WHICH_db_accession with return code allowing
* to figure out the molecule type and the database from macros
* in accutils.h
*
* Revision 6.9 1999/02/24 16:48:09 kans
* added IS_ntdb_accession and IS_protdb_accession, removed NormalizeSeqAlignId
*
* Revision 6.8 1999/01/27 16:20:51 chappey
* update IS_ntdb_accession with AB, AJ
*
* Revision 6.7 1999/01/06 14:18:36 grisha
* add defines to switch ID0/ID1 usage
*
* Revision 6.6 1998/06/12 19:19:10 kans
* fixed unix compiler warnings
*
* Revision 6.5 1998/04/28 19:29:13 shavirin
* Fixed minor purify detected bug.
*
* Revision 6.4 1998/02/11 19:50:00 kans
* FastaSeqPort takes code parameter
*
* Revision 6.3 1997/11/14 22:13:50 vakatov
* [WIN32,DLL] Added NLM_EXTERN's
*
* Revision 6.2 1997/09/12 15:28:26 chappey
* Revision changes in NormalizeSeqAlign
*
* Revision 6.1 1997/09/04 14:14:50 chappey
* Revision changes in NormalizeSeqAlign
*
* Revision 5.15 1997/08/07 16:02:40 kans
* Revision added NormalizeSeqAlignId (Colombe)
*
* Revision 5.14 1997/06/26 21:55:17 vakatov
* Revision [PC] DLL'd "ncbicdr.lib", "ncbiacc.lib", "ncbinacc.lib" and "ncbicacc.lib"
*
* Revision 5.13 1997/05/14 14:27:57 shavirin
* Revision Function AccessionToFasta adopted for protein accessions
*
* Revision 5.11 1997/05/13 21:11:05 shavirin
* Revision Changed function AccessionToFasta() to use PubMed accession indexes
*
* Revision 5.10 1997/02/04 18:58:01 epstein
* Revision add GetFullEntrezTermList() function
*
* Revision 5.9 1997/01/13 15:13:34 brandon
* changed EntrezStringToField
*
* Revision 5.8 1997/01/07 17:34:33 epstein
* eliminate PMENTREZ by default
*
* Revision 5.7 1996/10/01 18:19:03 shavirin
* Removed unused variable and fixed memory problems in AccessionToFasta()
*
* Revision 5.6 1996/09/26 17:52:45 ostell
* made AccessionToFasta LIBCALL
*
* Revision 5.5 1996/09/23 21:22:09 shavirin
* Added new function AccessionToFasta(), returning Fasta entry for
* given Accession or GI as a string
*
* Revision 5.2 1996/08/14 15:15:05 brandon
* added date parameter to tleval functions
*
* Revision 5.1 1996/07/01 14:06:35 epstein
* add 'join function' EntrezCommonHierAncestor()
*
* Revision 4.6 1996/05/21 17:37:31 epstein
* eliminate case-sensitivity
*
* Revision 4.5 1996/05/14 21:01:40 epstein
* remove references to FLD_MLOC
*
* Revision 4.4 1996/04/23 19:14:46 epstein
* memory-leak/acces cleanup, per D. Vakatov
*
* Revision 4.3 1995/10/11 13:40:37 epstein
* make EntrezStringToField() and EntrezFieldToString() data-driven
*
* Revision 4.2 1995/10/02 02:36:00 epstein
* add range-checking
*
* Revision 4.1 1995/08/24 20:44:21 epstein
* add more stuff for genomes
* ==========================================================================
*/
#define REVISION_STR "$Revision: 6.15 $"
#include <accutils.h>
#ifndef _CDROMLIB_
#include <cdromlib.h>
#endif
#define ERRPOST_LVL(x) ((x) == NULL ? SEV_INFO : SEV_ERROR)
#define LEXCHAR_LPAREN 1
#define LEXCHAR_RPAREN 2
#define LEXCHAR_LBRACKET 3
#define LEXCHAR_RBRACKET 4
#define LEXCHAR_QUOTE 5
#define LEXCHAR_AND 6
#define LEXCHAR_OR 7
#define LEXCHAR_NOT 8
#define LEXCHAR_COMMA 9
#define LEXCHAR_ATSIGN 10
#define LEXCHAR_BACKSLASH 11
#define LEXCHAR_WHITESPACE 12
#define LEXCHAR_SEMICOLON 13
#define LEXCHAR_COLON 14
#define LEXCHAR_EOL 15
#define LEXCHAR_NULL 16
#define LEXCHAR_OTHER 17
#define LEXSTATE_IDLE 0
#define LEXSTATE_BACKSLASHED 1
#define LEXSTATE_INQUOTE 2
#define LEXSTATE_INQUOTE_AFTERBSLASH 3
#define LEXSTATE_INSTRING 4
#define LEXSTATE_ERROR 5
#define LEXTOK_LPAREN 1
#define LEXTOK_RPAREN 2
#define LEXTOK_LBRACKET 3
#define LEXTOK_RBRACKET 4
#define LEXTOK_AND 5
#define LEXTOK_OR 6
#define LEXTOK_NOT 7
#define LEXTOK_COMMA 8
#define LEXTOK_ATSIGN 9
#define LEXTOK_STRING 10
#define LEXTOK_RANGE 11
static Int2 lexPosition = 0;
static CharPtr lexString = NULL;
static Int2 lexState = LEXSTATE_IDLE;
static ValNodePtr nextnode = NULL;
static ValNode nextRealNode;
static Int2 lastGood = -1;
static Int2 lastBad = -1;
static Int2 LexClassifyChar(Char c)
{
Int2 retval;
switch(c) {
case '(': retval = LEXCHAR_LPAREN; break;
case ')': retval = LEXCHAR_RPAREN; break;
case '[': retval = LEXCHAR_LBRACKET; break;
case ']': retval = LEXCHAR_RBRACKET; break;
case '"': retval = LEXCHAR_QUOTE; break;
case '&': retval = LEXCHAR_AND; break;
case '|': retval = LEXCHAR_OR; break;
case '-': retval = LEXCHAR_NOT; break;
case ',': retval = LEXCHAR_COMMA; break;
case '@': retval = LEXCHAR_ATSIGN; break;
case '\\': retval = LEXCHAR_BACKSLASH; break;
case ' ':
case '\t': retval = LEXCHAR_WHITESPACE; break;
case ';': retval = LEXCHAR_SEMICOLON; break;
case ':': retval = LEXCHAR_COLON; break;
case '\0': retval = LEXCHAR_NULL; break;
case '\r':
case '\n': retval = LEXCHAR_EOL; break;
default: retval = LEXCHAR_OTHER; break;
}
return retval;
}
/* Returns -1 if no token available, else the position of the token */
static Int2 EntrezLexExpression(CharPtr str, ValNodePtr vnp)
{
Int2 startPos;
Int2 classChar;
Int2 token = 0;
Boolean done;
Char c;
CharPtr lexToken = NULL;
CharPtr lexTokenStart;
Int2 len;
if (str == NULL && lexString == NULL)
return -1;
if (str != NULL)
{
MemFree(lexString);
lexString = StringSave(str);
lexPosition = 0;
lexState = LEXSTATE_IDLE;
}
if (vnp == NULL)
return -1;
len = StringLen(lexString);
startPos = lexPosition;
if (lexPosition >= len)
{
lexState = LEXSTATE_ERROR;
token = -1;
lexToken = MemNew(1);
} else {
lexToken = MemNew(StringLen(&lexString[lexPosition]) + 1);
}
lexTokenStart = lexToken;
for (done = FALSE; ! done && lexPosition <= len; lexPosition++)
{
c = lexString[lexPosition];
classChar = LexClassifyChar(c);
switch (lexState) {
case LEXSTATE_IDLE:
switch (classChar) {
case LEXCHAR_LPAREN:
token = LEXTOK_LPAREN; done = TRUE; break;
case LEXCHAR_RPAREN:
token = LEXTOK_RPAREN; done = TRUE; break;
case LEXCHAR_LBRACKET:
token = LEXTOK_LBRACKET; done = TRUE; break;
case LEXCHAR_RBRACKET:
token = LEXTOK_RBRACKET; done = TRUE; break;
case LEXCHAR_AND:
token = LEXTOK_AND; done = TRUE; break;
case LEXCHAR_OR:
token = LEXTOK_OR; done = TRUE; break;
case LEXCHAR_NOT:
token = LEXTOK_NOT; done = TRUE; break;
case LEXCHAR_COMMA:
token = LEXTOK_COMMA; done = TRUE; break;
case LEXCHAR_ATSIGN:
token = LEXTOK_ATSIGN; done = TRUE; break;
case LEXCHAR_COLON:
token = LEXTOK_RANGE; done = TRUE; break;
case LEXCHAR_QUOTE:
lexState = LEXSTATE_INQUOTE; break;
case LEXCHAR_BACKSLASH:
lexState = LEXSTATE_BACKSLASHED; break;
case LEXCHAR_EOL:
case LEXCHAR_WHITESPACE:
startPos = lexPosition + 1; break;
case LEXCHAR_SEMICOLON:
case LEXCHAR_NULL:
lexState = LEXSTATE_ERROR; done = TRUE; break;
case LEXCHAR_OTHER:
default:
lexState = LEXSTATE_INSTRING; *lexToken++ = c; break;
}
break;
case LEXSTATE_BACKSLASHED:
switch (classChar) {
case LEXCHAR_NULL:
case LEXCHAR_EOL:
*lexToken++ = '\0'; done = TRUE; lexState = LEXSTATE_IDLE; break;
case LEXCHAR_LPAREN:
case LEXCHAR_RPAREN:
case LEXCHAR_LBRACKET:
case LEXCHAR_RBRACKET:
case LEXCHAR_QUOTE:
case LEXCHAR_AND:
case LEXCHAR_OR:
case LEXCHAR_NOT:
case LEXCHAR_COMMA:
case LEXCHAR_ATSIGN:
case LEXCHAR_BACKSLASH:
case LEXCHAR_WHITESPACE:
case LEXCHAR_SEMICOLON:
case LEXCHAR_COLON:
case LEXCHAR_OTHER:
default:
lexState = LEXSTATE_INSTRING; *lexToken++ = c; break;
}
break;
case LEXSTATE_INQUOTE:
switch (classChar) {
case LEXCHAR_QUOTE:
token = LEXTOK_STRING;
*lexToken++ = '\0';
done = TRUE;
lexState = LEXSTATE_IDLE;
break;
case LEXCHAR_BACKSLASH:
lexState = LEXSTATE_INQUOTE_AFTERBSLASH; break;
case LEXCHAR_NULL:
case LEXCHAR_EOL:
lexState = LEXSTATE_ERROR; done = TRUE; break;
default:
*lexToken++ = c; break;
}
break;
case LEXSTATE_INQUOTE_AFTERBSLASH:
switch (classChar) {
case LEXCHAR_NULL:
case LEXCHAR_EOL:
lexState = LEXSTATE_ERROR; done = TRUE; break;
default:
lexState = LEXSTATE_INQUOTE; *lexToken++ = c; break;
}
break;
case LEXSTATE_INSTRING:
switch (classChar) {
case LEXCHAR_WHITESPACE:
case LEXCHAR_SEMICOLON:
case LEXCHAR_NULL:
case LEXCHAR_EOL:
token = LEXTOK_STRING;
*lexToken++ = '\0';
done = TRUE;
lexState = LEXSTATE_IDLE;
break;
case LEXCHAR_BACKSLASH:
lexState = LEXSTATE_BACKSLASHED;
break;
case LEXCHAR_QUOTE:
lexState = LEXSTATE_INQUOTE;
break;
case LEXCHAR_OTHER:
*lexToken++ = c; break;
default:
token = LEXTOK_STRING;
*lexToken++ = '\0';
done = TRUE;
lexState = LEXSTATE_IDLE;
lexPosition--; /* push back the last character */
break;
}
break;
case LEXSTATE_ERROR:
done = TRUE;
break;
}
}
vnp->choice = (Uint1) token;
vnp->data.ptrvalue = NULL;
if (token == LEXTOK_STRING)
{
vnp->data.ptrvalue = lexTokenStart;
} else {
MemFree(lexTokenStart);
}
if (lexState == LEXSTATE_ERROR)
return -1;
else
return startPos;
}
static void StrNextNode(void)
{
nextnode = &nextRealNode;
if (EntrezLexExpression(NULL, nextnode) < 0)
{
nextnode = NULL;
}
lastGood = lastBad;
lastBad = lexPosition;
}
static Boolean StrExpression PROTO((ValNodePtr elst, DocType db, DocField fld));
static Boolean FindTermRequired(CharPtr term)
{
Int2 len;
if (term == NULL)
return FALSE;
len = StrLen(term);
return ((len > 3 && term[len-1] == '.' && term[len-2] == '.' &&
term[len-3] == '.') || (len > 1 && term[len-1] == '*') ||
StrChr(term, '?') != NULL);
}
/* traverse all the possible fields, and take the "union" of this term */
/* over all the possibilities for the specified database */
static Boolean AddAllFields(ValNodePtr elst, CharPtr term, DocType db, Boolean special)
{
EntrezInfoPtr eip;
Boolean first = TRUE;
Int4 specialCount;
Int4 totalCount;
EntrezFieldDataPtr fields;
DocField fld;
Boolean findTermRequired;
if ((eip = EntrezGetInfo()) == NULL || elst == NULL)
return FALSE;
if (db < 0 || db >= eip->type_count)
return FALSE;
findTermRequired = FindTermRequired(term);
fields = eip->types[db].fields;
for (fld = 0; fld < eip->field_count; fld++)
{
if (fields == NULL || fields[fld].num_terms <= 0 || fld ==
FLD_ORGN_HIER || (db == TYP_ML && fld == FLD_PROT))
continue;
if (first)
{
EntrezTLAddLParen(elst);
first = FALSE;
} else {
EntrezTLAddOR(elst);
}
if (findTermRequired)
{
EntrezFindTerm(db, fld, term, &specialCount, &totalCount);
}
EntrezTLAddTerm(elst, term, db, fld, special);
}
if (! first)
{
EntrezTLAddRParen(elst);
}
return TRUE;
}
static Boolean
StrFactor(ValNodePtr elst, DocType db, DocField fld)
{
if (nextnode == NULL)
{
ErrPostEx(ERRPOST_LVL(elst), ERR_CD_LEX, 0, "Null factor");
return FALSE;
}
if (nextnode->choice == LEXTOK_LPAREN)
{
if (elst != NULL)
EntrezTLAddLParen (elst);
StrNextNode();
if (! StrExpression(elst, db, fld))
{
return FALSE;
}
if (nextnode != NULL && nextnode->choice == LEXTOK_RPAREN)
{
if (elst != NULL)
EntrezTLAddRParen (elst);
StrNextNode();
} else {
ErrPostEx(ERRPOST_LVL(elst), ERR_CD_LEX, 0, "Missing right paren");
return FALSE;
}
} else {
if (nextnode->choice == LEXTOK_STRING)
{
CharPtr term;
Boolean special = FALSE;
CharPtr fldStr;
CharPtr highRangeStr = NULL;
Boolean allFields = FALSE;
term = (CharPtr) (nextnode->data.ptrvalue);
StrNextNode();
if (nextnode != NULL && nextnode->choice == LEXTOK_RANGE)
{
StrNextNode();
if (nextnode == NULL || nextnode->choice != LEXTOK_STRING)
{
ErrPostEx(ERRPOST_LVL(elst), ERR_CD_LEX, 0, "missing second half of range");
MemFree(term);
return FALSE;
}
highRangeStr = (CharPtr) (nextnode->data.ptrvalue);
StrNextNode();
}
if (nextnode != NULL && nextnode->choice == LEXTOK_LBRACKET)
{
StrNextNode();
if (nextnode == NULL || nextnode->choice != LEXTOK_STRING)
{
ErrPostEx(ERRPOST_LVL(elst), ERR_CD_LEX, 0, "missing field id after bracket");
MemFree(term);
MemFree(highRangeStr);
return FALSE;
}
fldStr = (CharPtr) (nextnode->data.ptrvalue);
if (fldStr != NULL && StrCmp(fldStr, "*") == 0)
{
allFields = TRUE;
} else {
fld = EntrezStringToField(db, fldStr);
}
MemFree(nextnode->data.ptrvalue);
if (!allFields && fld < 0)
{
ErrPostEx(ERRPOST_LVL(elst), ERR_CD_LEX, 0, "bad field identifier");
MemFree(term);
MemFree(highRangeStr);
return FALSE;
}
StrNextNode();
if (nextnode == NULL || (nextnode->choice != LEXTOK_COMMA &&
nextnode->choice != LEXTOK_RBRACKET))
{
ErrPostEx(ERRPOST_LVL(elst), ERR_CD_LEX, 0, "missing right bracket");
MemFree(term);
MemFree(highRangeStr);
return FALSE;
}
if (nextnode->choice == LEXTOK_COMMA)
{
StrNextNode();
if (nextnode == NULL || nextnode->choice != LEXTOK_STRING ||
StringCmp(nextnode->data.ptrvalue, "S") != 0)
{
ErrPostEx(ERRPOST_LVL(elst), ERR_CD_LEX, 0, "field qualifier error");
MemFree(term);
MemFree(highRangeStr);
return FALSE;
}
MemFree(nextnode->data.ptrvalue);
special = TRUE;
StrNextNode();
if (nextnode == NULL || nextnode->choice != LEXTOK_RBRACKET)
{
ErrPostEx(ERRPOST_LVL(elst), ERR_CD_LEX, 0, "missing right bracket");
MemFree(term);
MemFree(highRangeStr);
return FALSE;
}
}
StrNextNode();
}
/* if ( the default specified by caller is -1 ==> all ) then */
if (fld < 0)
{
allFields = TRUE;
if (highRangeStr != NULL)
{
ErrPostEx(ERRPOST_LVL(elst), ERR_CD_LEX, 0, "ranges require explicit field specification");
MemFree(term);
MemFree(highRangeStr);
return FALSE;
}
}
if (elst != NULL)
{
if (allFields)
{
AddAllFields(elst, term, db, special);
} else {
Int4 specialCount;
Int4 totalCount;
if (FindTermRequired(term))
{
EntrezFindTerm(db, fld, term, &specialCount, &totalCount);
}
EntrezTLAddTermWithRange(elst, term, db, fld, special, highRangeStr);
}
}
MemFree (term);
MemFree(highRangeStr);
} else {
ErrPostEx(ERRPOST_LVL(elst), ERR_CD_LEX, 0, "invalid token");
return FALSE;
}
}
return TRUE;
}
static Boolean
StrTerm(ValNodePtr elst, DocType db, DocField fld)
{
if (! StrFactor(elst, db, fld))
return FALSE;
while (nextnode != NULL && nextnode->choice == LEXTOK_AND)
{
if (elst != NULL)
EntrezTLAddAND(elst);
StrNextNode();
if (! StrFactor(elst, db, fld))
return FALSE;
}
return TRUE;
}
static Boolean
StrDiff(ValNodePtr elst, DocType db, DocField fld)
{
if (! StrTerm(elst, db, fld))
return FALSE;
while (nextnode != NULL && nextnode->choice == LEXTOK_OR)
{
if (elst != NULL)
EntrezTLAddOR(elst);
StrNextNode();
if (! StrTerm(elst, db, fld))
return FALSE;
}
return TRUE;
}
static Boolean
StrExpression(ValNodePtr elst, DocType db, DocField fld)
{
if (! StrDiff(elst, db, fld))
return FALSE;
while (nextnode != NULL && nextnode->choice == LEXTOK_NOT)
{
if (elst != NULL)
EntrezTLAddBUTNOT(elst);
StrNextNode();
if (! StrDiff(elst, db, fld))
return FALSE;
}
return TRUE;
}
NLM_EXTERN CharPtr LIBCALL EntrezFieldToString(DocType db, DocField fld)
{
CharPtr fldStr;
static Char str[6];
if (EntrezIsInited())
{
EntrezInfoPtr eip;
if ((eip = EntrezGetInfo()) != NULL && fld < eip->field_count)
{
StrNCpy(str, eip->field_info[fld].tag, sizeof(str) - 1);
StringUpper(str);
return str;
}
}
switch(fld)
{
case FLD_WORD:
fldStr = "WORD"; break;
case FLD_MESH:
fldStr = "MESH"; break;
case FLD_AUTH:
fldStr = "AUTH"; break;
case FLD_JOUR:
fldStr = "JOUR"; break;
case FLD_GENE:
fldStr = "GENE"; break;
case FLD_KYWD:
fldStr = "KYWD"; break;
case FLD_ECNO:
fldStr = "ECNO"; break;
case FLD_ORGN:
fldStr = "ORGN"; break;
case FLD_ACCN:
fldStr = "ACCN"; break;
case FLD_PROT:
fldStr = "PROT"; break;
case FLD_ORGN_HIER:
fldStr = "HIER"; break;
case FLD_DATE:
fldStr = "DATE"; break;
case FLD_FKEY:
fldStr = "FKEY"; break;
case FLD_PROP:
fldStr = "PROP"; break;
case FLD_SUBS:
fldStr = "SUBS"; break;
default:
fldStr = "????";
}
return StringSave(fldStr);
}
NLM_EXTERN DocField LIBCALL EntrezStringToField(DocType db, CharPtr str)
{
if (str == NULL)
return -1;
#ifdef _PMENTREZ_
return PMEntrezStringToField(db,str);
#else
if (EntrezIsInited())
{
EntrezInfoPtr eip;
DocField fld;
if ((eip = EntrezGetInfo()) != NULL)
{
for (fld = 0; fld < eip->field_count; fld++)
{
if (StringICmp(str, eip->field_info[fld].tag) == 0)
return fld;
}
}
}
if (StringICmp(str, "WORD") == 0)
return FLD_WORD;
if (StringICmp(str, "MESH") == 0)
return FLD_MESH;
if (StringICmp(str, "AUTH") == 0)
return FLD_AUTH;
if (StringICmp(str, "JOUR") == 0)
return FLD_JOUR;
if (StringICmp(str, "GENE") == 0)
return FLD_GENE;
if (StringICmp(str, "KYWD") == 0)
return FLD_KYWD;
if (StringICmp(str, "ECNO") == 0)
return FLD_ECNO;
if (StringICmp(str, "ORGN") == 0)
return FLD_ORGN;
if (StringICmp(str, "ACCN") == 0)
return FLD_ACCN;
if (StringICmp(str, "PROT") == 0)
return FLD_PROT;
if (StringICmp(str, "HIER") == 0)
return FLD_ORGN_HIER;
if (StringICmp(str, "DATE") == 0)
return FLD_DATE;
if (StringICmp(str, "FKEY") == 0)
return FLD_FKEY;
if (StringICmp(str, "PROP") == 0)
return FLD_PROP;
if (StringICmp(str, "SUBS") == 0)
return FLD_SUBS;
return -1;
#endif
}
NLM_EXTERN LinkSetPtr LIBCALL EntrezPMTLEvalString(CharPtr str, DocType db, DocField fld, Int2Ptr begin, Int2Ptr end, void * edc)
{
LinkSetPtr lsp;
ValNodePtr elst;
if (begin != NULL)
{
*begin = -1;
}
if (end != NULL)
{
*end = -1;
}
if (str == NULL || *str == '\0')
{
return NULL;
}
if (db != TYP_ML && db != TYP_SEQ && db != TYP_AA && db != TYP_NT && db != TYP_ST && db != TYP_CH)
{
return NULL;
}
if ((elst = EntrezTLNew(db)) == NULL)
{
return NULL;
}
EntrezLexExpression(str, NULL);
StrNextNode();
lsp = NULL;
if (StrExpression(elst, db, fld) && nextnode == NULL)
{
#ifdef _PMENTREZ_
lsp = EntrezPMTLEval(elst,edc);
#else
lsp = EntrezTLEval(elst);
#endif /* _PMENTREZ_ */
}
EntrezTLFree(elst);
if (lastGood < lastBad)
{
lastGood = lastBad;
}
if (begin != NULL)
{
*begin = lastGood;
}
if (end != NULL)
{
*end = lastBad;
}
return lsp;
}
NLM_EXTERN LinkSetPtr LIBCALL EntrezTLEvalString(CharPtr str, DocType db, DocField fld, Int2Ptr begin, Int2Ptr end)
{
return EntrezPMTLEvalString(str,db,fld,begin,end,NULL);
}
NLM_EXTERN ByteStorePtr LIBCALL EntrezPMTLEvalXString(CharPtr str, DocType db, DocField fld, Int2Ptr begin, Int2Ptr end, void * edc)
{
ByteStorePtr bsp;
ValNodePtr elst;
if (begin != NULL)
{
*begin = -1;
}
if (end != NULL)
{
*end = -1;
}
if (str == NULL || *str == '\0')
{
return NULL;
}
if (db != TYP_ML && db != TYP_SEQ && db != TYP_AA && db != TYP_NT && db != TYP_ST && db != TYP_CH)
{
return NULL;
}
if ((elst = EntrezTLNew(db)) == NULL)
{
return NULL;
}
EntrezLexExpression(str, NULL);
StrNextNode();
bsp = NULL;
if (StrExpression(elst, db, fld) && nextnode == NULL)
{
#ifdef _PMENTREZ_
bsp = EntrezPMTLEvalX(elst,edc);
#else
bsp = EntrezTLEvalX(elst);
#endif
}
EntrezTLFree(elst);
if (lastGood < lastBad)
{
lastGood = lastBad;
}
if (begin != NULL)
{
*begin = lastGood;
}
if (end != NULL)
{
*end = lastBad;
}
return bsp;
}
NLM_EXTERN ByteStorePtr LIBCALL EntrezTLEvalXString(CharPtr str, DocType db, DocField fld, Int2Ptr begin, Int2Ptr end)
{
return EntrezPMTLEvalXString(str,db,fld,begin,end,NULL);
}
NLM_EXTERN Int4 LIBCALL EntrezPMTLEvalCountString(CharPtr str, DocType db, DocField fld, Int2Ptr begin, Int2Ptr end, void * edc)
{
Int4 count;
ValNodePtr elst;
if (begin != NULL)
{
*begin = -1;
}
if (end != NULL)
{
*end = -1;
}
if (str == NULL || *str == '\0')
{
return 0;
}
if (db != TYP_ML && db != TYP_SEQ && db != TYP_AA && db != TYP_NT && db != TYP_ST && db != TYP_CH)
{
return 0;
}
if ((elst = EntrezTLNew(db)) == NULL)
{
return 0;
}
EntrezLexExpression(str, NULL);
StrNextNode();
count = 0;
if (StrExpression(elst, db, fld) && nextnode == NULL)
{
#ifdef _PMENTREZ_
count = EntrezPMTLEvalCount(elst,edc);
#else
count = EntrezTLEvalCount(elst);
#endif /* _PMENTREZ_ */
}
EntrezTLFree(elst);
if (lastGood < lastBad)
{
lastGood = lastBad;
}
if (begin != NULL)
{
*begin = lastGood;
}
if (end != NULL)
{
*end = lastBad;
}
return count;
}
NLM_EXTERN Int4 LIBCALL EntrezTLEvalCountString(CharPtr str, DocType db, DocField fld, Int2Ptr begin, Int2Ptr end)
{
return EntrezPMTLEvalCountString(str,db,fld,begin,end,NULL);
}
NLM_EXTERN Boolean LIBCALL EntrezPMTLParseString(CharPtr str, DocType db, DocField fld, Int2Ptr begin, Int2Ptr end, void * edc)
{
Boolean retval;
if (begin != NULL)
{
*begin = -1;
}
if (end != NULL)
{
*end = -1;
}
if (str == NULL || *str == '\0')
{
return FALSE;
}
if (db != TYP_ML && db != TYP_SEQ && db != TYP_AA && db != TYP_NT && db != TYP_ST && db != TYP_CH)
{
return FALSE;
}
EntrezLexExpression(str, NULL);
StrNextNode();
retval = StrExpression(NULL, db, fld) && nextnode == NULL;
if (lastGood < lastBad)
{
lastGood = lastBad;
}
if (begin != NULL)
{
*begin = lastGood;
}
if (end != NULL)
{
*end = lastBad;
}
return retval;
}
NLM_EXTERN Boolean LIBCALL EntrezTLParseString(CharPtr str, DocType db, DocField fld, Int2Ptr begin, Int2Ptr end)
{
return EntrezPMTLParseString(str,db,fld,begin,end,NULL);
}
NLM_EXTERN CharPtr LIBCALL EntrezCommonHierAncestor(EntrezHierarchyPtr ehp1, EntrezHierarchyPtr ehp2, Int2Ptr distance1, Int2Ptr distance2)
{
Int2 count;
CharPtr retval;
if (ehp1 == NULL || ehp2 == NULL || ehp1->lineage == NULL || ehp2->lineage == NULL)
return NULL;
for (count = 0; count < ehp1->numInLineage && count < ehp2->numInLineage;
count++) {
if (StrCmp(ehp1->lineage[count], ehp2->lineage[count]) != 0)
break;
}
if (count <= 0)
return NULL;
count--;
retval = StringSave(ehp1->lineage[count]);
if (distance1 != NULL)
*distance1 = ehp1->numInLineage - count;
if (distance2 != NULL)
*distance2 = ehp2->numInLineage - count;
return retval;
}
/*****************************************************************************
*
* Function: AccessionToFasta
*
* Description: Returns Fasta entry for given Accession or GI number
*
*****************************************************************************/
#define ATF_INIT_BUFF_SIZE 256
NLM_EXTERN FastaSeqPtr LIBCALL AccessionToFasta(CharPtr string)
{
Int4 gi=0;
SeqEntryPtr sep;
BioseqPtr bsp = NULL;
SeqPortPtr spp;
FastaSeqPtr fseq;
Char buff[512];
Int4 SequenceLen = 0;
Uint1 code;
Boolean is_na;
CharPtr str;
ByteStorePtr bstore;
Int4 GiNum;
if(string == NULL)
return NULL;
if((fseq = MemNew(sizeof(FastaSeq))) == NULL)
return NULL;
fseq->label = NULL;
fseq->seq = NULL;
if((gi = atol(string)) > 0) {
fseq->gi = gi;
} else {
str = (CharPtr) MemNew(StringLen(string)+30);
sprintf(str, "\"%s\"[ACCN]", string);
if((bstore = EntrezTLEvalXString(str, TYP_NT,
-1, NULL, NULL)) == NULL ||
(GiNum = BSLen(bstore)/sizeof(DocUid)) != 1) {
/* Try protein accessions */
if((bstore = EntrezTLEvalXString(str, TYP_AA,
-1, NULL, NULL)) == NULL ||
(GiNum = BSLen(bstore)/sizeof(DocUid)) != 1) {
MemFree(fseq);
MemFree(str);
return NULL;
}
}
MemFree(str);
BSSeek(bstore, 0L, 0);
BSRead(bstore, &gi, sizeof(Int4));
BSFree(bstore);
fseq->gi = gi;
}
/* Now fetching sequence and defline from Entrez */
if((sep = EntrezSeqEntryGet(gi, 1)) == NULL) {
return NULL;
}
if((bsp = find_big_bioseq(sep)) == NULL) {
SeqEntryFree(sep);
return NULL;
}
StringCpy(buff, ">");
SeqIdWrite(bsp->id, buff+1, PRINTID_FASTA_LONG, sizeof(buff));
StringCat(buff, " ");
CreateDefLine(NULL, bsp, buff+StringLen(buff),
sizeof(buff)-StringLen(buff),
0, NULL, NULL);
fseq->label = StringSave(buff);
is_na = ISA_na (bsp->mol);
if (is_na)
code = Seq_code_iupacna;
else
code = Seq_code_ncbieaa;
spp = FastaSeqPort(bsp, is_na, FALSE, code);
fseq->seq = MemNew(ATF_INIT_BUFF_SIZE+1);
while (FastaSeqLine(spp, fseq->seq+SequenceLen,
ATF_INIT_BUFF_SIZE, TRUE)) {
SequenceLen += ATF_INIT_BUFF_SIZE;
fseq->seq = Realloc(fseq->seq, SequenceLen + ATF_INIT_BUFF_SIZE + 1);
}
SeqPortFree(spp);
SeqEntryFree(sep);
return fseq;
}
struct {
CharPtr *theMemory;
Int4 count;
} state;
static Boolean
collectTermsProc (CharPtr term, Int4 special, Int4 total)
{
state.theMemory[state.count++] = term;
return TRUE;
}
NLM_EXTERN CharPtr * LIBCALL GetFullEntrezTermList (DocType database, DocField field, Int4Ptr count)
{
Int4 numTerms;
Int4 numPages;
EntrezInfoPtr info;
Int2 page;
if (!EntrezIsInited ())
return NULL;
info = EntrezGetInfo ();
if (info == NULL || info->type_count <= database)
return NULL;
numTerms = info->types[database].fields[field].num_terms;
numPages = info->types[database].fields[field].num_bucket;
state.theMemory = (CharPtr *) MemNew (sizeof (CharPtr) * numTerms);
state.count = 0;
for (page = 0; page < numPages; page += INT2_MAX / 2) {
EntrezTermListByPage (database, field, page, MIN ((numPages - page), INT2_MAX / 2), collectTermsProc);
}
*count = state.count;
return state.theMemory;
}
|