Find.c

#include"find.h$"$

char$*$lineptr$[$MAX$\_$LINES$]$;

int readlines$()\{$

int len, nlines;

char$*$p$,$ line$[$MAX$\_$LEN$]$;

nlines $=0$;

while$($fgets$($line$,$ MAX$\_$LEN, stdin$))\{$

len $=$ strlen$($line$)$;

if$($nlines $>=$ MAX$\_$LINES $||($p $=$ malloc$($len $+1))==$ NULL$)$

return $-1$;

else$\{$

if$($line$[$len $-1]==\text{'}$

$\text{'})$

line$[$len $-1]=\text{'}\backslash 0\text{'}$;

strcpy$($p$,$ line$)$;

lineptr$[$nlines$++]=$ p;

$\}$

$\}$

return nlines;

$\}$

void error$($int error$\_$code$)\{$

printf$("$find: fatal error $-$ Illegal usage. Error code: $\%$d$.$ Usage: $\backslash "\%$s$\backslash "$

$",$

error$\_$code, "find $[-$n$][-$x$][-$s$][-$r$][-$m$][-$c$][-$f$][-$p$]$ pattern"$)$;

exit$($error$\_$code$)$;

$\}$

flags set$\_$flags$($int argc, char$**$ argv$)\{$

flags option $=0$

for$($int i $=1$; i $$ argc $-1$;i$++)\{$

if$($argv$[$i$][0]!=\text{'}-\text{'})$

error$(2)$;

for$($int j $=1$; argv$[$i$][$j$]!=\text{'}\backslash 0\text{'}$;j$++)$

switch$($argv$[$i$][$j$])\{$

case $\text{'}$n$\text{'}$:case $\text{'}$N$\text{'}$:

option $|=$ NUMBERED;

break;

case $\text{'}$x$\text{'}$:case $\text{'}$X$\text{'}$:

option $|=$ EXCEPT;

break;

case $\text{'}$s$\text{'}$:case $\text{'}$S$\text{'}$:

option $|=$ SORTED;

break;

case $\text{'}$r$\text{'}$:case $\text{'}$R$\text{'}$:

option $|=$ REVERSED;

break;

case $\text{'}$m$\text{'}$:case $\text{'}$M$\text{'}$:

option $|=$ MATCHED;

break;

case $\text{'}$c$\text{'}$:case $\text{'}$C$\text{'}$:

option $|=$ CASE;

break;

case $\text{'}$f$\text{'}$:case $\text{'}$F$\text{'}$:

option $|=$ FIRST;

break;

case $\text{'}$p$\text{'}$:case $\text{'}$P$\text{'}$:

option $|=$ PARTIAL;

break;

default:

error$(3)$;

$\}$

$\}$

return option;

$\}$

int main$($int argc, char$**$ argv$)$

$\{$

if$($argc $<mtext\; id="EditorElement\_2147136"></mtext><mn\; id="EditorElement\_2147137">2</mn><mi\; id="EditorElement\_2147138">)</mi>$

error$(1)$;

char$*$ pattern $=$ strdup$($argv$[$argc $-1])$;

flags option $=$ set$\_$flags$($argc$,$ argv$)$;

if$(($option & REVERSED$)$ && $($option & SORTED$))$

error$(4)$;

int nlines $=$ readlines$()$;

if$($option & SORTED$)$

quicksort$($lineptr$,0,$ nlines $-1)$;

char initial$[10]=""$;

for$($int i $=0$; i $$ nlines;i$++)\{$

if$($option & NUMBERED$)$

sprintf$($initial$,"\%$d$.",$ i $+1)$;

char$*$ first$\_$occurrence $=$ strstr$\_$w$\_$option$($lineptr$[$i$],$ pattern, option$)$;

if$((($option & EXCEPT$)!=0)!=($first$\_$occurrence $!=$ NULL$))$

printf$("\%$s$\%$s

$",$ initial, lineptr$[$i

$\}$

return $0$;

$\}$

Find.h

#include

#include

#include

extern char$*$lineptr$[]$;

#define MAX$\_$LINES $1000$

#define MAX$\_$LEN $1000$

typedef enum$\{$

NUMBERED $=1,$

EXCEPT

SORTED

REVERSED

MATCHED

CASE

FIRST

PARTIAL

$\}$flags;

char$*$ strstr$\_$w$\_$option$($char$*$ haystack, char$*$ needle, flags option$)$;

void quicksort$($char$*$str$[],$ int left, int right$)$;

util.c

#include"find.h$"$

static char $*$strstr$\_$fully$\_$matched$($char $*$haystack$,$ char $*$needle$)\{$

char $*$rv;

char padded$\_$needle$[$strlen$($needle$)+3]$;

padded$\_$needle$[0]=\text{'}\text{'}$;

strcpy$($padded$\_$needle $+1,$ needle$)$;

padded$\_$needle$[$strlen$($needle$)+1]=\text{'}\text{'}$;

padded$\_$needle$[$strlen$($needle$)+2]=\text{'}\backslash 0\text{'}$

if$(!$strcmp$($needle$,$ haystack$))$

return haystack

if $(!$strncmp$($haystack$,$ padded$\_$needle $+1,$ strlen$($needle$)+1))\{$

return haystack;

$\}$

if $(($rv $=$ strstr$($haystack$,$ padded$\_$needle$))!=$ NULL$)\{$

return rv $+1$;

$\}$

padded$\_$needle$[$strlen$($needle$)+1]=\text{'}\backslash 0\text{'}$;

if $(($rv $=$ strstr$($haystack$,$ padded$\_$needle$))!=$ NULL &&

rv$[$strlen$($padded$\_$needle$)]==\text{'}\backslash 0\text{'})\{$

return rv $+1$;

$\}$

return NULL;

$\}$

static void to$\_$lower$($char$*$ input$)\{$

for$($int i $=0$;i $$ strlen$($input$)$;i$++)$

input$[$i$]=$ tolower$($input$[$i$])$;

$\}$

char$*$ strstr$\_$w$\_$option$($char$*$ haystack, char$*$ needle, flags option$)\{$

if$($option & CASE$)\{$

to$\_$lower$($haystack $=$ strdup$($haystack$))$;

to$\_$lower$($needle $=$ strdup$($needle$))$;

if$($option & MATCHED$)$

return strstr$\_$fully$\_$matched$($haystack$,$ needle$)$;

else

return strstr$($haystack$,$ needle$)$;

$\}$else if$($option & MATCHED$)$

return strstr$\_$fully$\_$matched$($haystack$,$ needle$)$;

else

return strstr$($haystack$,$ needle$)$;

$\}$

static void swap$($void$**$ v$,$ int i$,$ int j$)\{$

void$*$ temp $=$ v$[$i$]$;

v$[$i$]=$ v$[$j$]$;

v$[$j$]=$ temp;

$\}$

void quicksort$($char$*$str$[],$ int left, int right$)\{$

int i$,$ last;

if$($left $>=$ right$)$

return;

swap$($str$,$ left, left $+($right$-$left$)/2)$;

last $=$ left;

for$($i $=$ left $+1$; i right;i$++)$

if$($strcmp$($str$[$i$],$str$[$left$])<mtext\; id="EditorElement\_2149717"></mtext><mn\; id="EditorElement\_2149718">0</mn><mi\; id="EditorElement\_2149719">)</mi>$

swap$($str$,++$last, i$)$;

swap$($str$,$ left, last$)$;

quicksort$($str$,$ left, last$-1)$;

quicksort$($str$,$ last$+1,$ right$)$;

$\}$

My professor told me when I ask him for help and clarification he was traveling and couldn$$t and to reach out to a teachers assistant but they won$$t answer anyone in my class. I need help on this assignment I have given my code and don$$t know what the issue is$.$