 				ELSE
 					-- Second (_rank>1) we need to calculate new bounds
 					IF _cal.rank = _rank THEN 				
-						RAISE WARNING 'This is the element of rank %', _cal.rank;
+						-- RAISE DEBUG 'This is the element of rank %', _cal.rank;
 						_cal_elt_rank_found := TRUE;
 						-- In that case we MUST use the new start/end dates (because the current one could be false until COMMIT)
 						SELECT * FROM atomicdatecomputation(_start_date, _end_date, _operator,  _computed_date_pair) INTO _computed_date_pair;
 					ELSE
-						RAISE WARNING 'Element of rank %', _cal.rank;
+						-- RAISE DEBUG 'Element of rank %', _cal.rank;
 						SELECT * FROM atomicdatecomputation(_cal.start_date, _cal.end_date, _cal.operator, _computed_date_pair) INTO _computed_date_pair;
 					END IF;
 				END IF;

		SELECT count(*) FROM calendar_element WHERE calendar_id = _calendar_id INTO _rank;
		_rank := _rank + 1;
		
		RAISE WARNING 'We insert a new element of rank %, date are (%, %)', _rank, _real_start_date, _real_end_date;
		-- Third, recalculate calendar start/end computed dates and recursively for all calendars that include this one
		BEGIN
			-- The new calendar_element is not already inserted so we need to pass information about it on sub routines

					END IF;
				END IF;
			WHEN '&'::calendar_operator THEN -- Must calculate intersection
				IF _start_date IS NULL THEN
					-- We assume that if _start_date is NULL _end_date is also NULL
					_computed_date_pair.start_date := NULL;
