cantor_set.c File Reference

Program to generate Cantor ternary set More...

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

Include dependency graph for cantor_set.c:

Data Structures
struct	_cantor_set
	structure to define Cantor set More...

Typedefs
typedef struct _cantor_set	CantorSet
	structure to define Cantor set

Functions
void	propagate (CantorSet *head)
	Iterative constructor of all sets in the current level. More...
void	print (CantorSet *head)
	Print sets in the current range to stdout More...
void	free_memory (CantorSet *head)
	Clear memory allocated by propagate function. More...
int	main (int argc, char const *argv[])
	Main function.

Detailed Description

Program to generate Cantor ternary set

Function Documentation

free_memory()

void free_memory

(

CantorSet *

head

)

Clear memory allocated by propagate function.

Parameters

head	pointer to first allocated instance.

{
    if (!head)
        return;
 
    if (head->next)
        free_memory(head->next);
 
    free(head);
}

print()

void print

(

CantorSet *

head

)

Print sets in the current range to stdout

Parameters

head	pointer to first set in the current level

{
    CantorSet *temp = head;
    while (temp != NULL)  // print while a valid set is found
    {
        printf("\t");
        printf("[%lf] -- ", temp->start);
        printf("[%lf]", temp->end);
        temp = temp->next;
    }
 
    printf("\n");
}

propagate()

void propagate

(

CantorSet *

head

)

Iterative constructor of all sets in the current level.

This function dynamically allocates memory when creating new sets. These are freed by the function free_memory.

Parameters

head	pointer to interval set instance to update

{
    // if input is NULL, ignore the process
    if (head == NULL)
        return;
 
    CantorSet *temp = head;  // local pointer to track propagation
 
    // create new node for the new set
    CantorSet *newNode = (CantorSet *)malloc(sizeof(CantorSet));
 
    // get 1/3rd of interval
    double diff = (((temp->end) - (temp->start)) / 3);
 
    // update interval ranges
    newNode->end = temp->end;
    temp->end = ((temp->start) + diff);
    newNode->start = (newNode->end) - diff;
 
    // update pointer to next set in this level
    newNode->next = temp->next;
 
    // point to next set
    temp->next = newNode;
 
    // create next set
    propagate(temp->next->next);
}

Here is the call graph for this function: