set_tools.cpp File Reference

#include <iostream>
#include <algorithm>

Go to the source code of this file.

Macros
#define	_FCALL

Functions
void	remove_duplicates_ (int *array, int *size, int *new_size)
void _FCALL	union_2_sorted_sets_ (int *array1, int *array1_size, int *array2, int *array2_size, int *result, int *result_size)
void _FCALL	intersect_2_sorted_sets_ (int *array1, int *array1_size, int *array2, int *array2_size, int *result, int *result_size)
void _FCALL	difference_2_sorted_sets_ (int *array1, int *array1_size, int *array2, int *array2_size, int *result, int *result_size)
void _FCALL	count_member_list_ (int *union_list, int *size_union_list, int *merged_list, int *size_merged_list, int *number_appearance, int *proc_id)

Macro Definition Documentation

_FCALL

#define _FCALL

Definition at line 28 of file set_tools.cpp.

Function Documentation

count_member_list_()

void _FCALL count_member_list_	(	int *	union_list,
		int *	size_union_list,
		int *	merged_list,
		int *	size_merged_list,
		int *	number_appearance,
		int *	proc_id )

Definition at line 155 of file set_tools.cpp.

  {
    int max_number_appearance = 0 ; 
    for(int i=0; i<*size_union_list ; i++)
    {
        int my_value = union_list[i] ;
        int mycount = std::count ( merged_list,  merged_list+ *size_merged_list, my_value);
        number_appearance[i] = mycount ;
        if(max_number_appearance<mycount)
        {
            *proc_id = i+1 ;
            max_number_appearance = mycount;
        }
    }
  }

difference_2_sorted_sets_()

void _FCALL difference_2_sorted_sets_	(	int *	array1,
		int *	array1_size,
		int *	array2,
		int *	array2_size,
		int *	result,
		int *	result_size )

Definition at line 134 of file set_tools.cpp.

  {
 
    int *fin = set_difference(array1, array1+*array1_size, 
                              array2, array2+*array2_size, 
                              result);
    
    *result_size = fin-result;
  }

intersect_2_sorted_sets_()

void _FCALL intersect_2_sorted_sets_	(	int *	array1,
		int *	array1_size,
		int *	array2,
		int *	array2_size,
		int *	result,
		int *	result_size )

Definition at line 109 of file set_tools.cpp.

  {
 
    int *fin = set_intersection(array1, array1+*array1_size, 
                                array2, array2+*array2_size, 
                                result);
    
    *result_size = fin-result;
  }

remove_duplicates_()

void remove_duplicates_	(	int *	array,
		int *	size,
		int *	new_size )

Definition at line 51 of file set_tools.cpp.

    {
      if ( * size == 0){
        *new_size=0;
        return;
      }
      int sz=1 ;
      int i=1;
 
      while (i< *size) {
         if ( array[i-1] !=  array[i]) {
            array[sz] = array[i];
            sz++;
         }
      i++;
     }
 
     *new_size = sz;
     return;
    }

union_2_sorted_sets_()

void _FCALL union_2_sorted_sets_	(	int *	array1,
		int *	array1_size,
		int *	array2,
		int *	array2_size,
		int *	result,
		int *	result_size )

Definition at line 84 of file set_tools.cpp.

  {
 
    int *fin = set_union(array1, array1+*array1_size, 
                         array2, array2+*array2_size, 
                         result);
    
    *result_size = fin-result;
  }