Skip to content

Commit

Permalink
Merge pull request #1 from Dfam-consortium/development
Browse files Browse the repository at this point in the history
Merge 1.0.7 development branch
  • Loading branch information
rmhubley authored Nov 26, 2024
2 parents df54426 + 9a557e9 commit a1dcd40
Show file tree
Hide file tree
Showing 6 changed files with 32,282 additions and 234,879 deletions.
2 changes: 1 addition & 1 deletion Makefile
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@
####################################################################

# Set the version here
VERSION = 1.0.6
VERSION = 1.0.7

# Installation Directory
INSTDIR = /usr/local/RepeatScout-$(VERSION)
Expand Down
4 changes: 4 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -116,6 +116,10 @@ Contributors to the Dfam consortium maintained version of RepeatScout include:

## Version History

* 1.0.7
* Added capability of recording the extended sequence coordinates for
each seed. This information is optionally stored in a TSV file for
use in downstream analysis.
* 1.0.6
* Switched filter-stage-1.prl from deprecated NSEG to the
DUSTMASKER tool.
Expand Down
16 changes: 8 additions & 8 deletions build_lmer_table.c
Original file line number Diff line number Diff line change
Expand Up @@ -32,7 +32,7 @@ int STOP = -1;

char *sequence;

void usage()
void usage()
{
fprintf(stderr, "build_lmer_table Version %s\n\n"\
"Usage:\n"\
Expand All @@ -48,13 +48,13 @@ void usage()

int main(int argc, char* argv[])
{
time_t start;
//time_t start;
struct llist **headptr;
int *sortedocc, *sortedfreq, ngoodlmers;
long *sortedindex;
FILE* fp;

start = time(0);
//start = time(0);

/* Gather command-line options... */
if( 0 == 1*
Expand Down Expand Up @@ -82,7 +82,7 @@ int main(int argc, char* argv[])
MAXLENGTH = ftell(fp); /* This is an approximation, but an overestimate, so we're ok! */
fclose(fp);

co_get_int(argc, argv, "-l", &l) || (l = default_l(MAXLENGTH));
(void)(co_get_int(argc, argv, "-l", &l) || (l = default_l(MAXLENGTH)));

sequence = (char *)malloc( (MAXLENGTH + PADLENGTH) * sizeof(char) );
if( NULL == sequence ) {
Expand All @@ -97,7 +97,7 @@ int main(int argc, char* argv[])
if((headptr = (struct llist **) malloc(HASH_SIZE*sizeof(*headptr))) == NULL)
{
fprintf(stderr,"Out of memory\n"); exit(1);
}
}
if(VERBOSE) fprintf(stderr," Done allocating headptr\n");
build_headptr(headptr); if(VERBOSE) fprintf(stderr," Done building headptr\n");

Expand All @@ -107,15 +107,15 @@ int main(int argc, char* argv[])
if((sortedfreq = (int *) malloc(ngoodlmers*sizeof(*sortedfreq))) == NULL)
{
fprintf(stderr,"Out of memory\n"); exit(1);
}
}
if((sortedocc = (int *) malloc(ngoodlmers*sizeof(*sortedocc))) == NULL)
{
fprintf(stderr,"Out of memory\n"); exit(1);
}
}
if((sortedindex = (long *) malloc(ngoodlmers*sizeof(*sortedindex))) == NULL)
{
fprintf(stderr,"Out of memory\n"); exit(1);
}
}
sort_headptr(headptr, sortedfreq, sortedocc, sortedindex, ngoodlmers);
if(VERBOSE) fprintf(stderr," Done sorting headptr\n");
if(ngoodlmers == 0) { fprintf(stderr,"OOPS no good lmers\n"); exit(1); }
Expand Down
Loading

0 comments on commit a1dcd40

Please sign in to comment.